- Logic in mathematics and computer science.Richard Zach - forthcoming - In Filippo Ferrari, Elke Brendel, Massimiliano Carrara, Ole Hjortland, Gil Sagi, Gila Sher & Florian Steinberger (eds.), Oxford Handbook of Philosophy of Logic. Oxford, UK: Oxford University Press.details
|
|
Ontology of Divinity.Mirosław Szatkowski (ed.) - 2024 - De Gruyter.details
|
|
Applied Mathematics without Numbers.Jack Himelright - 2023 - Philosophia Mathematica 31 (2):147-175.details
|
|
Finitist Axiomatic Truth.Sato Kentaro & Jan Walker - 2023 - Journal of Symbolic Logic 88 (1):22-73.details
|
|
Standard Formalization.Jeffrey Ketland - 2022 - Axiomathes 32 (3):711-748.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
|
|
The Potential in Frege’s Theorem.Will Stafford - 2023 - Review of Symbolic Logic 16 (2):553-577.details
|
|
Hilbert's Metamathematical Problems and Their Solutions.Besim Karakadilar - 2008 - Dissertation, Boston Universitydetails
|
|
Semantics and Truth.Jan Woleński - 2019 - Cham, Switzerland: Springer Verlag.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
|
|
A Pluralist Foundation of the Mathematics of the First Half of the Twentieth Century.Antonino Drago - 2017 - Journal of the Indian Council of Philosophical Research 34 (2):343-363.details
|
|
Set existence principles and closure conditions: unravelling the standard view of reverse mathematics.Benedict Eastaugh - 2019 - Philosophia Mathematica 27 (2):153-176.details
|
|
Axiomatizing Changing Conceptions of the Geometric Continuum II: Archimedes-Descartes-Hilbert-Tarski†.John T. Baldwin - 2019 - Philosophia Mathematica 27 (1):33-60.details
|
|
An order-theoretic characterization of the Howard–Bachmann-hierarchy.Jeroen Van der Meeren, Michael Rathjen & Andreas Weiermann - 2017 - Archive for Mathematical Logic 56 (1-2):79-118.details
|
|
Bernays and the Completeness Theorem.Walter Dean - 2017 - Annals of the Japan Association for Philosophy of Science 25:45-55.details
|
|
Review of Denis R. Hirschfeldt, Slicing the Truth: On the Computability Theoretic and Reverse Mathematical Analysis of Combinatorial Principles. [REVIEW]Benedict Eastaugh - 2017 - Studia Logica 105 (4):873-879.details
|
|
(1 other version)Forms of Luminosity: Epistemic Modality and Hyperintensionality in Mathematics.David Elohim - 2017 - Dissertation, Arché, University of St Andrewsdetails
|
|
(1 other version)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
|
|
Neo-Logicism and Its Logic.Panu Raatikainen - 2020 - History and Philosophy of Logic 41 (1):82-95.details
|
|
The logical structure of evolutionary explanation and prediction: Darwinism’s fundamental schema.Neil Tennant - 2014 - Biology and Philosophy 29 (5):611-655.details
|
|
Discrete transfinite computation models.Philip D. Welch - 2011 - In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific. pp. 375--414.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
|
|
Logicism, Interpretability, and Knowledge of Arithmetic.Sean Walsh - 2014 - Review of Symbolic Logic 7 (1):84-119.details
|
|
Multimodal Abduction in Knowledge Development.L. Magnani - 2009 - Preworkshop Proceedings, IJCAI2009International Workshop on Abductive and Inductive Knowledge Development (Pasadena, CA, USA, July 12, 2009).details
|
|
Borel complexity and computability of the Hahn–Banach Theorem.Vasco Brattka - 2008 - Archive for Mathematical Logic 46 (7-8):547-564.details
|
|
Model theory of the regularity and reflection schemes.Ali Enayat & Shahram Mohsenipour - 2008 - Archive for Mathematical Logic 47 (5):447-464.details
|
|
Fast-Collapsing Theories.Samuel A. Alexander - 2013 - Studia Logica (1):1-21.details
|
|
Kolmogorov complexity and the second incompleteness theorem.Makoto Kikuchi - 1997 - Archive for Mathematical Logic 36 (6):437-443.details
|
|
Uniform heyting arithmetic.Ulrich Berger - 2005 - Annals of Pure and Applied Logic 133 (1):125-148.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
|
|
Objectivity Sans Intelligibility. Hermann Weyl's Symbolic Constructivism.Iulian D. Toader - 2011 - Dissertation, University of Notre Damedetails
|
|
A verisimilitudinarian analysis of the Linda paradox.Gustavo Cevolani, Vincenzo Crupi & Roberto Festa - 2012 - VII Conference of the Spanish Society for Logic, Methodology and Philosphy of Science.details
|
|
The Metamathematics of Putnam’s Model-Theoretic Arguments.Tim Button - 2011 - Erkenntnis 74 (3):321-349.details
|
|
Effective Versions of Ramsey's Theorem: Avoiding the Cone Above $\mathbf{0}$'.Tamara Lakins Hummel - 1994 - Journal of Symbolic Logic 59 (4):1301-1325.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
|
|
Reductionism as resource-conscious reasoning.Godehard Link - 2000 - Erkenntnis 53 (1-2):173-193.details
|
|
Ordered groups: A case study in reverse mathematics.Reed Solomon - 1999 - Bulletin of Symbolic Logic 5 (1):45-58.details
|
|
Groundwork for weak analysis.António M. Fernandes & Fernando Ferreira - 2002 - Journal of Symbolic Logic 67 (2):557-578.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
|
|
Forcing in proof theory.Jeremy Avigad - 2004 - Bulletin of Symbolic Logic 10 (3):305-333.details
|
|
(1 other version)Interpreting classical theories in constructive ones.Jeremy Avigad - 2000 - Journal of Symbolic Logic 65 (4):1785-1812.details
|
|
Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.details
|
|
Searching problems above arithmetical transfinite recursion.Yudai Suzuki & Keita Yokoyama - 2024 - Annals of Pure and Applied Logic 175 (10):103488.details
|
|
Reverse mathematics and semisimple rings.Huishan Wu - 2022 - Archive for Mathematical Logic 61 (5):769-793.details
|
|
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
|
|
Equivalents of the finitary non-deterministic inductive definitions.Ayana Hirata, Hajime Ishihara, Tatsuji Kawai & Takako Nemoto - 2019 - Annals of Pure and Applied Logic 170 (10):1256-1272.details
|
|
The Digital and the Real Universe Foundations of Natural Philosophy and Computational Physics.Klaus Mainzer - 2019 - Philosophies 4 (1):3.details
|
|