scientific article
From MaRDI portal
Publication:3720554
zbMath0592.01035MaRDI QIDQ3720554
Publication date: 1986
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Biographies, obituaries, personalia, bibliographies (01A70) Collected or selected works; reprintings or translations of classics (01A75) History of mathematical logic and foundations (03-03)
Related Items (33)
Gödel on deduction ⋮ Life on the Ship of Neurath: Mathematics in the Philosophy of Mathematics ⋮ The American Mathematical Society and Applied Mathematics from the 1920s to the 1950s: A Revisionist Account ⋮ Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 ⋮ Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency ⋮ On mind \& Turing's machines ⋮ THE GENEALOGY OF ‘’ ⋮ Lewis meets Brouwer: constructive strict implication ⋮ Conservative translations revisited ⋮ Choice-free topological duality for implicative lattices and Heyting algebras ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Complexity among the finitely generated subgroups of Thompson's group ⋮ Gödel’s Cantorianism ⋮ A semantic hierarchy for intuitionistic logic ⋮ Pluralism in Logic: The Square of Opposition, Leibniz’ Principle of Sufficient Reason and Markov’s Principle ⋮ Dugundji's theorem revisited ⋮ The scope of Gödel's first incompleteness theorem ⋮ Computational universes ⋮ ON ADOPTING KRIPKE SEMANTICS IN SET THEORY ⋮ A new method for undecidability proofs of first order theories ⋮ Putnam’s Theorem on the Complexity of Models ⋮ A Generalization of Maksimova’s Criterion for the Disjunction Property ⋮ Lattice NExtS4 from the Embedding Theorem Viewpoint ⋮ On causality as the fundamental concept of Gödel's philosophy ⋮ ON THE DIAGONAL LEMMA OF GÖDEL AND CARNAP ⋮ A CORRECT POLYNOMIAL TRANSLATION OF S4 INTO INTUITIONISTIC LOGIC ⋮ Acerca de la teoría de los números transfinitos de Cantor, de 1874 a 1940 ⋮ Bounded arithmetic, proof complexity and two papers of Parikh ⋮ ON THE INVARIANCE OF GÖDEL’S SECOND THEOREM WITH REGARD TO NUMBERINGS ⋮ On Boolean automata isolated cycles and tangential double-cycles dynamics ⋮ REDUCTION TECHNIQUES FOR PROVING DECIDABILITY IN LOGICS AND THEIR MEET–COMBINATION ⋮ New formally undecidable propositions: Non-trivial lower bounds on proof complexity and related theorems ⋮ Skolem redux
This page was built for publication:
