The following pages link to (Q3720554):
Displaying 36 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)
- A semantic hierarchy for intuitionistic logic (Q1740610) (← links)
- Skolem redux (Q1860974) (← links)
- On causality as the fundamental concept of Gödel's philosophy (Q2054157) (← links)
- On Boolean automata isolated cycles and tangential double-cycles dynamics (Q2086725) (← links)
- Complexity among the finitely generated subgroups of Thompson's group (Q2233682) (← 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)
- Gödel on deduction (Q2631643) (← links)
- Life on the Ship of Neurath: Mathematics in the Philosophy of Mathematics (Q2908777) (← links)
- Gödel’s Cantorianism (Q3305413) (← links)
- ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP (Q3386609) (← links)
- Acerca de la teoría de los números transfinitos de Cantor, de 1874 a 1940 (Q3389718) (← links)
- ON ADOPTING KRIPKE SEMANTICS IN SET THEORY (Q3580661) (← links)
- Why Turing’s Thesis Is Not a Thesis (Q4637226) (← links)
- (Q4787958) (← links)
- Pluralism in Logic: The Square of Opposition, Leibniz’ Principle of Sufficient Reason and Markov’s Principle (Q4915583) (← links)
- ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS (Q5001552) (← links)
- REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION (Q5009679) (← links)
- The American Mathematical Society and Applied Mathematics from the 1920s to the 1950s: A Revisionist Account (Q5081548) (← links)
- Putnam’s Theorem on the Complexity of Models (Q5214674) (← links)
- A Generalization of Maksimova’s Criterion for the Disjunction Property (Q5214734) (← links)
- Lattice NExtS4 from the Embedding Theorem Viewpoint (Q5214738) (← links)
- A CORRECT POLYNOMIAL TRANSLATION OF S4 INTO INTUITIONISTIC LOGIC (Q5222518) (← links)
- THE GENEALOGY OF ‘’ (Q6051426) (← links)
- Conservative translations revisited (Q6156208) (← links)
- Choice-free topological duality for implicative lattices and Heyting algebras (Q6183434) (← links)
- Gödel's undecidability theorems and the search for a theory of everything (Q6538457) (← links)
- Kurt Gödel and the logic of concepts (Q6585148) (← links)
