- The determinacy strength of Π 2 1 -comprehension.Christoph Heinatsch & Michael Möllerfeld - 2010 - Annals of Pure and Applied Logic 161 (12):1462-1470.details
|
|
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
|
|
Strict finitism, feasibility, and the sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.details
|
|
Models and Computability.W. Dean - 2014 - Philosophia Mathematica 22 (2):143-166.details
|
|
Bernays and the Completeness Theorem.Walter Dean - 2017 - Annals of the Japan Association for Philosophy of Science 25:45-55.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
|
|
Remarks on applicative theories.Andrea Cantini - 2005 - Annals of Pure and Applied Logic 136 (1-2):91-115.details
|
|
The Metamathematics of Putnam’s Model-Theoretic Arguments.Tim Button - 2011 - Erkenntnis 74 (3):321-349.details
|
|
Vitali's Theorem and WWKL.Douglas K. Brown, Mariagnese Giusto & Stephen G. Simpson - 2002 - Archive for Mathematical Logic 41 (2):191-206.details
|
|
Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.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
|
|
Infinite Lotteries, Spinners, Applicability of Hyperreals†.Emanuele Bottazzi & Mikhail G. Katz - 2021 - Philosophia Mathematica 29 (1):88-109.details
|
|
Expressive power of digraph solvability.Marc Bezem, Clemens Grabmayer & Michał Walicki - 2012 - Annals of Pure and Applied Logic 163 (3):200-213.details
|
|
Uniform heyting arithmetic.Ulrich Berger - 2005 - Annals of Pure and Applied Logic 133 (1):125-148.details
|
|
Aligning the weak König lemma, the uniform continuity theorem, and Brouwer’s fan theorem.Josef Berger - 2012 - Annals of Pure and Applied Logic 163 (8):981-985.details
|
|
Axiomatizing Changing Conceptions of the Geometric Continuum II: Archimedes-Descartes-Hilbert-Tarski†.John T. Baldwin - 2019 - Philosophia Mathematica 27 (1):33-60.details
|
|
Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.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
|
|
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
|
|
Geoffrey Hellman* and Stewart Shapiro.**Varieties of Continua—From Regions to Points and Back.Richard T. W. Arthur - 2019 - Philosophia Mathematica 27 (1):148-152.details
|
|
Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.details
|
|
Derivatives of normal functions and $$\omega $$ ω -models.Toshiyasu Arai - 2018 - Archive for Mathematical Logic 57 (5-6):649-664.details
|
|
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
|
|
Fast-Collapsing Theories.Samuel A. Alexander - 2013 - Studia Logica (1):1-21.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
|
|
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory.Michael Rathjen - 2005 - Synthese 147 (1):81-120.details
|
|
The foundations of mathematics from a historical viewpoint.Antonino Drago - 2015 - Epistemologia 38 (1):133-151.details
|
|
Otávio Bueno* and Steven French.**Applying Mathematics: Immersion, Inference, Interpretation. [REVIEW]Anthony F. Peressini - 2020 - Philosophia Mathematica 28 (1):116-127.details
|
|
Review of John Stillwell, Reverse Mathematics: Proofs from the Inside Out. [REVIEW]Benedict Eastaugh - 2020 - Philosophia Mathematica 28 (1):108-116.details
|
|
Amending Frege’s Grundgesetze der Arithmetik.Fernando Ferreira - 2005 - Synthese 147 (1):3-19.details
|
|
Exploring Predicativity.Laura Crosilla - 1995 - In Klaus Mainzer, Peter Schuster & Helmut Schwichtenberg (eds.), Proof and Computation. World Scientific. pp. 83-108.details
|
|
Gödel's functional interpretation and its use in current mathematics.Ulrich Kohlenbach - 2008 - Dialectica 62 (2):223–267.details
|
|
Complex analysis in subsystems of second order arithmetic.Keita Yokoyama - 2007 - Archive for Mathematical Logic 46 (1):15-35.details
|
|
Ring structure theorems and arithmetic comprehension.Huishan Wu - 2020 - Archive for Mathematical Logic 60 (1-2):145-160.details
|
|
In defense of the semantic definition of truth.Jan woleński - 2001 - Synthese 126 (1-2):67 - 90.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
|
|
Ordinal arithmetic with simultaneously defined theta‐functions.Andreas Weiermann & Gunnar Wilken - 2011 - Mathematical Logic Quarterly 57 (2):116-132.details
|
|
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
|
|
Cohesive sets and rainbows.Wei Wang - 2014 - Annals of Pure and Applied Logic 165 (2):389-408.details
|
|
Logicism, Interpretability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Review of Symbolic Logic 7 (1):84-119.details
|
|
Empiricism, Probability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Journal of Applied Logic 12 (3):319–348.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
|
|
Hindman's theorem: An ultrafilter argument in second order arithmetic.Henry Towsner - 2011 - Journal of Symbolic Logic 76 (1):353 - 360.details
|
|
A Simple Proof and Some Difficult Examples for Hindman's Theorem.Henry Towsner - 2012 - Notre Dame Journal of Formal Logic 53 (1):53-65.details
|
|
The logical structure of evolutionary explanation and prediction: Darwinism’s fundamental schema.Neil Tennant - 2014 - Biology and Philosophy 29 (5):611-655.details
|
|
A general theory of abstraction operators.Neil Tennant - 2004 - Philosophical Quarterly 54 (214):105-133.details
|
|
Filters on Computable Posets.Steffen Lempp & Carl Mummert - 2006 - Notre Dame Journal of Formal Logic 47 (4):479-485.details
|
|
The Potential in Frege’s Theorem.Will Stafford - 2023 - Review of Symbolic Logic 16 (2):553-577.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
|
|