Archive for Mathematical Logic 29 (4):213-229 (1990)
| 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
|
| Keywords | No keywords specified (fix it) |
| Categories | (categorize this paper) |
| DOI | 10.1007/BF01651325 |
| Options |
Mark as duplicate
Export citation
Request removal from index
|
Download options
References found in this work BETA
Second-Order Quantifiers and the Complexity of Theories.J. T. Baldwin & S. Shelah - 1985 - Notre Dame Journal of Formal Logic 26 (3):229-303.
Classification Theory and the Number of Nonisomorphic Models.S. Shelah - 1982 - Journal of Symbolic Logic 47 (3):694-696.
Coinductive ℵ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.
Coinductive $Aleph_0$-Categorical Theories.James H. Schmerl - 1990 - Journal of Symbolic Logic 55 (3):1130-1137.
View all 6 references / Add more references
Citations of this work BETA
Triviality, NDOP and Stable Varieties.B. Hart, A. Pillay & S. Starchenko - 1993 - Annals of Pure and Applied Logic 62 (2):119-146.
Similar books and articles
Coinductive Formulas and a Many-Sorted Interpolation Theorem.Ursula Gropp - 1988 - Journal of Symbolic Logic 53 (3):937-960.
Small Universal Families for Graphs Omitting Cliques Without GCH.Katherine Thompson - 2010 - Archive for Mathematical Logic 49 (7-8):799-811.
Reachability is Harder for Directed Than for Undirected Finite Graphs.Miklos Ajtai & Ronald Fagin - 1990 - Journal of Symbolic Logic 55 (1):113-150.
Expansions of Ultrahomogeneous Graphs.J. E. Helmreich - 1995 - Notre Dame Journal of Formal Logic 36 (3):414-424.
Coinductive ℵ0-Categorical Theories.James H. Schmerl - 1990 - Journal of Symbolic Logic 55 (3):1130 - 1137.
Hereditary Undecidability of Some Theories of Finite Structures.Ross Willard - 1994 - Journal of Symbolic Logic 59 (4):1254-1262.
Coinductive $Aleph_0$-Categorical Theories.James H. Schmerl - 1990 - Journal of Symbolic Logic 55 (3):1130-1137.
Domatic Partitions of Computable Graphs.Matthew Jura, Oscar Levin & Tyler Markkanen - 2014 - Archive for Mathematical Logic 53 (1-2):137-155.
Chemical Graph Theory and the Sherlock Holmes Principle.Alexandru T. Balaban - 2013 - Hyle 19 (1):107 - 134.
Why Do Mathematicians Need Different Ways of Presenting Mathematical Objects? The Case of Cayley Graphs.Irina Starikova - 2010 - Topoi 29 (1):41-51.
Universality for Orders and Graphs Which Omit Large Substructures.Katherine Thompson - 2006 - Notre Dame Journal of Formal Logic 47 (2):233-248.
Graphs with ∏ 1 0 (K)Y-Sections.Boško Živaljević - 1993 - Archive for Mathematical Logic 32 (4):259-273.
Game-Theoretical Semantics for Peirce's Existential Graphs.Robert W. Burch - 1994 - Synthese 99 (3):361 - 375.
Analytics
Added to PP index
2013-12-01
Total views
15 ( #701,158 of 2,520,403 )
Recent downloads (6 months)
6 ( #116,935 of 2,520,403 )
2013-12-01
Total views
15 ( #701,158 of 2,520,403 )
Recent downloads (6 months)
6 ( #116,935 of 2,520,403 )
How can I increase my downloads?
Downloads
