scientific article

zbMath0698.01023MaRDI QIDQ3997237

No author found.

Publication date: 17 September 1992

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

logic and foundations of mathematics

Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Collected or selected works; reprintings or translations of classics (01A75) History of mathematical logic and foundations (03-03)

Related Items (35)

RUSSELL AND GÖDEL ⋮ V = Land Intuitive Plausibility in set Theory. A Case Study ⋮ Unnamed Item ⋮ Book review of: R. Kahle (ed.) and M. Rathjen (ed.), Gentzen's centenary. The quest for consistency ⋮ On mind \& Turing's machines ⋮ Termination of rewrite relations on \(\lambda\)-terms based on Girard's notion of reducibility ⋮ von Neumann standard quantum mechanics is logically inconsistent ⋮ Foundational implications of the inner model hypothesis ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Why Turing’s Thesis Is Not a Thesis ⋮ Multiverse Conceptions in Set Theory ⋮ Gödel’s Cantorianism ⋮ Objectivity and Truth in Mathematics: A Sober Non-platonist Perspective ⋮ Computational Interpretations of Classical Reasoning: From the Epsilon Calculus to Stateful Programs ⋮ On reflection principles ⋮ On the concept of finitism ⋮ Multiverse conceptions in set theory ⋮ AXIOMS FOR DETERMINATENESS AND TRUTH ⋮ Russell, presupposition, and the vicious-circle principle ⋮ Levy and set theory ⋮ Martin's maximum\(^{++}\) implies Woodin's axiom \((*)\) ⋮ Information transmittal and time uncertainty, measuring the speed of light and time of reflection, representations of Newton's second law and related problems ⋮ Injecting uniformities into Peano arithmetic ⋮ The graph conception of set ⋮ On the Computability of the Fan Functional ⋮ Unfolding Schematic Systems ⋮ Acerca de la teoría de los números transfinitos de Cantor, de 1874 a 1940 ⋮ Intuitionism: an inspiration? ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ On the removal of weak compactness arguments in proof mining ⋮ Functional interpretation of Aczel's constructive set theory ⋮ Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\) ⋮ Full intuitionistic linear logic ⋮ Links between physics and set theory. ⋮ THE PREHISTORY OF THE SUBSYSTEMS OF SECOND-ORDER ARITHMETIC

This page was built for publication: