- The Peirce Translation.Martín Escardó & Paulo Oliva - 2012 - Annals of Pure and Applied Logic 163 (6):681-692.details
|
|
On arbitrary sets and ZFC.José Ferreirós - 2011 - Bulletin of Symbolic Logic 17 (3):361-393.details
|
|
Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.details
|
|
Conceptions of the continuum.Solomon Feferman - unknowndetails
|
|
A general theory of abstraction operators.Neil Tennant - 2004 - Philosophical Quarterly 54 (214):105-133.details
|
|
Does reductive proof theory have a viable rationale?Solomon Feferman - 2000 - Erkenntnis 53 (1-2):63-96.details
|
|
Amending Frege’s Grundgesetze der Arithmetik.Fernando Ferreira - 2005 - Synthese 147 (1):3-19.details
|
|
Hartry Field. Science Without Numbers: A Defense of Nominalism 2nd ed. [REVIEW]Geoffrey Hellman & Mary Leng - 2019 - Philosophia Mathematica 27 (1):139-148.details
|
|
A weak variant of Hindman’s Theorem stronger than Hilbert’s Theorem.Lorenzo Carlucci - 2018 - Archive for Mathematical Logic 57 (3-4):381-389.details
|
|
Logical and Epistemic Modality.David Elohim - manuscriptdetails
|
|
A new model construction by making a detour via intuitionistic theories II: Interpretability lower bound of Feferman's explicit mathematics T 0.Kentaro Sato - 2015 - Annals of Pure and Applied Logic 166 (7-8):800-835.details
|
|
(1 other version)Proof mining in L1-approximation.Ulrich Kohlenbach & Paulo Oliva - 2003 - Annals of Pure and Applied Logic 121 (1):1-38.details
|
|
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.details
|
|
Universes in metapredicative analysis.Christian Rüede - 2003 - Archive for Mathematical Logic 42 (2):129-151.details
|
|
Algorithmic randomness, reverse mathematics, and the dominated convergence theorem.Jeremy Avigad, Edward T. Dean & Jason Rute - 2012 - Annals of Pure and Applied Logic 163 (12):1854-1864.details
|
|
Reclassifying the antithesis of Specker’s theorem.Hannes Diener - 2012 - Archive for Mathematical Logic 51 (7-8):687-693.details
|
|
(1 other version)Predicativity.Solomon Feferman - 2005 - In Stewart Shapiro (ed.), Oxford Handbook of Philosophy of Mathematics and Logic. Oxford and New York: Oxford University Press. pp. 590-624.details
|
|
Theories and Ordinals in Proof Theory.Michael Rathjen - 2006 - Synthese 148 (3):719-743.details
|
|
On the Concept of Finitism.Luca Incurvati - 2015 - Synthese 192 (8):2413-2436.details
|
|
A note on the theory of positive induction, $${{\rm ID}^*_1}$$.Bahareh Afshari & Michael Rathjen - 2010 - Archive for Mathematical Logic 49 (2):275-281.details
|
|
Harrington’s conservation theorem redone.Fernando Ferreira & Gilda Ferreira - 2008 - Archive for Mathematical Logic 47 (2):91-100.details
|
|
Teorías de la verdad sin modelos estándar: Un nuevo argumento para adoptar jerarquías.Eduardo Alejandro Barrio - 2011 - Análisis Filosófico 31 (1):7-32.details
|
|
On nominalism.Geoffrey Hellman - 2001 - Philosophy and Phenomenological Research 62 (3):691-705.details
|
|
Strict Finitism, Feasibility, and the Sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.details
|
|
Cone avoidance and randomness preservation.Stephen G. Simpson & Frank Stephan - 2015 - Annals of Pure and Applied Logic 166 (6):713-728.details
|
|
An application of proof mining to nonlinear iterations.Laurenţiu Leuştean - 2014 - Annals of Pure and Applied Logic 165 (9):1484-1500.details
|
|
The strength of infinitary Ramseyan principles can be accessed by their densities.Andrey Bovykin & Andreas Weiermann - 2017 - Annals of Pure and Applied Logic 168 (9):1700-1709.details
|
|
Nonstandard second-order arithmetic and Riemannʼs mapping theorem.Yoshihiro Horihata & Keita Yokoyama - 2014 - Annals of Pure and Applied Logic 165 (2):520-551.details
|
|
Nonstandard arithmetic and recursive comprehension.H. Jerome Keisler - 2010 - Annals of Pure and Applied Logic 161 (8):1047-1062.details
|
|
(1 other version)Partitions of trees and $${{\sf ACA}^\prime_{0}}$$.Bernard A. Anderson & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (3-4):227-230.details
|
|
Reverse mathematics of separably closed sets.Jeffry L. Hirst - 2006 - Archive for Mathematical Logic 45 (1):1-2.details
|
|
.[author unknown] - unknowndetails
|
|
(1 other version)On the proof-theoretic strength of monotone induction in explicit mathematics.Thomas Glaß, Michael Rathjen & Andreas Schlüter - 1997 - Annals of Pure and Applied Logic 85 (1):1-46.details
|
|
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.details
|
|
(1 other version)Menger’s theorem in \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${{\Pi^11\tt{-CA}0}}$$\end{document}. [REVIEW]Paul Shafer - 2012 - Archive for Mathematical Logic 51 (3-4):407-423.details
|
|
Axioms in Mathematical Practice.Dirk Schlimm - 2013 - Philosophia Mathematica 21 (1):37-92.details
|
|
Ring structure theorems and arithmetic comprehension.Huishan Wu - 2020 - Archive for Mathematical Logic 60 (1-2):145-160.details
|
|
Large Cardinals, Inner Models, and Determinacy: An Introductory Overview.P. D. Welch - 2015 - Notre Dame Journal of Formal Logic 56 (1):213-242.details
|
|
Reverse mathematics and Peano categoricity.Stephen G. Simpson & Keita Yokoyama - 2013 - Annals of Pure and Applied Logic 164 (3):284-293.details
|
|
On the Notion of Object. A Logical Genealogy.Fernando Ferreira - 2012 - Disputatio 4 (34):609-624.details
|
|
Logicism Revisited.Otávio Bueno - 2001 - Principia 5 (1-2):99-124.details
|
|
Short note: Least fixed points versus least closed points.Gerhard Jäger - 2021 - Archive for Mathematical Logic 60 (7):831-835.details
|
|
The uniform content of partial and linear orders.Eric P. Astor, Damir D. Dzhafarov, Reed Solomon & Jacob Suggs - 2017 - Annals of Pure and Applied Logic 168 (6):1153-1171.details
|
|
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory.Michael Rathjen - 2005 - Synthese 147 (1):81-120.details
|
|
Reverse-engineering Reverse Mathematics.Sam Sanders - 2013 - Annals of Pure and Applied Logic 164 (5):528-541.details
|
|
Subsystems of second-order arithmetic between RCA0 and WKL0.Carl Mummert - 2008 - Archive for Mathematical Logic 47 (3):205-210.details
|
|
Complex analysis in subsystems of second order arithmetic.Keita Yokoyama - 2007 - Archive for Mathematical Logic 46 (1):15-35.details
|
|
A note on definability in fragments of arithmetic with free unary predicates.Stanislav O. Speranski - 2013 - Archive for Mathematical Logic 52 (5-6):507-516.details
|
|
Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.details
|
|
Infinite Lotteries, Spinners, Applicability of Hyperreals†.Emanuele Bottazzi & Mikhail G. Katz - 2021 - Philosophia Mathematica 29 (1):88-109.details
|
|