Equality and monodic first-order temporal logic

Studia Logica 72 (2):147-156 (2002)
  Copy   BIBTEX

Abstract

It has been shown recently that monodic first-order temporal logic without functional symbols but with equality is incomplete, i.e., the set of the valid formulae of this logic is not recursively enumerable. In this paper we show that an even simpler fragment consisting of monodic monadic two-variable formulae is not recursively enumerable.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,881

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
2009-01-28

Downloads
151 (#125,017)

6 months
17 (#148,352)

Historical graph of downloads
How can I increase my downloads?