Complete theories with only universal and existential axioms

Journal of Symbolic Logic 52 (3):698-711 (1987)
  Copy   BIBTEX

Abstract

Let T be a complete first-order theory over a finite relational language which is axiomatized by universal and existential sentences. It is shown that T is almost trivial in the sense that the universe of any model of T can be written $F \overset{\cdot}{\cup} I_1 \overset{\cdot}{\cup} I_2 \overset{\cdot}{\cup} \cdots \overset{\cdot}{\cup} I_n$ , where F is finite and I 1 , I 2 ,...,I n are mutually indiscernible over F. Some results about complete theories with ∃∀-axioms over a finite relational language are also mentioned

Links

PhilArchive



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

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

The Automated Discovery of Universal Theories.Kevin T. Kelly - 1986 - Dissertation, University of Pittsburgh
A first-order axiomatization of the theory of finite trees.Rolf Backofen, James Rogers & K. Vijay-Shanker - 1995 - Journal of Logic, Language and Information 4 (1):5-39.
Finite forcing, existential types and complete types.Joram Hirschfeld - 1980 - Journal of Symbolic Logic 45 (1):93-102.
Boolean universes above Boolean models.Friedrich Wehrung - 1993 - Journal of Symbolic Logic 58 (4):1219-1250.
Hybrid logics of separation axioms.Dmitry Sustretov - 2009 - Journal of Logic, Language and Information 18 (4):541-558.
Some model theory of Abelian groups.Paul C. Eklof - 1972 - Journal of Symbolic Logic 37 (2):335-342.

Analytics

Added to PP
2009-01-28

Downloads
52 (#304,864)

6 months
19 (#133,897)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Some coinductive graphs.A. H. Lachlan - 1990 - Archive for Mathematical Logic 29 (4):213-229.

Add more citations

References found in this work

Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.

Add more references