- 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
Baire Categoricity and $\Sigma^{0}_{1}$ -Induction
Notre Dame Journal of Formal Logic 55 (1):75-78 (2014)
Abstract
This article has no associated abstract. (fix it)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
On the $\Sigma^01$-conservativity of $\Sigma^01$-completeness.Albert Visser - 1991 - Notre Dame Journal of Formal Logic 32 (4):554-561.
An analysis of the concept of constructive categoricity.Charles Francis Quinn - 1974 - Notre Dame Journal of Formal Logic 15 (4):511-551.
[Symbol] o-categoricity over a predicate.Anand Pillay - 1983 - Notre Dame Journal of Formal Logic 24:527-536.
The categoricity spectrum of pseudo-elementary classes.Michael Chris Laskowski - 1992 - Notre Dame Journal of Formal Logic 33 (3):332-347.
Degrees of Categoricity and the Hyperarithmetic Hierarchy.Barbara F. Csima, Johanna N. Y. Franklin & Richard A. Shore - 2013 - Notre Dame Journal of Formal Logic 54 (2):215-231.
The Nonαxiomαtizαbility of 1.(0^) by Finitely Many Schemata.Saharon Shelah & Charles Steinhorn - 1989 - Notre Dame Journal of Formal Logic 31 (1):1-13.
Transitivity, supertransitivity and induction.W. Russell Belding, Richard L. Poss & Paul J. Welsh - 1972 - Notre Dame Journal of Formal Logic 13 (2):177-190.
Career induction for quantifiers.Robert K. Meyer - 1980 - Notre Dame Journal of Formal Logic 21 (3):539-548.
Induction on fields of binary relations.W. Russell Belding - 1972 - Notre Dame Journal of Formal Logic 13 (2):191-194.
Analytics
Added to PP
2014-01-23
Downloads
20 (#181,865)
6 months
10 (#1,198,792)
2014-01-23
Downloads
20 (#181,865)
6 months
10 (#1,198,792)
Historical graph of downloads
Citations of this work
Reverse mathematics, young diagrams, and the ascending chain condition.Kostas Hatzikiriakou & Stephen G. Simpson - 2017 - Journal of Symbolic Logic 82 (2):576-589.
On the Uniform Computational Content of the Baire Category Theorem.Vasco Brattka, Matthew Hendtlass & Alexander P. Kreuzer - 2018 - Notre Dame Journal of Formal Logic 59 (4):605-636.
Primitive recursive reverse mathematics.Nikolay Bazhenov, Marta Fiori-Carones, Lu Liu & Alexander Melnikov - 2024 - Annals of Pure and Applied Logic 175 (1):103354.
References found in this work
Reverse mathematics and Peano categoricity.Stephen G. Simpson & Keita Yokoyama - 2013 - Annals of Pure and Applied Logic 164 (3):284-293.
On the strength of Ramsey's theorem without Σ1 -induction.Keita Yokoyama - 2013 - Mathematical Logic Quarterly 59 (1-2):108-111.
The baire category theorem in weak subsystems of second-order arithmetic.Douglas K. Brown & Stephen G. Simpson - 1993 - Journal of Symbolic Logic 58 (2):557-578.
Some conservation results on weak König's lemma.Stephen G. Simpson, Kazuyuki Tanaka & Takeshi Yamazaki - 2002 - Annals of Pure and Applied Logic 118 (1-2):87-114.
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-68866f4b87-6mvtb uwo