Hybrid Logic as Extension of Modal and Temporal Logics
Abstract Developed by Arthur Prior, Temporal Logic allows to represent temporal information on a logical system using modal (temporal) operators such as P, F, H or G, whose intuitive meaning is “it was sometime in the Past...”, “it will be sometime in the Future...&...
Guardado en:
| Autor principal: | |
|---|---|
| Lenguaje: | English |
| Publicado: |
Universidad de Valparaíso. Facultad de Humanidades .Instituto de Filosofía.
2019
|
| Materias: | |
| Acceso en línea: | http://www.scielo.cl/scielo.php?script=sci_arttext&pid=S0719-42422019000100034 |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| Sumario: | Abstract Developed by Arthur Prior, Temporal Logic allows to represent temporal information on a logical system using modal (temporal) operators such as P, F, H or G, whose intuitive meaning is “it was sometime in the Past...”, “it will be sometime in the Future...”, “it Has always been in the past...” and “it will always Going to be in the future...” respectively. Valuation of formulae built from these operators are carried out on Kripke semantics, so Modal Logic and Temporal Logic are consequently related. In fact, Temporal Logic is an extension of Modal one. Even when both logics mechanisms are able to formalize modal-temporal information with some accuracy, they suffer from a lack of expressiveness which Hybrid Logic can solve. Indeed, one of the problems of Modal Logic consists in its incapacity of naming specific points inside a model. As Temporal Logic is based on it, it cannot make such a thing neither. But First-Order Logic does can by means of constants and equality relation. Hybrid Logic, which results from combining Modal Logic and First-Order Logic, may solve this shortcoming. The main aim of this paper is to explain how Hybrid Logic emanates from Modal and Temporal ones in order to show what it adds to both logics with regard to information representation, why it is more expressive than them and what relation it maintains with the First-Order Correspondence Language. |
|---|