Some proofs of undecidability of arithmetic

DOI10.4064/FM-43-2-166-177zbMATH Open0072.00502OpenAlexW796849068MaRDI QIDQ3237141FDOQ3237141

Authors: Andrzej Grzegorczyk 

Publication date: 1956

Published in: Fundamenta Mathematicae (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/213409

Recommendations

• scientific article; zbMATH DE number 1160644
• Undecidability without arithmetization
• Undecidability, incompleteness and Arnol'd problems
• Undecidability in number theory
• Undecidability in number theory
• scientific article; zbMATH DE number 952488
• Undecidable extensions of Skolem arithmetic
• Questions of decidability and undecidability in Number Theory
• Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
• Degrees of insolubility of extensions of arithmetic by true propositions

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX)

Cited In (7)

• Title not available (Why is that?)
• Undecidable extensions of Büchi arithmetic and Cobham-Semënov Theorem
• On the concept of categoricity
• TARSKI’S FINITE BASIS PROBLEM IS UNDECIDABLE
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computer Science Logic

This page was built for publication: Some proofs of undecidability of arithmetic

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