Axiomatizing the monodic fragment of first-order temporal logic

Annals of Pure and Applied Logic 118 (1-2):133-145 (2002)
  Copy   BIBTEX

Abstract

It is known that even seemingly small fragments of the first-order temporal logic over the natural numbers are not recursively enumerable. In this paper we show that the monodic fragment is an exception by constructing its finite Hilbert-style axiomatization. We also show that the monodic fragment with equality is not recursively axiomatizable

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 103,401

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

Analytics

Added to PP
2014-01-16

Downloads
43 (#543,787)

6 months
10 (#281,857)

Historical graph of downloads
How can I increase my downloads?