- Philosophy of Mathematical Practice — Motivations, Themes and Prospects†.Jessica Carter - 2019 - Philosophia Mathematica 27 (1):1-32.details
|
|
Does mathematics need new axioms.Solomon Feferman, Harvey M. Friedman, Penelope Maddy & John R. Steel - 1999 - Bulletin of Symbolic Logic 6 (4):401-446.details
|
|
Semantics and Truth.Jan Woleński - 2019 - Cham, Switzerland: Springer Verlag.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
|
|
Nonstandard arithmetic and reverse mathematics.H. Jerome Keisler - 2006 - Bulletin of Symbolic Logic 12 (1):100-125.details
|
|
Hilbert’s Program.Richard Zach - 2012 - In Ed Zalta, Stanford Encyclopedia of Philosophy. Stanford, CA: Stanford Encyclopedia of Philosophy.details
|
|
A graph model for probabilities of nested conditionals.Anna Wójtowicz & Krzysztof Wójtowicz - 2022 - Linguistics and Philosophy 45 (3):511-558.details
|
|
Neo-Logicism and Its Logic.Panu Raatikainen - 2020 - History and Philosophy of Logic 41 (1):82-95.details
|
|
Applied Mathematics without Numbers.Jack Himelright - 2023 - Philosophia Mathematica 31 (2):147-175.details
|
|
Axioms in Mathematical Practice.Dirk Schlimm - 2013 - Philosophia Mathematica 21 (1):37-92.details
|
|
Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.details
|
|
Conceptions of the continuum.Solomon Feferman - unknowndetails
|
|
Deflationism beyond arithmetic.Kentaro Fujimoto - 2019 - Synthese 196 (3):1045-1069.details
|
|
(1 other version)Predicativity.Solomon Feferman - 2005 - In Stewart Shapiro, Oxford Handbook of Philosophy of Mathematics and Logic. Oxford and New York: Oxford University Press. pp. 590-624.details
|
|
Effective choice and boundedness principles in computable analysis.Vasco Brattka & Guido Gherardi - 2011 - Bulletin of Symbolic Logic 17 (1):73-117.details
|
|
Logicism, Interpretability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Review of Symbolic Logic 7 (1):84-119.details
|
|
Strict Finitism, Feasibility, and the Sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.details
|
|
Interpreting classical theories in constructive ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.details
|
|
Stable and Unstable Theories of Truth and Syntax.Beau Madison Mount & Daniel Waxman - 2021 - Mind 130 (518):439-473.details
|
|
Searching for an analogue of atr0 in the Weihrauch lattice.Takayuki Kihara, Alberto Marcone & Arno Pauly - 2020 - Journal of Symbolic Logic 85 (3):1006-1043.details
|
|
Pincherle's theorem in reverse mathematics and computability theory.Dag Normann & Sam Sanders - 2020 - Annals of Pure and Applied Logic 171 (5):102788.details
|
|
Does reductive proof theory have a viable rationale?Solomon Feferman - 2000 - Erkenntnis 53 (1-2):63-96.details
|
|
Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger, Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.details
|
|
Logicism and Neologicism.Neil Tennant - 2013 - Stanford Encyclopedia of Philosophy.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
|
|
Set existence principles and closure conditions: unravelling the standard view of reverse mathematics.Benedict Eastaugh - 2019 - Philosophia Mathematica 27 (2):153-176.details
|
|
Infinite Lotteries, Spinners, Applicability of Hyperreals†.Emanuele Bottazzi & Mikhail G. Katz - 2021 - Philosophia Mathematica 29 (1):88-109.details
|
|
Some Notes on Truths and Comprehension.Thomas Schindler - 2018 - Journal of Philosophical Logic 47 (3):449-479.details
|
|
Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.details
|
|
(1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrewsdetails
|
|
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.details
|
|
Reverse mathematics and Peano categoricity.Stephen G. Simpson & Keita Yokoyama - 2013 - Annals of Pure and Applied Logic 164 (3):284-293.details
|
|
Truth and reduction.Volker Halbach - 2000 - Erkenntnis 53 (1-2):97-126.details
|
|
A Note on Typed Truth and Consistency Assertions.Carlo Nicolai - 2016 - Journal of Philosophical Logic 45 (1):89-119.details
|
|
The Potential in Frege’s Theorem.Will Stafford - 2023 - Review of Symbolic Logic 16 (2):553-577.details
|
|
Forcing in proof theory.Jeremy Avigad - 2004 - Bulletin of Symbolic Logic 10 (3):305-333.details
|
|
Admissible extensions of subtheories of second order arithmetic.Gerhard Jäger & Michael Rathjen - 2024 - Annals of Pure and Applied Logic 175 (7):103425.details
|
|
A general theory of abstraction operators.Neil Tennant - 2004 - Philosophical Quarterly 54 (214):105-133.details
|
|
Unifying the model theory of first-order and second-order arithmetic via WKL 0 ⁎.Ali Enayat & Tin Lok Wong - 2017 - Annals of Pure and Applied Logic 168 (6):1247-1283.details
|
|
Models and Computability.W. Dean - 2014 - Philosophia Mathematica 22 (2):143-166.details
|
|
Boolos and the Metamathematics of Quine's Definitions of Logical Truth and Consequence.Günther Eder - 2016 - History and Philosophy of Logic 37 (2):170-193.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
|
|
From hierarchies to well-foundedness.Dandolo Flumini & Kentaro Sato - 2014 - Archive for Mathematical Logic 53 (7-8):855-863.details
|
|
The polarized Ramsey’s theorem.Damir D. Dzhafarov & Jeffry L. Hirst - 2009 - Archive for Mathematical Logic 48 (2):141-157.details
|
|
The strength of compactness in Computability Theory and Nonstandard Analysis.Dag Normann & Sam Sanders - 2019 - Annals of Pure and Applied Logic 170 (11):102710.details
|
|
The Metamathematics of Putnam’s Model-Theoretic Arguments.Tim Button - 2011 - Erkenntnis 74 (3):321-349.details
|
|
Objectivity Sans Intelligibility. Hermann Weyl's Symbolic Constructivism.Iulian D. Toader - 2011 - Dissertation, University of Notre Damedetails
|
|
Embeddings between well-orderings: Computability-theoretic reductions.Jun Le Goh - 2020 - Annals of Pure and Applied Logic 171 (6):102789.details
|
|
Reverse mathematics and the equivalence of definitions for well and better quasi-orders.Peter Cholak, Alberto Marcone & Reed Solomon - 2004 - Journal of Symbolic Logic 69 (3):683-712.details
|
|
Reverse formalism 16.Sam Sanders - 2020 - Synthese 197 (2):497-544.details
|
|