- On the meaning of Hilbert's consistency problem (paris, 1900).Enrico Moriconi - 2003 - Synthese 137 (1-2):129 - 139.details
|
|
Proof Theory of Finite-valued Logics.Richard Zach - 1993 - Dissertation, Technische Universität Wiendetails
|
|
XV—On Consistency and Existence in Mathematics.Walter Dean - 2021 - Proceedings of the Aristotelian Society 120 (3):349-393.details
|
|
On the non-confluence of cut-elimination.Matthias Baaz & Stefan Hetzl - 2011 - Journal of Symbolic Logic 76 (1):313 - 340.details
|
|
Proof theory in philosophy of mathematics.Andrew Arana - 2010 - Philosophy Compass 5 (4):336-347.details
|
|
The Constructive Hilbert Program and the Limits of Martin-Löf Type Theory.Michael Rathjen - 2005 - Synthese 147 (1):81-120.details
|
|
Consistency, Models, and Soundness.Matthias Schirn - 2010 - Axiomathes 20 (2):153-207.details
|
|
Where is the Gödel-Point Hiding: Gentzen’s Consistency Proof of 1936 and His Representation of Constructive Ordinals.Anna Horská - 2013 - Cham, Switzerland: Springer.details
|
|
Cut Elimination in ε‐Calculi.Mitsuru Yasuhara - 1982 - Mathematical Logic Quarterly 28 (20‐21):311-316.details
|
|
Cut Elimination in ε‐Calculi.Mitsuru Yasuhara - 1982 - Mathematical Logic Quarterly 28 (20-21):311-316.details
|
|
A Dynamic Analysis of Minimizers in Chinese lian…dou Construction.Xiaolong Yang & Yicheng Wu - 2021 - Journal of Logic, Language and Information 30 (2):429-449.details
|
|
The substitution method.W. W. Tait - 1965 - Journal of Symbolic Logic 30 (2):175-192.details
|
|
The early history of formal diagonalization.C. Smoryński - 2023 - Logic Journal of the IGPL 31 (6):1203-1224.details
|
|
Recursively saturated nonstandard models of arithmetic.C. Smoryński - 1981 - Journal of Symbolic Logic 46 (2):259-286.details
|
|
Step by recursive step: Church's analysis of effective calculability.Wilfried Sieg - 1997 - Bulletin of Symbolic Logic 3 (2):154-180.details
|
|
Gödel’s Philosophical Challenge.Wilfried Sieg - 2020 - Studia Semiotyczne 34 (1):57-80.details
|
|
Herbrand analyses.Wilfried Sieg - 1991 - Archive for Mathematical Logic 30 (5-6):409-441.details
|
|
Fragments of arithmetic.Wilfried Sieg - 1985 - Annals of Pure and Applied Logic 28 (1):33-71.details
|
|
The finitary standpoint.Bertil Rolf - 1980 - Erkenntnis 15 (3):287 - 300.details
|
|
Theories and Ordinals in Proof Theory.Michael Rathjen - 2006 - Synthese 148 (3):719-743.details
|
|
Arbitrary reference, numbers, and propositions.Michele Palmira - 2018 - European Journal of Philosophy 26 (3):1069-1085.details
|
|
Effective Computation by Humans and Machines.Shagrir Oron - 2002 - Minds and Machines 12 (2):221-240.details
|
|
Hilbert's programme and gödel's theorems.Karl-Georg Niebergall & Matthias Schirn - 2002 - Dialectica 56 (4):347–370.details
|
|
Paper machines.Daniele Mundici & Wilfried Seig - 1995 - Philosophia Mathematica 3 (1):5-30.details
|
|
Positive logic and λ-constants.David Meredith - 1978 - Studia Logica 37 (3):269 - 285.details
|
|
Extensions of the Finitist Point of View.Matthias Schirn & Karl-Georg Niebergall - 2001 - History and Philosophy of Logic 22 (3):135-161.details
|
|
Husserl's Logical Grammar.Ansten Klev - 2018 - History and Philosophy of Logic 39 (3):232-269.details
|
|
Bernays and set theory.Akihiro Kanamori - 2009 - Bulletin of Symbolic Logic 15 (1):43-69.details
|
|
On the form of witness terms.Stefan Hetzl - 2010 - Archive for Mathematical Logic 49 (5):529-554.details
|
|
A Simplified Proof of the Epsilon Theorems.Stefan Hetzl - forthcoming - Review of Symbolic Logic:1-16.details
|
|
An Extension of the Notion of Relativization to Hilbert's ϵ‐Symbol.Masazumi Hanazawa - 1980 - Mathematical Logic Quarterly 26 (31):491-496.details
|
|
An Extension of the Notion of Relativization to Hilbert's ε-Symbol.Masazumi Hanazawa - 1980 - Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 26 (31):491-496.details
|
|
Self-reference in arithmetic I.Volker Halbach & Albert Visser - 2014 - Review of Symbolic Logic 7 (4):671-691.details
|
|
Quantification in the Interpretational Theory of Validity.Marco Grossi - 2023 - Synthese 202 (3):1-21.details
|
|
Incomplete Symbols — Definite Descriptions Revisited.Norbert Gratzl - 2015 - Journal of Philosophical Logic 44 (5):489-506.details
|
|
Ordinals with Partition Properties and the Constructible Hierarchy.Klaus Gloede - 1972 - Mathematical Logic Quarterly 18 (8-11):135-164.details
|
|
The Calculus of Natural Calculation.René Gazzari - 2021 - Studia Logica 109 (6):1375-1411.details
|
|
Two (or three) notions of finitism.Mihai Ganea - 2010 - Review of Symbolic Logic 3 (1):119-144.details
|
|
Working foundations.Solomon Feferman - 1985 - Synthese 62 (2):229 - 254.details
|
|
What does Gödel's second theorem say?Michael Detlefsen - 2001 - Philosophia Mathematica 9 (1):37-71.details
|
|
Takeuti's Well-Ordering Proof: Finitistically Fine?Eamon Darnell & Aaron Thomas-Bolduc - 2018 - In Maria Zack & Dirk Schlimm (eds.), Research in History and Philosophy of Mathematics The CSHPM 2017 Annual Meeting in Toronto, Ontario. Birkhäuser Basel.details
|
|