Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories
From MaRDI portal
Publication:4457733
Subsystems of classical logic (including intuitionistic logic) (03B20) Decidability of theories and sets of sentences (03B25) Foundations of classical theories (including reverse mathematics) (03B30) Undecidability and degrees of sets of sentences (03D35) Intuitionistic mathematics (03F55) Decidability (number-theoretic aspects) (11U05)
Recommendations
- Questions of decidability and undecidability in Number Theory
- scientific article; zbMATH DE number 1261118
- Undecidability and intuitionistic incompleteness
- Undecidable and decidable restrictions of Hilbert's Tenth Problem: images of polynomials vs. images of exponential functions
- Undecidability in number theory
Cites work
- scientific article; zbMATH DE number 1233702 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Hilbert's Tenth Problem is Unsolvable
- On degrees of unsolvability
- The computational complexity of torsion-freeness of finitely presented groups
- The decision problem for exponential diophantine equations
Cited in
(3)
This page was built for publication: Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4457733)