scientific article; zbMATH DE number 2123258

zbMATH Open1099.03002MaRDI QIDQ4830809FDOQ4830809

Authors:

Publication date: 16 December 2004

Title of this publication is not available (Why is that?)

Recommendations

• Undecidability, incompleteness and Arnol'd problems
• The undecidability of \(k\)-provability
• scientific article; zbMATH DE number 1560883
• Remarks on undecidability, incompleteness and the integrability problem
• Undecidability in Some Structures Related to Computation Theory
• Limits of computation. An introduction to the undecidable and the intractable
• scientific article; zbMATH DE number 1984520
• scientific article; zbMATH DE number 572102
• Undecidability and intuitionistic incompleteness
• Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to mathematical logic and foundations (03-06) History of mathematical logic and foundations (03-03) Recursive functions and relations, subrecursive hierarchies (03D20) Turing machines and related notions (03D10) Undecidability and degrees of sets of sentences (03D35)

Cited In (39)

• Why post did [not] have Turing's thesis
• Book review of: E. G. Omodeo (ed.) and A. Policriti (ed.), Martin Davis on computability, computational logic, and mathematical foundations
• The diagonalization method in quantum recursion theory
• Introduction to Type Theory
• Gödel on deduction
• A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY
• Closing the Circle: An Analysis of Emil Post's Early Work
• Book review of: J. von Plato, The great formal machinery works. Theories of deduction and computation at the origins of the digital age
• Martingales in the Study of Randomness
• Quantum value indefiniteness
• Did Turing stand on Gödel's shoulders?
• Theoretical computer science: computability, decidability and logic
• Incompleteness theorems for random reals
• Computer supported mathematics with \(\Omega\)MEGA
• The philosophy of logic of John Corcoran
• On arithmetical first-order theories allowing encoding and decoding of lists
• Informal and absolute proofs: some remarks from a Gödelian perspective
• Distilling the requirements of Gödel's incompleteness theorems with a proof assistant
• The scope of Gödel's first incompleteness theorem
• A formally verified abstract account of Gödel's incompleteness theorems
• On the complex behavior of simple tag systems -- an experimental approach
• Who's afraid of mathematical Platonism? -- An historical perspective
• A public key cryptoscheme using bit-pairs with provable semantical security
• The theory of recursive functions, approaching its centennial
• Jean van Heijenoort and the Gödel editorial project
• From Gödel's incompleteness theorem to the completeness of bot beliefs (extended abstract)
• A Logical Autobiography
• Turing oracle machines, online computing, and three displacements in computability theory
• What is a universal computing machine?
• Title not available (Why is that?)
• A semantically secure public key cryptoscheme using bit-pair shadows
• A provably secure non-iterative hash function resisting birthday attack
• A public key cryptosystem based on three new provable problems
• Operating system verification---an overview
• Testing randomness by Matching Pennies
• History and basic features of the critical-pair/completion procedure
• Asymptotic granularity reduction and its application
• Tag systems and Collatz-like functions
• Why Turing’s Thesis Is Not a Thesis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4830809)