- Acceptable notation.Stewart Shapiro - 1982 - Notre Dame Journal of Formal Logic 23 (1):14-20.details
|
|
Probabilistic proofs and transferability.Kenny Easwaran - 2009 - Philosophia Mathematica 17 (3):341-362.details
|
|
(3 other versions)Philosophy of mathematics.Paul Benacerraf (ed.) - 1964 - Englewood Cliffs, N.J.,: Prentice-Hall.details
|
|
Cognitive and Computational Complexity: Considerations from Mathematical Problem Solving.Markus Pantsar - 2019 - Erkenntnis 86 (4):961-997.details
|
|
Representation and Reality.Richard Rorty - 1992 - Philosophy and Phenomenological Research 52 (2):415-418.details
|
|
(1 other version)The Complexity of Propositional Proofs.Nathan Segerlind - 1995 - Bulletin of Symbolic Logic 1 (4):425-467.details
|
|
(1 other version)The complexity of propositional proofs.Nathan Segerlind - 2007 - Bulletin of Symbolic Logic 13 (4):417-481.details
|
|
Theory of Recursive Functions and Effective Computability.Hartley Rogers - 1971 - Journal of Symbolic Logic 36 (1):141-146.details
|
|
Elements of Intuitionism.Nicolas D. Goodman - 1979 - Journal of Symbolic Logic 44 (2):276-277.details
|
|
From Kant to Hilbert: a source book in the foundations of mathematics.William Bragg Ewald (ed.) - 1996 - New York: Oxford University Press.details
|
|
(1 other version)Understanding the infinite.Shaughan Lavine - 1994 - Cambridge: Harvard University Press.details
|
|
Why philosophers should care about computational complexity.Scott Aaronson - 2013 - Computability: Turing, Gödel, Church, and Beyond:261--328.details
|
|
Theory of recursive functions and effective computability.Hartley Rogers - 1987 - Cambridge: MIT Press.details
|
|
Predicative arithmetic.Edward Nelson - 1986 - Princeton, N.J.: Princeton University Press.details
|
|
Subrecursion: functions and hierarchies.H. E. Rose - 1984 - New York: Oxford University Press.details
|
|
Recursive predicates and quantifiers.S. C. Kleene - 1943 - Transactions of the American Mathematical Society 53:41-73.details
|
|
S. C. Kleene. General recursive functions of natural numbers. Mathematische Annalen, Bd. 112 (1935–1936), S. 727–742.S. C. Kleene - 1937 - Journal of Symbolic Logic 2 (1):38-38.details
|
|
Computers and Intractability. A Guide to the Theory of NP-Completeness.Michael R. Garey & David S. Johnson - 1983 - Journal of Symbolic Logic 48 (2):498-500.details
|
|
Non-standard models in a broader perspective.Haim Gaifman - manuscriptdetails
|
|
(2 other versions)Set Theory.Thomas Jech - 1999 - Studia Logica 63 (2):300-300.details
|
|
(2 other versions)Set Theory.T. Jech - 2005 - Bulletin of Symbolic Logic 11 (2):243-245.details
|
|
On Computable Numbers, with an Application to the Entscheidungsproblem.Alan Turing - 1936 - Proceedings of the London Mathematical Society 42 (1):230-265.details
|
|
Wang's paradox.Michael Dummett - 1975 - Synthese 30 (3-4):201--32.details
|
|
Introduction to Metamathematics.H. Rasiowa - 1954 - Journal of Symbolic Logic 19 (3):215-216.details
|
|
¹1-formulae on finite structures.M. Ajtai - 1983 - Annals of Pure and Applied Logic 24 (1):1.details
|
|
Finitism.W. W. Tait - 1981 - Journal of Philosophy 78 (9):524-546.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
|
|
Is the brain a digital computer?John R. Searle - 1990 - Proceedings and Addresses of the American Philosophical Association 64 (3):21-37.details
|
|
Computation and Cognition: Toward a Foundation for Cognitive Science.Zenon W. Pylyshyn - 1984 - Cambridge: MIT Press.details
|
|
The four-color problem and its philosophical significance.Thomas Tymoczko - 1979 - Journal of Philosophy 76 (2):57-83.details
|
|
Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.details
|
|
A feasible theory for analysis.Fernando Ferreira - 1994 - Journal of Symbolic Logic 59 (3):1001-1011.details
|
|
The Epistemic Status of Probabilistic Proof.Don Fallis - 1997 - Journal of Philosophy 94 (4):165-186.details
|
|
On an alleged refutation of Hilbert's program using gödel's first incompleteness theorem.Michael Detlefsen - 1990 - Journal of Philosophical Logic 19 (4):343 - 377.details
|
|
Minimal Rationality.Christopher Cherniak - 1986 - MIT Press. Edited by Christopher Cherniak.details
|
|
Gödel '96 Logical Foundations of Mathematics, Computer Science and Physics Kurt GÖdel's Legacy.Petr Hájek & Jiří Zlatuška - 1996 - Bulletin of Symbolic Logic 2 (4):473-473.details
|
|
X*—Mathematical Intuition.Charles Parsons - 1980 - Proceedings of the Aristotelian Society 80 (1):145-168.details
|
|
Informal Rigour and Completeness Proofs.Georg Kreisel - 1967 - In Imre Lakatos (ed.), Problems in the philosophy of mathematics. Amsterdam,: North-Holland Pub. Co.. pp. 138--157.details
|
|
Purity of Methods.Michael Detlefsen & Andrew Arana - 2011 - Philosophers' Imprint 11.details
|
|
Sur le platonisme dans les mathématiques.Paul Bernays - 1935 - L’Enseignement Mathematique 34:52--69.details
|
|
Minimal Rationality.Christopher Cherniak - 1988 - Behaviorism 16 (1):89-92.details
|
|
The Representational Foundations of Computation.Michael Rescorla - 2015 - Philosophia Mathematica 23 (3):338-366.details
|
|
Reducibility Among Combinatorial Problems.Richard M. Karp, Raymond E. Miller & James W. Thatcher - 1975 - Journal of Symbolic Logic 40 (4):618-619.details
|
|
The Intrinsic Computational Difficulty of Functions.Alan Cobham - 1965 - In Yehoshua Bar-Hillel (ed.), Logic, methodology and philosophy of science. Amsterdam,: North-Holland Pub. Co.. pp. 24-30.details
|
|
An Unsolvable Problem of Elementary Number Theory.Alonzo Church - 1936 - Journal of Symbolic Logic 1 (2):73-74.details
|
|
Grundlagen der Mathematik I.David Hilbert & Paul Bernays - 1968 - Springer.details
|
|
Strict Finitism, Feasibility, and the Sorites.Walter Dean - 2018 - Review of Symbolic Logic 11 (2):295-346.details
|
|
Representation and Reality.H. Putnam - 1988 - Tijdschrift Voor Filosofie 52 (1):168-168.details
|
|
Measurement and Computational Skepticism.Robert J. Matthews & Eli Dresner - 2017 - Noûs 51 (4):832-854.details
|
|
Non-deductive methods in mathematics.Alan Baker - 2010 - Stanford Encyclopedia of Philosophy.details
|
|