Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
From MaRDI portal
Publication:4477873
Recommendations
- scientific article; zbMATH DE number 1184435
- Gödel incompleteness theorems and the limits of their applicability. I
- On formally undecidable propositions of \textit{Principia Mathematica} and related systems. I. With an introductory comment by Sy-David Friedman
- Truth and provability
- Kurt Gödel's intellectual development. [In memoriam Kurt Gödel (28 April 1906 -- 14 January 1978)].
Cited in
(only showing first 100 items - show all)- NOTIONAL LOGIC OF SYSTEMS
- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten.
- Heterologicality and imcompleteness
- Lösung eines markovschen Problems betreffs einer Ausdehnung des Begriffes der elementaren Funktion
- Measurement-based quantum computation and undecidable logic
- The complexity of identifying characteristic formulae
- Symbolic model checking of timed guarded commands using difference decision diagrams
- Uniform self-reference
- A story of Hilbert's tenth problem
- Unpredictability and entanglement in open quantum systems
- scientific article; zbMATH DE number 4004150 (Why is no real title available?)
- Mass problems associated with effectively closed sets
- Extensions of the Finitist Point of View
- Theories of orders on the set of words
- Semantics ofL(MT): a language for ecological modelling
- Mereology and uncertainty
- The Connes embedding problem: a guided tour
- Undecidable sentences generated by semantic paradoxes
- Some undecidable determined games
- A manifesto for the computational method
- Accelerating machines: a review
- Irrelevance and relevance of Gödel’s theorems to artificial intelligence
- The Philosophical Impact of the Löwenheim-Skolem Theorem
- Formalism and intuition in computability
- Ein Typenfreies System der Logik mit Ausreichender Mathematischer Anwendungsfähigkeit I
- scientific article; zbMATH DE number 1184435 (Why is no real title available?)
- Sequence encoding without induction
- Prädikatenlogik mit partiell definierten Funktionen
- Über den Begriff der \(\omega\)-Vollständigkeit
- Computationalism
- Life on the Ship of Neurath: Mathematics in the Philosophy of Mathematics
- Inductive learning and defeasible inference
- Book review of: J. von Plato, The great formal machinery works. Theories of deduction and computation at the origins of the digital age
- Representing the knowledge of Turing machines
- Truth, reflection and hierarchies
- How truthlike can a predicate be? A negative result
- The concept of truth in a finite universe
- On Constructive Nilpotent Groups
- Rejoinder
- Scanning the structure of ill‐known spaces: Part 1. Founding principles about mathematical constitution of space
- Relational quantum mechanics and intuitionistic mathematics
- A CALCULUS FOR SELF-REFERENCE
- On the justification of deduction and induction
- Undecidable classical properties of observers
- On formally undecidable propositions of \textit{Principia Mathematica} and related systems. I. With an introductory comment by Sy-David Friedman
- The metamathematics of ergodic theory
- REREADING TARSKI ON LOGICAL CONSEQUENCE
- Gödel incompleteness and the Black hole information paradox
- 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
- A classification of mathematical concepts
- Remarks on the development of computability
- Discussion on the foundation of mathematics
- Lorenzen Between Gentzen and Schütte
- Some diophantine forms of gödel's theorem
- scientific article; zbMATH DE number 130887 (Why is no real title available?)
- When is scalar multiplication decidable?
- AUTOLOGY OF TIME*
- Terminal model of Newtonian dynamics
- A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
- Things that can be made into themselves
- Intuitionist type theory and foundations
- Collimation processes in quantum mechanics interpreted in quantum real numbers
- Towards a scalable proof engine: a performant Prototype rewriting primitive for Coq
- Remarques sur la notion de la perfection
- Sur les formes normales
- Gödel's incompleteness theorems. On the occasion of Kurt Gödel's 100th anniversary on April 28, 2006
- Metamathematische Begriffe in Standardtheorien
- The origins of combinatorics on words
- Irreversibility in thermodynamics
- Undecidability and incompleteness in classical mechanics
- Symbolic languages and natural structures. A mathematician's account of empiricism
- Two (or three) notions of finitism
- Die Antinomien und die Unvollständigkeit der Mathematik
- Who's afraid of mathematical Platonism? -- An historical perspective
- Constructive chaos by cellular automata and possible sources of an arrow of time
- Etchemendy and Bolzano on logical consequence
- Curiosities of arithmetic gases
- The final cut
- A Review of Mathematical Knowledge Management
- Aspekte der frege–hilbert-korrespondenz
- Feferman and the Truth
- Postinstability models in dynamics
- Mathematical and technological computability
- Arbitrary sequence RAMs
- Axiom of Choice, Maximal Independent Sets, Argumentation and Dialogue Games
- SEMANTICS OF COMPLEX STRUCTURAL SYSTEMS—PRESENTATION AND REPRESENTATION: A SYNCHRONIC VISION OF LANGUAGEL(MT)
- A metasemantic challenge for mathematical determinacy
- scientific article; zbMATH DE number 2123258 (Why is no real title available?)
- Hilbert's Tenth Problem in Coq
- Hilbert’s Axiomatisches Denken
- Predicatively unprovable termination of the Ackermannian Goodstein process
- Uncertainty, predictability and decidability in chaotic dynamical systems
- Operating system verification---an overview
- Alethic reference
- REMARKS ON THEORIES OF COMPUTATION AND SEMANTICS OF PROGRAMMING LANGUAGES
- On proofs of the incompleteness theorems based on Berry's paradox by Vopěnka, Chaitin, and Boolos
- Quelques classes de problèmes extrémaux. II
- The boundedness and zero isolation problems for weighted automata over nonnegative rationals
- Turing: the great unknown
This page was built for publication: Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4477873)