Provability and Decidability of Arithmetical Universal-Existential Sentences
From MaRDI portal
Publication:3720563
DOI10.1112/blms/18.3.241zbMath0592.03007OpenAlexW2009903622MaRDI QIDQ3720563
No author found.
Publication date: 1986
Published in: Bulletin of the London Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1112/blms/18.3.241
Related Items
Algorithms for sentences over integral domains ⋮ Computational complexity of sentences over fields ⋮ Polynomial time algorithms for sentences over number fields ⋮ Decidable fragments of field theories ⋮ Decidable Sentences Over Polynomial Rings