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

In Kleine Büning Hans (ed.), 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.

Author Profiles

Richard Zach
University of Calgary

Analytics

Added to PP
2017-08-13

Downloads
338 (#46,258)

6 months
61 (#62,527)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?