- The Price of Mathematical Scepticism.Paul Blain Levy - 2022 - Philosophia Mathematica 30 (3):283-305.details
|
|
Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.details
|
|
On Shavrukov’s Non-Isomorphism Theorem for Diagonalizable Algebras.Evgeny A. Kolmakov - 2024 - Review of Symbolic Logic 17 (1):206-243.details
|
|
Proof, Computation and Agency: Logic at the Crossroads.Johan van Benthem, Amitabha Gupta & Rohit Parikh (eds.) - 2011 - Dordrecht, Netherland: Springer.details
|
|
The Significance of Evidence-based Reasoning in Mathematics, Mathematics Education, Philosophy, and the Natural Sciences.Bhupinder Singh Anand - 2020 - Mumbai: DBA Publishing (First Edition).details
|
|
The Significance of Evidence-based Reasoning for Mathematics, Mathematics Education, Philosophy and the Natural Sciences.Bhupinder Singh Anand - forthcomingdetails
|
|
Rohit Parikh on Logic, Language and Society.Ramaswamy Ramanujam, Lawrence Moss & Can Başkent (eds.) - 2017 - Cham, Switzerland: Springer Verlag.details
|
|
Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeleydetails
|
|
A universal approach to self-referential paradoxes, incompleteness and fixed points.Noson S. Yanofsky - 2003 - Bulletin of Symbolic Logic 9 (3):362-386.details
|
|
Self-verifying axiom systems, the incompleteness theorem and related reflection principles.Dan Willard - 2001 - Journal of Symbolic Logic 66 (2):536-596.details
|
|
On the scheme of induction for bounded arithmetic formulas.A. J. Wilkie & J. B. Paris - 1987 - Annals of Pure and Applied Logic 35 (C):261-302.details
|
|
A generalization of the Second Incompleteness Theorem and some exceptions to it.Dan E. Willard - 2006 - Annals of Pure and Applied Logic 141 (3):472-496.details
|
|
The unprovability of small inconsistency.Albert Visser - 1993 - Archive for Mathematical Logic 32 (4):275-298.details
|
|
The absorption law: Or: how to Kreisel a Hilbert–Bernays–Löb.Albert Visser - 2020 - Archive for Mathematical Logic 60 (3-4):441-468.details
|
|
Provability logic and the completeness principle.Albert Visser & Jetze Zoethout - 2019 - Annals of Pure and Applied Logic 170 (6):718-753.details
|
|
Inconsistency in mathematics and the mathematics of inconsistency.Jean Paul van Bendegem - 2014 - Synthese 191 (13):3063-3078.details
|
|
reputation among logicians as being essentially trivial. I hope to convince the reader that it presents some of the most challenging and intriguing problems in modern logic. Although the problem of the complexity of propositional proofs is very natural, it has been investigated systematically only since the late 1960s. [REVIEW]Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.details
|
|
The complexity of propositional proofs.Alasdair Urquhart - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.details
|
|
Some structural similarities between uncountable sets, powersets and the universe.Athanassios Tzouvaras - 2022 - Mathematical Logic Quarterly 68 (2):136-148.details
|
|
Concepts and Axioms.A. S. Troelstra - 1998 - Philosophia Mathematica 6 (2):195-208.details
|
|
Infinity and continuum in the alternative set theory.Kateřina Trlifajová - 2021 - European Journal for Philosophy of Science 12 (1):1-23.details
|
|
Grzegorcyk's hierarchy and IepΣ1.Gaisi Takeuti - 1994 - Journal of Symbolic Logic 59 (4):1274-1284.details
|
|
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.details
|
|
Wittgenstein Sobre as Provas Indutivas.André Porto - 2009 - Dois Pontos 6 (2).details
|
|
Structure and definability in general bounded arithmetic theories.Chris Pollett - 1999 - Annals of Pure and Applied Logic 100 (1-3):189-245.details
|
|
On the finite axiomatizability of.Chris Pollett - 2018 - Mathematical Logic Quarterly 64 (1-2):6-24.details
|
|
Multifunction algebras and the provability of PH↓.Chris Pollett - 2000 - Annals of Pure and Applied Logic 104 (1-3):279-303.details
|
|
On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.details
|
|
Length and structure of proofs.Rohit Parikh - 1998 - Synthese 114 (1):41-48.details
|
|
Upper and lower Ramsey bounds in bounded arithmetic.Kerry Ojakian - 2005 - Annals of Pure and Applied Logic 135 (1-3):135-150.details
|
|
Provably recursive functions of constructive and relatively constructive theories.Morteza Moniri - 2010 - Archive for Mathematical Logic 49 (3):291-300.details
|
|
Homomorphisms and chains of Kripke models.Morteza Moniri & Mostafa Zaare - 2011 - Archive for Mathematical Logic 50 (3-4):431-443.details
|
|
Feasibly constructive proofs of succinct weak circuit lower bounds.Moritz Müller & Ján Pich - 2020 - Annals of Pure and Applied Logic 171 (2):102735.details
|
|
Radical anti-realism, Wittgenstein and the length of proofs.Mathieu Marion - 2009 - Synthese 171 (3):419 - 432.details
|
|
Provability logic-a short introduction.Per Lindström - 1996 - Theoria 62 (1-2):19-61.details
|
|
On the number of steps in proofs.Jan Kraj\mIček - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.details
|
|
On me number of steps in proofs.Jan Krajíèek - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.details
|
|
Combinatorics with definable sets: Euler characteristics and grothendieck rings.Jan Krajíček & Thomas Scanlon - 2000 - Bulletin of Symbolic Logic 6 (3):311-330.details
|
|
Approximate counting and NP search problems.Leszek Aleksander Kołodziejczyk & Neil Thapen - 2022 - Journal of Mathematical Logic 22 (3).details
|
|
Mathematically strong subsystems of analysis with low rate of growth of provably recursive functionals.Ulrich Kohlenbach - 1996 - Archive for Mathematical Logic 36 (1):31-71.details
|
|
Diophantine Induction.Richard Kaye - 1990 - Annals of Pure and Applied Logic 46 (1):1-40.details
|
|
Consistency statements and iterations of computable functions in IΣ1 and PRA.Joost J. Joosten - 2010 - Archive for Mathematical Logic 49 (7-8):773-798.details
|
|
Abelian groups and quadratic residues in weak arithmetic.Emil Jeřábek - 2010 - Mathematical Logic Quarterly 56 (3):262-278.details
|
|
Dual weak pigeonhole principle, Boolean complexity, and derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.details
|
|
On the untenability of Nelson's predicativism.St Iwan - 2000 - Erkenntnis 53 (1-2):147-154.details
|
|
On the Concept of Finitism.Luca Incurvati - 2015 - Synthese 192 (8):2413-2436.details
|
|
Interpretability suprema in Peano Arithmetic.Paula Henk & Albert Visser - 2017 - Archive for Mathematical Logic 56 (5-6):555-584.details
|
|
On ontology and realism in mathematics.Haim Gaifman - 2012 - Review of Symbolic Logic 5 (3):480-512.details
|
|
Another Look at Reflection.Martin Fischer - 2021 - Erkenntnis 88 (2):479-509.details
|
|
Two General Results on Intuitionistic Bounded Theories.Fernando Ferreira - 1999 - Mathematical Logic Quarterly 45 (3):399-407.details
|
|