The following pages link to (Q3720554):
Displayed 15 items.
- New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems (Q804570) (← links)
- Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 (Q873911) (← links)
- On mind \& Turing's machines (Q885688) (← links)
- A new method for undecidability proofs of first order theories (Q1209623) (← links)
- Bounded arithmetic, proof complexity and two papers of Parikh (Q1295443) (← links)
- Lewis meets Brouwer: constructive strict implication (Q1688950) (← links)
- Skolem redux (Q1860974) (← links)
- Dugundji's theorem revisited (Q2254571) (← links)
- The scope of Gödel's first incompleteness theorem (Q2254575) (← links)
- Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency (Q2409191) (← links)
- Computational universes (Q2483574) (← links)
- Life on the Ship of Neurath: Mathematics in the Philosophy of Mathematics (Q2908777) (← links)
- ON ADOPTING KRIPKE SEMANTICS IN SET THEORY (Q3580661) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- Pluralism in Logic: The Square of Opposition, Leibniz’ Principle of Sufficient Reason and Markov’s Principle (Q4915583) (← links)