- Slow consistency.Sy-David Friedman, Michael Rathjen & Andreas Weiermann - 2013 - Annals of Pure and Applied Logic 164 (3):382-393.details
|
|
Cambridge and Vienna: Frank P. Ramsey and the Vienna Circle.Maria Carla Galavotti (ed.) - 2004 - Dordrecht: Springer Verlag.details
|
|
Paris-Harrington principles, reflection principles and transfinite induction up to epsilon 0.Reijiro Kurata - 1986 - Annals of Pure and Applied Logic 31:237.details
|
|
Some combinatorial principles equivalent to restrictions of transfinite induction up to "GAMMA"0.R. Kurata - 1989 - Annals of Pure and Applied Logic 44 (1/2):63.details
|
|
Countable algebra and set existence axioms.Harvey M. Friedman - 1983 - Annals of Pure and Applied Logic 25 (2):141.details
|
|
Mathematical proof theory in the light of ordinal analysis.Reinhard Kahle - 2002 - Synthese 133 (1/2):237 - 255.details
|
|
Unification of mathematical theories.Krzysztof Wójtowicz - 1998 - Foundations of Science 3 (2):207-229.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
|
|
Hilbert's program then and now.Richard Zach - 2002 - In Dale Jacquette (ed.), Philosophy of Logic. Malden, Mass.: North Holland. pp. 411–447.details
|
|
The Source of Chaitin's Incorrectness.Don Fallis - 1996 - Philosophia Mathematica 4 (3):261-269.details
|
|
Number theory and elementary arithmetic.Jeremy Avigad - 2003 - Philosophia Mathematica 11 (3):257-284.details
|
|
Solutions to the Knower Paradox in the Light of Haack’s Criteria.Mirjam de Vos, Rineke Verbrugge & Barteld Kooi - 2023 - Journal of Philosophical Logic 52 (4):1101-1132.details
|
|
Three Roles of Empirical Information in Philosophy: Intuitions on Mathematics do Not Come for Free.Deniz Sarikaya, José Antonio Pérez-Escobar & Deborah Kant - 2021 - Kriterion – Journal of Philosophy 35 (3):247-278.details
|
|
Rigour and Thought Experiments: Burgess and Norton.James Robert Brown - 2022 - Axiomathes 32 (1):7-28.details
|
|
Polynomial time ultrapowers and the consistency of circuit lower bounds.Jan Bydžovský & Moritz Müller - 2020 - Archive for Mathematical Logic 59 (1-2):127-147.details
|
|
(1 other version)The Wonder of Colors and the Principle of Ariadne.Walter Carnielli & Carlos di Prisco - 2017 - In Walter Carnielli & Carlos di Prisco (eds.), The Wonder of Colors and the Principle of Ariadne. Cham: Springer. pp. 309-317.details
|
|
Conditions of Rationality for Scientific Research.Paul Weingartner - 2019 - Kriterion - Journal of Philosophy 33 (2):67-118.details
|
|
A Metasemantic Challenge for Mathematical Determinacy.Jared Warren & Daniel Waxman - 2020 - Synthese 197 (2):477-495.details
|
|
Recursive Functions and Metamathematics: Problems of Completeness and Decidability, Gödel's Theorems.Rod J. L. Adams & Roman Murawski - 1999 - Dordrecht, Netherland: Springer Verlag.details
|
|
On me number of steps in proofs.Jan Krajíèek - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.details
|
|
On Gödel incompleteness and finite combinatorics.Akihiro Kanamori & Kenneth McAloon - 1987 - Annals of Pure and Applied Logic 33 (C):23-41.details
|
|
Maximality in modal logic.R. C. Flagg & H. Friedman - 1987 - Annals of Pure and Applied Logic 34 (2):99-118.details
|
|
(1 other version)A sharpened version of McAloon's theorem on initial segments of models of IΔ0.Paola D'Aquino - 1993 - Annals of Pure and Applied Logic 61 (1-2):49-62.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
|
|
On the Necessity of U-Shaped Learning.Lorenzo Carlucci & John Case - 2013 - Topics in Cognitive Science 5 (1):56-88.details
|
|
(1 other version)Gödel, Escher, Bach. [REVIEW]V. Huber-Dyson - 1981 - Canadian Journal of Philosophy 11 (4):775-792.details
|
|
Understanding, formal verification, and the philosophy of mathematics.Jeremy Avigad - 2010 - Journal of the Indian Council of Philosophical Research 27:161-197.details
|
|
Too naturalist and not naturalist enough: Reply to Horsten.Luca Incurvati - 2008 - Erkenntnis 69 (2):261 - 274.details
|
|
Algorithmic information theory and undecidability.Panu Raatikainen - 2000 - Synthese 123 (2):217-225.details
|
|
Mathematics, the empirical facts, and logical necessity.John C. Harsanyi - 1983 - Erkenntnis 19 (1-3):167 - 192.details
|
|
Working foundations.Solomon Feferman - 1985 - Synthese 62 (2):229 - 254.details
|
|
Gödel's path from the incompleteness theorems (1931) to phenomenology (1961).Richard Tieszen - 1998 - Bulletin of Symbolic Logic 4 (2):181-203.details
|
|
A model-theoretic approach to ordinal analysis.Jeremy Avigad & Richard Sommer - 1997 - Bulletin of Symbolic Logic 3 (1):17-52.details
|
|
Mathematical Incompleteness Results in First-Order Peano Arithmetic: A Revisionist View of the Early History.Saul A. Kripke - 2021 - History and Philosophy of Logic 43 (2):175-182.details
|
|
The Notion of Explanation in Gödel’s Philosophy of Mathematics.Krzysztof Wójtowicz - 2019 - Studia Semiotyczne—English Supplement 30:85-106.details
|
|
Frank Ramsey.Fraser MacBride, Mathieu Marion, Maria Jose Frapolli, Dorothy Edgington, Edward J. R. Elliott, Sebastian Lutz & Jeffrey Paris - 2019 - Stanford Encyclopedia of Philosophy.details
|
|
Informal versus formal mathematics.Francisco Antonio Doria - 2007 - Synthese 154 (3):401-415.details
|
|
Regressive partition relations, n-subtle cardinals, and Borel diagonalization.Akihiro Kanamori - 1991 - Annals of Pure and Applied Logic 52 (1-2):65-77.details
|
|
O nadużywaniu twierdzenia Gödla w sporach filozoficznych.Krzysztof Wójtowicz - 1996 - Zagadnienia Filozoficzne W Nauce 19.details
|
|
Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.details
|
|
(1 other version)Partition theorems and computability theory.Joseph R. Mileti - 2005 - Bulletin of Symbolic Logic 11 (3):411-427.details
|
|
The Deluge of Spurious Correlations in Big Data.Cristian S. Calude & Giuseppe Longo - 2016 - Foundations of Science 22 (3):595-612.details
|
|
Phase transitions of iterated Higman-style well-partial-orderings.Lev Gordeev & Andreas Weiermann - 2012 - Archive for Mathematical Logic 51 (1-2):127-161.details
|
|
Mathematical intuition and the cognitive roots of mathematical concepts.Giuseppe Longo & Arnaud Viarouge - 2010 - Topoi 29 (1):15-27.details
|
|
Presentation to the panel, “does mathematics need new axioms?” Asl 2000 meeting, urbana il, June 5, 2000.Solomon Feferman - unknowndetails
|
|
Saturation and simple extensions of models of peano arithmetic.Matt Kaufmann & James H. Schmerl - 1984 - Annals of Pure and Applied Logic 27 (2):109-136.details
|
|
PROOF THEORY. Gödel and the metamathematical tradition.Jeremy Avigad - 2010 - In Kurt Gödel, Solomon Feferman, Charles Parsons & Stephen G. Simpson (eds.), Kurt Gödel: essays for his centennial. Ithaca, NY: Association for Symbolic Logic.details
|
|
(2 other versions)Wittgenstein & Paraconsistência.João Marcos - 2010 - Principia: An International Journal of Epistemology 14 (1):135-73.details
|
|
Kategoria wyjaśniania a filozofia matematyki Gödla.Krzysztof Wójtowicz - 2018 - Studia Semiotyczne 32 (2):107-129.details
|
|
On the number of steps in proofs.Jan Kraj\mIček - 1989 - Annals of Pure and Applied Logic 41 (2):153-178.details
|
|