- 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
On the relationships between ATR0 and $\widehat{ID}_{
Journal of Symbolic Logic 61 (3):768 - 779 (1996)
Abstract
We show that the theory ATR 0 is equivalent to a second-order generalization of the theory $\widehat{ID}_{ . As a result, ATR 0 is conservative over $\widehat{ID}_{ for arithmetic sentences, though proofs in ATR 0 can be much shorter than their $\widehat{ID}_{ counterpartsAuthor's Profile
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
${LE}^{t}{{\rightarrow}}$ , ${LR}^{\circ}{\hat{\sim}}$, {LK} and Cutfree Proofs.Katalin Bimbó - 2007 - Journal of Philosophical Logic 36 (5):557-570.
Some theories with positive induction of ordinal strength ϕω.Gerhard Jäger & Thomas Strahm - 1996 - Journal of Symbolic Logic 61 (3):818-842.
On the strength of könig's duality theorem for countable bipartite graphs.Stephen G. Simpson - 1994 - Journal of Symbolic Logic 59 (1):113-123.
Isomorphisms of splits of computably enumerable sets.Peter A. Cholak & Leo A. Harrington - 2003 - Journal of Symbolic Logic 68 (3):1044-1064.
On essentially low, canonically well-generated Boolean algebras.Robert Bonnet & Matatyahu Rubin - 2002 - Journal of Symbolic Logic 67 (1):369-396.
The proof-theoretic analysis of transfinitely iterated fixed point theories.Gerhard JÄger, Reinhard Kahle, Anton Setzer & Thomas Strahm - 1999 - Journal of Symbolic Logic 64 (1):53-67.
On the relationship between ATR 0 and.Jeremy Avigad - 1996 - Journal of Symbolic Logic 61 (3):768-779.
Analytics
Added to PP
2009-01-28
Downloads
43 (#362,182)
6 months
14 (#170,561)
2009-01-28
Downloads
43 (#362,182)
6 months
14 (#170,561)
Historical graph of downloads
Author's Profile
Citations of this work
Bounded inductive dichotomy: separation of open and clopen determinacies with finite alternatives in constructive contexts.Kentaro Sato - 2022 - Archive for Mathematical Logic 61 (3):399-435.
Full and hat inductive definitions are equivalent in NBG.Kentaro Sato - 2015 - Archive for Mathematical Logic 54 (1-2):75-112.
Elementary inductive dichotomy: Separation of open and clopen determinacies with infinite alternatives.Kentaro Sato - 2020 - Annals of Pure and Applied Logic 171 (3):102754.
A few more dissimilarities between second-order arithmetic and set theory.Kentaro Fujimoto - 2022 - Archive for Mathematical Logic 62 (1):147-206.
A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.
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-5tf24 uwo