Quantifier elimination for infinite terms

Archive for Mathematical Logic 31 (1):1-17 (1991)
  Copy   BIBTEX

Abstract

We consider the theoryT IT of infinite terms. The axioms for the theoryT IT are analogous to the Mal'cev's axioms for the theoryT IT of finite terms whose models are the locally free algebras. Recently Maher [Ma] has proved that the theoryT IT in a finite non singular signature plus the Domain Closure Axiom is complete. We give a description of all the complete extension ofT IT from which an effective decision procedure forT IT is obtained. Our approach considers formulas built up with syntactic terms containing pointers. Using such a technique, the analysis of the theoryT IT can be carried out in analogy with Mal'cev's analysis ofT FT. Our results follow from an effective quantifier elimination procedure for formulas with pointers

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,590

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

A well-ordering proof for Feferman's theoryT 0.Gerhard Jäger - 1983 - Archive for Mathematical Logic 23 (1):65-77.
Quantifier elimination for neocompact sets.H. Jerome Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.
Classifying?0-categorical theories.George Weaver - 1988 - Studia Logica 47 (4):327-345.
Quantifier Elimination for Neocompact Sets.H. Keisler - 1998 - Journal of Symbolic Logic 63 (4):1442-1472.
The Role of Quantifier Alternations in Cut Elimination.Philipp Gerhardy - 2005 - Notre Dame Journal of Formal Logic 46 (2):165-171.
Quantifier-eliminable locally finite graphs.Shawn Hedman & Wai Yan Pong - 2011 - Mathematical Logic Quarterly 57 (2):180-185.
A First-order Conditional Probability Logic.Miloš Milošević & Zoran Ognjanović - 2012 - Logic Journal of the IGPL 20 (1):235-253.

Analytics

Added to PP
2013-11-23

Downloads
19 (#190,912)

6 months
3 (#1,723,834)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Add more citations

References found in this work

Foundations of Logic Programming.J. W. Lloyd - 1987 - Journal of Symbolic Logic 52 (1):288-289.

Add more references