Taming first-order logic

Logic Journal of the IGPL 6 (2):305-316 (1998)
  Copy   BIBTEX

Abstract

In this paper we define computationally well-behaved versions of classical first-order logic and prove that the validity problem is decidable

Other Versions

No versions found

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 101,225

External links

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

Through your library

Analytics

Added to PP
2014-01-21

Downloads
43 (#518,085)

6 months
7 (#704,497)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Multi-dimensional modal logic.Maarten Marx - 1996 - Boston, Mass.: Kluwer Academic Publishers. Edited by Yde Venema.
Tolerance logic.Maarten Marx - 2001 - Journal of Logic, Language and Information 10 (3):353-374.
Taming logic.Maarten Marx, Szabolcs Mikul & István Németi - 1995 - Journal of Logic, Language and Information 4 (3):207-226.
Undecidable relativizations of algebras of relations.Szabolcs Mikulas & Maarten Marx - 1999 - Journal of Symbolic Logic 64 (2):747-760.

Add more citations

References found in this work

No references found.

Add more references