Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I
From MaRDI portal
(Redirected from 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)- The metamathematics of ergodic theory
- Gödel incompleteness and the Black hole information paradox
- Operating system verification---an overview
- How truthlike can a predicate be? A negative result
- Uniform self-reference
- A classification of mathematical concepts
- Intuitionist type theory and foundations
- Physics of selective systems: Computation and biology
- Some undecidable determined games
- Undecidability and incompleteness in classical mechanics
- Terminal model of Newtonian dynamics
- Four studies in metamathematics
- The diagnostic process as a statistical-causal analysis
- What's in a function?
- Representing the knowledge of Turing machines
- Postinstability models in dynamics
- Uncertainty, predictability and decidability in chaotic dynamical systems
- Computationalism
- A manifesto for the computational method
- Book review of: J. von Plato, The great formal machinery works. Theories of deduction and computation at the origins of the digital age
- Definability, decidability, complexity
- Key notions of Tarski's methodology of deductive systems
- Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten
- Symbolic model checking of timed guarded commands using difference decision diagrams
- Irreversibility in thermodynamics
- Tarski on logical consequences
- The complexity of identifying characteristic formulae
- On the justification of deduction and induction
- A metasemantic challenge for mathematical determinacy
- Turing: the great unknown
- Things that can be made into themselves
- When is scalar multiplication decidable?
- Truth, reflection and hierarchies
- The mathematical universe
- Symbolic languages and natural structures. A mathematician's account of empiricism
- Measurement of a quantum ensemble by a classical apparatus
- Die Antinomien und die Unvollständigkeit der Mathematik.
- Über die Erfüllbarkeit derjenigen Zählausdrücke, welche in der Normalform zwei benachbarte Allzeichen enthalten.
- Über den Begriff der -Vollständigkeit
- Remarques sur la notion de la perfection
- Sur les formes normales
- The final cut
- SEMANTICS OF COMPLEX STRUCTURAL SYSTEMS—PRESENTATION AND REPRESENTATION: A SYNCHRONIC VISION OF LANGUAGEL(MT)
- Heterologicality and imcompleteness
- Sequence encoding without induction
- 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
- Formalism and intuition in computability
- On Constructive Nilpotent Groups
- Mereology and uncertainty
- Cut as consequence
- HIERARCHIES OF GENERALIZED KOLMOGOROV COMPLEXITIES AND NONENUMERABLE UNIVERSAL MEASURES COMPUTABLE IN THE LIMIT
- Unfolding finitist arithmetic
- Ein Typenfreies System der Logik mit Ausreichender Mathematischer Anwendungsfähigkeit I
- A story of Hilbert's tenth problem
- Remarks on the development of computability
- Discussion on the foundation of mathematics
- Curiosities of arithmetic gases
- Theories of orders on the set of words
- REREADING TARSKI ON LOGICAL CONSEQUENCE
- Two (or three) notions of finitism
- Etchemendy and Bolzano on logical consequence
- A Review of Mathematical Knowledge Management
- AUTOLOGY OF TIME*
- scientific article; zbMATH DE number 4004150 (Why is no real title available?)
- scientific article; zbMATH DE number 1184435 (Why is no real title available?)
- Some diophantine forms of gödel's theorem
- scientific article; zbMATH DE number 130887 (Why is no real title available?)
- A CALCULUS FOR SELF-REFERENCE
- REMARKS ON THEORIES OF COMPUTATION AND SEMANTICS OF PROGRAMMING LANGUAGES
- Irrelevance and relevance of Gödel’s theorems to artificial intelligence
- Turing‐computability and artificial intelligence: Gödel’s incompleteness results
- A Combinatorial Approach to Complexity Theory via Ordinal Hierarchies
- Computability of String Functions Over Algebraic Structures Armin Hemmerling
- Time-asymmetric phenomena in biology
- Aspekte der frege–hilbert-korrespondenz
- Scanning the structure of ill‐known spaces: Part 1. Founding principles about mathematical constitution of space
- Nonlinear phenomena in spaces of algorithms
- Extensions of the Finitist Point of View
- On the Concept of Following Logically
- Die Antinomien und die Unvollständigkeit der Mathematik
- Arbitrary sequence RAMs
- NOTIONAL LOGIC OF SYSTEMS
- Semantics ofL(MT): a language for ecological modelling
- scientific article; zbMATH DE number 2123258 (Why is no real title available?)
- Inductive learning and defeasible inference
- Chaotic neural nets, computability, and undecidability: Toward a computational dynamics
- Mathematical and technological computability
- Observations on computability, uncertainty, and technology
- Foundations of mathematics: an optimistic message
- Lorenzen Between Gentzen and Schütte
- THE COLLAPSE OF THE HILBERT PROGRAM: A VARIATION ON THE GÖDELIAN THEME
- On the Performance of Axiom Systems
- Hilbert’s Axiomatisches Denken
- Hilbert's Tenth Problem in Coq
- Predicatively unprovable termination of the Ackermannian Goodstein process
- INCOMPLETENESS VIA PARADOX AND COMPLETENESS
- Visions of Henkin
- Feferman and the Truth
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)
