Some coinductive graphs

Archive for Mathematical Logic 29 (4):213-229 (1990)
  Copy   BIBTEX

Abstract

LetT be a universal theory of graphs such that Mod(T) is closed under disjoint unions. Letℳ T be a disjoint union ℳ i such that eachℳ i is a finite model ofT and every finite isomorphism type in Mod(T) is represented in{ℳ i ∶i<Ω3}. We investigate under what conditions onT, Th(ℳ T ) is a coinductive theory, where a theory is called coinductive if it can be axiomatizated by ∃∀-sentences. We also characterize coinductive graphs which have quantifier-free rank 1

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,678

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
2013-12-01

Downloads
18 (#849,057)

6 months
2 (#1,487,340)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Triviality, NDOP and stable varieties.B. Hart, A. Pillay & S. Starchenko - 1993 - Annals of Pure and Applied Logic 62 (2):119-146.

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.
Second-order quantifiers and the complexity of theories.J. T. Baldwin & S. Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):229-303.
Coinductive ℵ0-categorical theories.James H. Schmerl - 1990 - Journal of Symbolic Logic 55 (3):1130 - 1137.
Coinductive $aleph_0$-Categorical Theories.James H. Schmerl - 1990 - Journal of Symbolic Logic 55 (3):1130-1137.
Complete theories with only universal and existential axioms.A. H. Lachlan - 1987 - Journal of Symbolic Logic 52 (3):698-711.

View all 6 references / Add more references