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

In Hans Kleine Büning (ed.), Computer Science Logic. CSL 1995. Selected Papers. Berlin: Springer. pp. 1--15 (1996)
Download Edit this record How to cite View on PhilPapers
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.
PhilPapers/Archive ID
BAAIOA
Upload history
Archival date: 2017-08-13
View other versions
Added to PP index
2017-08-13

Total views
129 ( #30,872 of 52,923 )

Recent downloads (6 months)
17 ( #33,504 of 52,923 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.