- 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 relationship between ATR 0 and
Journal of Symbolic Logic 61 (3):768-779 (1996)
Abstract
This article has no associated abstract. (fix it)Author'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
On the relationships between ATR0 and $\widehat{ID}_{.Jeremy Avigad - 1996 - Journal of Symbolic Logic 61 (3):768 - 779.
Formalizing forcing arguments in subsystems of second-order arithmetic.Jeremy Avigad - 1996 - Annals of Pure and Applied Logic 82 (2):165-191.
Transfer principles in nonstandard intuitionistic arithmetic.Jeremy Avigad & Jeffrey Helzner - 2002 - Archive for Mathematical Logic 41 (6):581-602.
Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.
Fundamental notions of analysis in subsystems of second-order arithmetic.Jeremy Avigad - 2006 - Annals of Pure and Applied Logic 139 (1):138-184.
The Computational Content of Classical Arithmetic to Appear in a Festschrift for Grigori Mints.Jeremy Avigad - unknown
A Realizability Interpretation for Classical Arithmetic.Jeremy Avigad - 2002 - Bulletin of Symbolic Logic 8 (3):439-440.
Analytics
Added to PP
2009-01-28
Downloads
72 (#228,439)
6 months
15 (#167,130)
2009-01-28
Downloads
72 (#228,439)
6 months
15 (#167,130)
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.
Elementary inductive dichotomy: Separation of open and clopen determinacies with infinite alternatives.Kentaro Sato - 2020 - Annals of Pure and Applied Logic 171 (3):102754.
Full and hat inductive definitions are equivalent in NBG.Kentaro Sato - 2015 - Archive for Mathematical Logic 54 (1-2):75-112.
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.
A few more dissimilarities between second-order arithmetic and set theory.Kentaro Fujimoto - 2022 - Archive for Mathematical Logic 62 (1):147-206.
References found in this work
Metamathematics of First-Order Arithmetic.Petr Hajék & Pavel Pudlák - 1994 - Studia Logica 53 (3):465-466.
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.
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-64dd777598-pjbg5 uwo