- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Countable models of 1-based theories
Archive for Mathematical Logic 31 (3):163-169 (1992)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
A note on countable models of 1-based theories.Predrag Tanovic - 2002 - Archive for Mathematical Logic 41 (7):669-671.
Superstable theories with few countable models.Lee Fong Low & Anand Pillay - 1992 - Archive for Mathematical Logic 31 (6):457-465.
Theories with exactly three countable models and theories with algebraic prime models.Anand Pillay - 1980 - Journal of Symbolic Logic 45 (2):302-310.
A note on countable complete theories having three isomorphism types of countable models.Robert E. Woodrow - 1976 - Journal of Symbolic Logic 41 (3):672-680.
Theories with constants and three countable models.Predrag Tanović - 2007 - Archive for Mathematical Logic 46 (5-6):517-527.
Theories with a finite number of countable models.Robert E. Woodrow - 1978 - Journal of Symbolic Logic 43 (3):442-455.
Stable theories, pseudoplanes and the number of countable models.Anand Pillay - 1989 - Annals of Pure and Applied Logic 43 (2):147-160.
Computable Models of Theories with Few Models.Bakhadyr Khoussainov, Andre Nies & Richard A. Shore - 1997 - Notre Dame Journal of Formal Logic 38 (2):165-178.
1-based theories — the main gap for a -models.B. Hart, A. Pillay & S. Starchenko - 1995 - Archive for Mathematical Logic 34 (5):285-300.
Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
On Theories Having Three Countable Models.Koichiro Ikeda, Akito Tsuboi & Anand Pillay - 1998 - Mathematical Logic Quarterly 44 (2):161-166.
Remarks on Structure Theorems for -Saturated Models.Tapani Hyttinen - 1995 - Notre Dame Journal of Formal Logic 36 (2):269-278.
A complicated ω-stable depth 2 theory.Martin Koerwien - 2011 - Journal of Symbolic Logic 76 (1):47 - 65.
End extensions and numbers of countable models.Saharon Shelah - 1978 - Journal of Symbolic Logic 43 (3):550-562.
Analytics
Added to PP
2013-11-23
Downloads
37 (#420,900)
6 months
9 (#290,637)
2013-11-23
Downloads
37 (#420,900)
6 months
9 (#290,637)
Historical graph of downloads
Citations of this work
Countable models of trivial theories which admit finite coding.James Loveys & Predrag Tanović - 1996 - Journal of Symbolic Logic 61 (4):1279-1286.
An omitting types theorem for saturated structures.A. D. Greif & M. C. Laskowski - 1993 - Annals of Pure and Applied Logic 62 (2):113-118.
A note on countable models of 1-based theories.Predrag Tanovic - 2002 - Archive for Mathematical Logic 41 (7):669-671.
Triviality, NDOP and stable varieties.B. Hart, A. Pillay & S. Starchenko - 1993 - Annals of Pure and Applied Logic 62 (2):119-146.
References found in this work
An exposition of Shelah's "main gap": counting uncountable models of $\omega$-stable and superstable theories.L. Harrington & M. Makkai - 1985 - Notre Dame Journal of Formal Logic 26 (2):139-177.
Kueker's conjecture for stable theories.Ehud Hrushovski - 1989 - Journal of Symbolic Logic 54 (1):207-220.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-7c76586df8-4c2ch uwo