- How can a line segment with extension be composed of extensionless points?Brian Reese, Michael Vazquez & Scott Weinstein - 2022 - Synthese 200 (2):1-28.details
|
|
The abstract type of the real numbers.Fernando Ferreira - 2021 - Archive for Mathematical Logic 60 (7):1005-1017.details
|
|
Short note: Least fixed points versus least closed points.Gerhard Jäger - 2021 - Archive for Mathematical Logic 60 (7):831-835.details
|
|
The Potential in Frege’s Theorem.Will Stafford - 2023 - Review of Symbolic Logic 16 (2):553-577.details
|
|
Review of John Stillwell, Reverse Mathematics: Proofs from the Inside Out. [REVIEW]Benedict Eastaugh - 2020 - Philosophia Mathematica 28 (1):108-116.details
|
|
Otávio Bueno* and Steven French.**Applying Mathematics: Immersion, Inference, Interpretation. [REVIEW]Anthony F. Peressini - 2020 - Philosophia Mathematica 28 (1):116-127.details
|
|
Suggestion for Teaching Science as a Pluralist Enterprise.Antonino Drago - 2018 - Transversal: International Journal for the Historiography of Science 5:66-83.details
|
|
Exploring Predicativity.Laura Crosilla - 1995 - In Klaus Mainzer, Peter Schuster & Helmut Schwichtenberg (eds.), Proof and Computation. World Scientific. pp. 83-108.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
|
|
The determinacy strength of Π 2 1 -comprehension.Christoph Heinatsch & Michael Möllerfeld - 2010 - Annals of Pure and Applied Logic 161 (12):1462-1470.details
|
|
Deflationism beyond arithmetic.Kentaro Fujimoto - 2019 - Synthese 196 (3):1045-1069.details
|
|
Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrewsdetails
|
|
Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017details
|
|
The foundations of mathematics from a historical viewpoint.Antonino Drago - 2015 - Epistemologia 38 (1):133-151.details
|
|
Theories and Ordinals in Proof Theory.Michael Rathjen - 2006 - Synthese 148 (3):719-743.details
|
|
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory.Michael Rathjen - 2005 - Synthese 147 (1):81-120.details
|
|
Axiomatizing semantic theories of truth?Martin Fischer, Volker Halbach, Jönne Kriener & Johannes Stern - 2015 - Review of Symbolic Logic 8 (2):257-278.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
|
|
On the Concept of Finitism.Luca Incurvati - 2015 - Synthese 192 (8):2413-2436.details
|
|
Reverse mathematics and initial intervals.Emanuele Frittaion & Alberto Marcone - 2014 - Annals of Pure and Applied Logic 165 (3):858-879.details
|
|
Propagation of partial randomness.Kojiro Higuchi, W. M. Phillip Hudelson, Stephen G. Simpson & Keita Yokoyama - 2014 - Annals of Pure and Applied Logic 165 (2):742-758.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
|
|
Remarks on applicative theories.Andrea Cantini - 2005 - Annals of Pure and Applied Logic 136 (1-2):91-115.details
|
|
Reflections on reflections in explicit mathematics.Gerhard Jäger & Thomas Strahm - 2005 - Annals of Pure and Applied Logic 136 (1-2):116-133.details
|
|
Systems of explicit mathematics with non-constructive μ-operator and join.Thomas Glaß & Thomas Strahm - 1996 - Annals of Pure and Applied Logic 82 (2):193-219.details
|
|
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
|
|
More on lower bounds for partitioning α-large sets.Henryk Kotlarski, Bożena Piekart & Andreas Weiermann - 2007 - Annals of Pure and Applied Logic 147 (3):113-126.details
|
|
Empiricism, Probability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Journal of Applied Logic 12 (3):319–348.details
|
|
Logicism, Interpretability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Review of Symbolic Logic 7 (1):84-119.details
|
|
Reverse-engineering Reverse Mathematics.Sam Sanders - 2013 - Annals of Pure and Applied Logic 164 (5):528-541.details
|
|
Kripke-Platek Set Theory and the Anti-Foundation Axiom.Michael Rathjen - 2001 - Mathematical Logic Quarterly 47 (4):435-440.details
|
|
Subsystems of second-order arithmetic between RCA0 and WKL0.Carl Mummert - 2008 - Archive for Mathematical Logic 47 (3):205-210.details
|
|
The strong soundness theorem for real closed fields and Hilbert’s Nullstellensatz in second order arithmetic.Nobuyuki Sakamoto & Kazuyuki Tanaka - 2004 - Archive for Mathematical Logic 43 (3):337-349.details
|
|
Complex analysis in subsystems of second order arithmetic.Keita Yokoyama - 2007 - Archive for Mathematical Logic 46 (1):15-35.details
|
|
Strict $${\Pi^1_1}$$ -reflection in bounded arithmetic.António M. Fernandes - 2010 - Archive for Mathematical Logic 49 (1):17-34.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
|
|
Ramsey’s theorem for trees: the polarized tree theorem and notions of stability. [REVIEW]Damir D. Dzhafarov, Jeffry L. Hirst & Tamara J. Lakins - 2010 - Archive for Mathematical Logic 49 (3):399-415.details
|
|
An ordinal analysis for theories of self-referential truth.Graham Emil Leigh & Michael Rathjen - 2010 - Archive for Mathematical Logic 49 (2):213-247.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
|
|
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.details
|
|
Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.details
|
|
Reverse mathematics of separably closed sets.Jeffry L. Hirst - 2006 - Archive for Mathematical Logic 45 (1):1-2.details
|
|
Vitali's Theorem and WWKL.Douglas K. Brown, Mariagnese Giusto & Stephen G. Simpson - 2002 - Archive for Mathematical Logic 41 (2):191-206.details
|
|
Fixed point theories and dependent choice.Gerhard Jäger & Thomas Strahm - 2000 - Archive for Mathematical Logic 39 (7):493-508.details
|
|
Fast-Collapsing Theories.Samuel A. Alexander - 2013 - Studia Logica (1):1-21.details
|
|
Ordinal arithmetic with simultaneously defined theta‐functions.Andreas Weiermann & Gunnar Wilken - 2011 - Mathematical Logic Quarterly 57 (2):116-132.details
|
|
Supra-logic: using transfinite type theory with type variables for paraconsistency.Jørgen Villadsen - 2005 - Journal of Applied Non-Classical Logics 15 (1):45-58.details
|
|
Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.details
|
|
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
|
|
Reclassifying the antithesis of Specker’s theorem.Hannes Diener - 2012 - Archive for Mathematical Logic 51 (7-8):687-693.details
|
|