- 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
Scott sentences and admissible sets
Annals of Mathematical Logic 7 (2):267 (1974)
Abstract
This article has no associated abstract. (fix it)My notes
Similar books and articles
Polish group actions and effectivity.Barbara Majcher-Iwanow - 2012 - Archive for Mathematical Logic 51 (5-6):563-573.
The pure part of HYP(M).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
Scott's problem for Proper Scott sets.Victoria Gitman - 2008 - Journal of Symbolic Logic 73 (3):845-860.
Bounded Scott Set Saturation.Alex M. McAllister - 2002 - Mathematical Logic Quarterly 48 (2):245-259.
The Pure Part of $mathrm{HYP}(mathscr{M}$).Mark Nadel & Jonathan Stavi - 1977 - Journal of Symbolic Logic 42 (1):33-46.
Theories for admissible sets: a unifying approach to proof theory.Gerhard Jäger - 1986 - Napoli: Bibliopolis.
Reflection of Long Game Formulas.Heikki Heikkilä & Jouko Väänänen - 1994 - Mathematical Logic Quarterly 40 (3):381-392.
Polish group actions, nice topologies, and admissible sets.Barbara Majcher-Iwanow - 2008 - Mathematical Logic Quarterly 54 (6):597-616.
Admissible sets and structures: an approach to definability theory.Jon Barwise - 1975 - New York: Springer Verlag.
On consistent subsets of large sets of satisfiable sentences.Stephen H. Hechler - 2001 - Studia Logica 69 (3):339-349.
Index sets and Scott sentences.J. F. Knight & C. McCoy - 2014 - Archive for Mathematical Logic 53 (5-6):519-524.
Why Propositions Cannot be Sets of Truth-supporting Circumstances.Scott Soames - 2008 - Journal of Philosophical Logic 37 (3):267-276.
Analytics
Added to PP
2014-01-17
Downloads
13 (#1,040,014)
6 months
4 (#796,773)
2014-01-17
Downloads
13 (#1,040,014)
6 months
4 (#796,773)
Historical graph of downloads
Citations of this work
A contextual–hierarchical approach to truth and the liar paradox.Michael Glanzberg - 2004 - Journal of Philosophical Logic 33 (1):27-88.
Borel equivalence relations and classifications of countable models.Greg Hjorth & Alexander S. Kechris - 1996 - Annals of Pure and Applied Logic 82 (3):221-272.
The complexity of Scott sentences of scattered linear orders.Rachael Alvir & Dino Rossegger - 2020 - Journal of Symbolic Logic 85 (3):1079-1101.
Scott complexity of countable structures.Rachael Alvir, Noam Greenberg, Matthew Harrison-Trainor & Dan Turetsky - 2021 - Journal of Symbolic Logic 86 (4):1706-1720.
References found in this work
Logic with denumerably long formulas and finite strings of quantifiers.Dana Scott - 1965 - Journal of Symbolic Logic 36 (1):1104--329.
The next admissible set.K. J. Barwise, R. O. Gandy & Y. N. Moschovakis - 1971 - Journal of Symbolic Logic 36 (1):108-120.
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-5ff6c685cb-rskd8 uwo