- 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
An example concerning Scott heights
Journal of Symbolic Logic 46 (2):301-318 (1981)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
Links
PhilArchive
External links
(no proxy)
Setup an account with your affiliations in order to access resources via your University's proxy server
Through your library
- Sign in / register and customize your OpenURL resolver
- Configure custom resolver
My notes
Similar books and articles
Atomic models higher up.Jessica Millar & Gerald E. Sacks - 2008 - Annals of Pure and Applied Logic 155 (3):225-241.
Makkai M. A compactness result concerning direct, products of models. Fundamenta mathematicae, vol. 57 , pp. 313–325.G. Fuhrken - 1968 - Journal of Symbolic Logic 33 (3):477-477.
M. Makkai. On the model theory of denumerably long formulas with finite strings of quantifiers. The journal of symbolic logic, vol. 34 , pp. 437–459. [REVIEW]H. Jerome Keisler - 1973 - Journal of Symbolic Logic 38 (2):337-337.
Makkai M.. Svenonius sentences and Lindström's theory on preservation theorems. Fundamenta mathematicae, vol. 73 no. 3 , pp. 219–233. [REVIEW]G. Fuhrken - 1975 - Journal of Symbolic Logic 40 (4):635-635.
An application of invariant sets to global definability.Douglas E. Miller - 1979 - Journal of Symbolic Logic 44 (1):9-14.
Computable structures of rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
Mihály Makkai. On PCΔ-classes in the theory of models. English with Russian summary. A Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közleményei, ser. A, vol. 9 no. 1–2 , pp. 159–194. - M. Makkai. Remarks on my paper “On PCΔ-classes in the theory of models.” English with Russian summary. A Magyar Tudományos Akadémia Matematikai Kutató Intézetének Közleményei, ser. A, vol. 9 no. 3 , pp. 601–602. [REVIEW]Thomas Frayne - 1971 - Journal of Symbolic Logic 36 (2):335-336.
Computable Trees of Scott Rank [image] , and Computable Approximation.Wesley Calvert, Julia F. Knight & Jessica Millar - 2006 - Journal of Symbolic Logic 71 (1):283 - 298.
Analytics
Added to PP
2009-01-28
Downloads
49 (#452,488)
6 months
12 (#312,930)
2009-01-28
Downloads
49 (#452,488)
6 months
12 (#312,930)
Historical graph of downloads
Citations of this work
Knight's model, its automorphism group, and characterizing the uncountable cardinals.Greg Hjorth - 2002 - Journal of Mathematical Logic 2 (01):113-144.
Classification from a computable viewpoint.Wesley Calvert & Julia F. Knight - 2006 - Bulletin of Symbolic Logic 12 (2):191-218.
Computable structures of rank.J. F. Knight & J. Millar - 2010 - Journal of Mathematical Logic 10 (1):31-43.
An introduction to the Scott complexity of countable structures and a survey of recent results.Matthew Harrison-Trainor - 2022 - Bulletin of Symbolic Logic 28 (1):71-103.
References found in this work
Models with compactness properties relative to an admissible language.J. P. Ressayre - 1977 - Annals of Mathematical Logic 11 (1):31.
An admissible generalization of a theorem on countable ¹ 1 sets of reals with applications.M. Makkai - 1977 - Annals of Mathematical Logic 11 (1):1.
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-648784bb4d-ls7fw uwo