- Strict Finitism, Feasibility, and the Sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.details
|
|
Some structural similarities between uncountable sets, powersets and the universe.Athanassios Tzouvaras - 2022 - Mathematical Logic Quarterly 68 (2):136-148.details
|
|
The Price of Mathematical Scepticism.Paul Blain Levy - 2022 - Philosophia Mathematica 30 (3):283-305.details
|
|
Strict Finitism's Unrequited Love for Computational Complexity.Noel Arteche - manuscriptdetails
|
|
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
|
|
Three Dogmas of First-Order Logic and some Evidence-based Consequences for Constructive Mathematics of differentiating between Hilbertian Theism, Brouwerian Atheism and Finitary Agnosticism.Bhupinder Singh Anand - manuscriptdetails
|
|
The Truth Assignments That Differentiate Human Reasoning From Mechanistic Reasoning: The Evidence-Based Argument for Lucas' Goedelian Thesis.Bhupinder Singh Anand - 2016 - Cognitive Systems Research 40:35-45.details
|
|
What is Mathematics: Gödel's Theorem and Around (Edition 2015).Karlis Podnieks - manuscriptdetails
|
|
Interpretability suprema in Peano Arithmetic.Paula Henk & Albert Visser - 2017 - Archive for Mathematical Logic 56 (5-6):555-584.details
|
|
Hilbert’s Finitism: Historical, Philosophical, and Metamathematical Perspectives.Richard Zach - 2001 - Dissertation, University of California, Berkeleydetails
|
|
On the Concept of Finitism.Luca Incurvati - 2015 - Synthese 192 (8):2413-2436.details
|
|
On me number of steps in proofs.Jan Krajíèek - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.details
|
|
Preservation theorems and restricted consistency statements in bounded arithmetic.Arnold Beckmann - 2004 - Annals of Pure and Applied Logic 126 (1-3):255-280.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
|
|
Structure and definability in general bounded arithmetic theories.Chris Pollett - 1999 - Annals of Pure and Applied Logic 100 (1-3):189-245.details
|
|
Multifunction algebras and the provability of PH↓.Chris Pollett - 2000 - Annals of Pure and Applied Logic 104 (1-3):279-303.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
|
|
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
|
|
Quadratic forms in models of IΔ0+ Ω1, Part II: Local equivalence.Paola D’Aquino & Angus Macintyre - 2011 - Annals of Pure and Applied Logic 162 (6):447-456.details
|
|
Homomorphisms and chains of Kripke models.Morteza Moniri & Mostafa Zaare - 2011 - Archive for Mathematical Logic 50 (3-4):431-443.details
|
|
Provability logic-a short introduction.Per Lindström - 1996 - Theoria 62 (1-2):19-61.details
|
|
Polynomial local search in the polynomial hierarchy and witnessing in fragments of bounded arithmetic.Arnold Beckmann & Samuel R. Buss - 2009 - Journal of Mathematical Logic 9 (1):103-138.details
|
|
On interpretations of bounded arithmetic and bounded set theory.Richard Pettigrew - 2009 - Notre Dame Journal of Formal Logic 50 (2):141-152.details
|
|
The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.details
|
|
Radical anti-realism, Wittgenstein and the length of proofs.Mathieu Marion - 2009 - Synthese 171 (3):419 - 432.details
|
|
Provability logic.Rineke Verbrugge - 2008 - Stanford Encyclopedia of Philosophy.details
|
|
On Infinite Number and Distance.Jeremy Gwiazda - 2012 - Constructivist Foundations 7 (2):126-130.details
|
|
Kurt gödel.Juliette Kennedy - 2008 - Stanford Encyclopedia of Philosophy.details
|
|
Self-verifying axiom systems, the incompleteness theorem and related reflection principles.Dan Willard - 2001 - Journal of Symbolic Logic 66 (2):536-596.details
|
|
Arithmetic without the successor axiom.Andrew Boucher - details
|
|
Another Look at Reflection.Martin Fischer - 2021 - Erkenntnis 88 (2):479-509.details
|
|
Computational Complexity Theory and the Philosophy of Mathematics†.Walter Dean - 2019 - Philosophia Mathematica 27 (3):381-439.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
|
|
Dual weak pigeonhole principle, Boolean complexity, and derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.details
|
|
Relating the bounded arithmetic and polynomial time hierarchies.Samuel R. Buss - 1995 - Annals of Pure and Applied Logic 75 (1-2):67-77.details
|
|
Bounded arithmetic, proof complexity and two papers of Parikh.Samuel R. Buss - 1999 - Annals of Pure and Applied Logic 96 (1-3):43-55.details
|
|
Bounded functional interpretation.Fernando Ferreira & Paulo Oliva - 2005 - Annals of Pure and Applied Logic 135 (1):73-112.details
|
|
L'infinité des nombres premiers : une étude de cas de la pureté des méthodes.Andrew Arana - 2011 - Les Etudes Philosophiques 97 (2):193.details
|
|
A universal approach to self-referential paradoxes, incompleteness and fixed points.Noson S. Yanofsky - 2003 - Bulletin of Symbolic Logic 9 (3):362-386.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
|
|
Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.details
|
|
Wittgenstein Sobre as Provas Indutivas.André Porto - 2009 - Dois Pontos 6 (2).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
|
|
Bounded functional interpretation and feasible analysis.Fernando Ferreira & Paulo Oliva - 2007 - Annals of Pure and Applied Logic 145 (2):115-129.details
|
|
The unprovability of small inconsistency.Albert Visser - 1993 - Archive for Mathematical Logic 32 (4):275-298.details
|
|
Radical anti-realism and substructural logics.Jacques Dubucs & Mathieu Marion - 2003 - In A. Rojszczak, J. Cachro & G. Kurczewski (eds.), Philosophical Dimensions of Logic and Science. Kluwer Academic Publishers. pp. 235--249.details
|
|