Some strongly undecidable natural arithmetical problems, with an application to intuitionistic theories

DOI10.2178/JSL/1045861513zbMATH Open1054.03010OpenAlexW2138038189MaRDI QIDQ4457733FDOQ4457733

Raatikainen, Panu

Publication date: 25 March 2004

Published in: Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2178/jsl/1045861513

zbMATH Keywords

Diophantine equationintuitionistic logicsalgorithmic problem

Mathematics Subject Classification ID

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)

Cites Work

• Title not available (Why is that?)
• The decision problem for exponential diophantine equations
• On degrees of unsolvability
• Title not available (Why is that?)
• Hilbert's Tenth Problem is Unsolvable
• The computational complexity of torsion-freeness of finitely presented groups

Cited In (3)

• Decidability and Specker sequences in intuitionistic mathematics
• A Uniformly, Extremely Nonextensional Formula of Arithmetic with many Undecidable Fixed Points in many Theories
• Title not available (Why is that?)

   Recommendations

• Questions of decidability and undecidability in Number Theory 👍 👎
• Title not available (Why is that?) 👍 👎
• 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 👍 👎

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)