Ü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)- Measurement of a quantum ensemble by a classical apparatus
- On the Performance of Axiom Systems
- On the Concept of Following Logically
- THE COLLAPSE OF THE HILBERT PROGRAM: A VARIATION ON THE GÖDELIAN THEME
- Chaotic neural nets, computability, and undecidability: Toward a computational dynamics
- Computability of entropy and information in classical Hamiltonian systems
- Definability, decidability, complexity
- The mathematical universe
- The lengths of proofs: Kreisel's conjecture and Gödel's speed-up theorem
- Key notions of Tarski's methodology of deductive systems
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten
- Time-asymmetric phenomena in biology
- Observations on computability, uncertainty, and technology
- Foundations of mathematics: an optimistic message
- GE and semantics
- Characteristic length in a linear acceleration
- What's in a function?
- Nonlinear phenomena in spaces of algorithms
- Unfolding finitist arithmetic
- Four studies in metamathematics
- MECHANISM, INTERROGATION AND INCOMPLETENESS
- Gödel's undecidability theorems and the search for a theory of everything
- Visions of Henkin
- Cut as consequence
- Die Antinomien und die Unvollständigkeit der Mathematik.
- A new-old characterisation of logical knowledge
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS
- Physics of selective systems: Computation and biology
- The diagnostic process as a statistical-causal analysis
- Tarski on logical consequences
- Turing‐computability and artificial intelligence: Gödel’s incompleteness results
- Uncomputability and physical law
- 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
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)
