Solvability of the theory of integers with addition, order, and multiplication by an arbitrary number
From MaRDI portal
Publication:2264657
DOI10.1007/BF01147467zbMath0274.02019MaRDI QIDQ2264657
Publication date: 1973
Published in: Mathematical Notes (Search for Journal in Brave)
Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80)
Related Items
$\mathbb \{Q\}$ muni de l’arithmétique faible de Penzin est décidable ⋮ A list of arithmetical structures complete with respect to the first-order definability
Cites Work