Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
From MaRDI portal
Publication:4477873
DOI10.1007/BF01700692zbMath0002.00101WikidataQ54006652 ScholiaQ54006652MaRDI QIDQ4477873
No author found.
Publication date: 1931
Published in: Monatshefte für Mathematik und Physik (Search for Journal in Brave)
Related Items (only showing first 100 items - show all)
NOTIONAL LOGIC OF SYSTEMS ⋮ Semantics ofL(MT): a language for ecological modelling ⋮ Representing the knowledge of Turing machines ⋮ Sequence encoding without induction ⋮ Book review of: J. von Plato, The great formal machinery works. Theories of deduction and computation at the origins of the digital age ⋮ Die Antinomien und die Unvollständigkeit der Mathematik. ⋮ Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten. ⋮ Uniform self-reference ⋮ Postinstability models in dynamics ⋮ Uncertainty, predictability and decidability in chaotic dynamical systems ⋮ The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem ⋮ Life on the Ship of Neurath: Mathematics in the Philosophy of Mathematics ⋮ The Philosophical Impact of the Löwenheim-Skolem Theorem ⋮ On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos ⋮ Turing: the great unknown ⋮ Truth, reflection and hierarchies ⋮ Undecidable classical properties of observers ⋮ Über den Begriff der \(\omega\)-Vollständigkeit ⋮ Remarques sur la notion de la perfection ⋮ Sur les formes normales ⋮ Irreversibility in thermodynamics ⋮ The origins of combinatorics on words ⋮ Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006 ⋮ A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies ⋮ Formalism and intuition in computability ⋮ Characteristic length in a linear acceleration ⋮ Tarski on logical consequences ⋮ A classification of mathematical concepts ⋮ Inductive learning and defeasible inference ⋮ Chaotic neural nets, computability, and undecidability: Toward a computational dynamics ⋮ The final cut ⋮ Intuitionist type theory and foundations ⋮ Ein Typenfreies System der Logik mit Ausreichender Mathematischer Anwendungsfähigkeit I ⋮ On Constructive Nilpotent Groups ⋮ Physics of selective systems: Computation and biology ⋮ Collimation processes in quantum mechanics interpreted in quantum real numbers ⋮ Computability of entropy and information in classical Hamiltonian systems ⋮ Mereology and uncertainty ⋮ Some undecidable determined games ⋮ Measurement-based quantum computation and undecidable logic ⋮ Undecidability and incompleteness in classical mechanics ⋮ Arbitrary sequence RAMs ⋮ Heterologicality and Incompleteness ⋮ TWO (OR THREE) NOTIONS OF FINITISM ⋮ A Story of Hilbert’s Tenth Problem ⋮ A CALCULUS FOR SELF-REFERENCE ⋮ Remarks on the development of computability ⋮ The complexity of identifying characteristic formulae ⋮ Visions of Henkin ⋮ Computability of String Functions Over Algebraic Structures Armin Hemmerling ⋮ SEMANTICS OF COMPLEX STRUCTURAL SYSTEMS—PRESENTATION AND REPRESENTATION: A SYNCHRONIC VISION OF LANGUAGEL(MT) ⋮ On the justification of deduction and induction ⋮ Discussion on the foundation of mathematics ⋮ Cut as Consequence ⋮ HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT ⋮ Things that can be made into themselves ⋮ The mathematical universe ⋮ Time-asymmetric phenomena in biology ⋮ Aspekte der frege–hilbert-korrespondenz ⋮ Terminal model of Newtonian dynamics ⋮ Symbolic languages and natural structures. A mathematician's account of empiricism ⋮ Etchemendy and Bolzano on Logical Consequence ⋮ Four studies in metamathematics ⋮ Application of quantum Darwinism to cosmic inflation: an example of the limits imposed in Aristotelian logic by information-based approach to Gödel's incompleteness ⋮ The diagnostic process as a statistical-causal analysis ⋮ Curiosities of arithmetic gases ⋮ UNFOLDING FINITIST ARITHMETIC ⋮ REMARKS ON THEORIES OF COMPUTATION AND SEMANTICS OF PROGRAMMING LANGUAGES ⋮ The metamathematics of ergodic theory ⋮ Gödel incompleteness and the Black hole information paradox ⋮ Theories of orders on the set of words ⋮ Measurement of a quantum ensemble by a classical apparatus ⋮ Extensions of the Finitist Point of View ⋮ On the Concept of Following Logically ⋮ A metasemantic challenge for mathematical determinacy ⋮ Mathematical and Technological Computability ⋮ Constructive chaos by cellular automata and possible sources of an arrow of time ⋮ A Review of Mathematical Knowledge Management ⋮ Definability, decidability, complexity ⋮ When is scalar multiplication decidable? ⋮ REREADING TARSKI ON LOGICAL CONSEQUENCE ⋮ Key notions of Tarski's methodology of deductive systems ⋮ Unnamed Item ⋮ Scanning the structure of ill‐known spaces: Part 1. Founding principles about mathematical constitution of space ⋮ Nonlinear phenomena in spaces of algorithms ⋮ Mass problems associated with effectively closed sets ⋮ Operating system verification---an overview ⋮ Alethic reference ⋮ What's in a function? ⋮ Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten ⋮ Computationalism ⋮ Observations on Computability, Uncertainty, and Technology ⋮ Die Antinomien und die Unvollständigkeit der Mathematik ⋮ AUTOLOGY OF TIME* ⋮ Symbolic model checking of timed guarded commands using difference decision diagrams ⋮ A manifesto for the computational method ⋮ How truthlike can a predicate be? A negative result ⋮ Some diophantine forms of gödel's theorem ⋮ Irrelevance and relevance of Gödel’s theorems to artificial intelligence ⋮ Turing‐computability and artificial intelligence: Gödel’s incompleteness results
This page was built for publication: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
