Incompleteness of a first-order Gödel logic and some temporal logics of programs

In Kleine Büning Hans, Computer Science Logic. CSL 1995. Selected Papers. Springer. pp. 1--15 (1996)
  Copy   BIBTEX

Abstract

It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant domains and where the order structure of the model is linear. From this, the unaxiomatizability of Kröger's temporal logic of programs (even of the fragment without the nexttime operator O) and of the authors' temporal logic of linear discrete time with gaps follows.

Other Versions

No versions found

Links

PhilArchive

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Temporal Gödel-Gentzen and Girard translations.Norihiro Kamide - 2013 - Mathematical Logic Quarterly 59 (1-2):66-83.
Expressive completeness of temporal logic of trees.Bernd-Holger Schlingloff - 1992 - Journal of Applied Non-Classical Logics 2 (2):157-180.
Decidable fragments of first-order temporal logics.Ian Hodkinson, Frank Wolter & Michael Zakharyaschev - 2000 - Annals of Pure and Applied Logic 106 (1-3):85-134.

Analytics

Added to PP
2017-08-13

Downloads
552 (#53,266)

6 months
127 (#43,754)

Historical graph of downloads
How can I increase my downloads?

Author Profiles

Richard Zach
University of Calgary