Solvability of the theory of integers with addition, order, and multiplication by an arbitrary number

DOI10.1007/BF01147467MaRDI QIDQ2264657zbMATH OpenFDO

Authors Yu. G. Penzin

Publication date 1973

Published in Mathematical Notes (Search for Journal in Brave)

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Applications of computability and recursion theory (03D80)

Cites work

• scientific article; zbMATH DE number 3360157 (Why is no real title available?)
• Introduction to model theory and to the metamathematics of algebra

Cited in

(2)

• A list of arithmetical structures complete with respect to the first-order definability
• $\mathbb \{Q\}$ muni de l’arithmétique faible de Penzin est décidable

This page was built for publication: Solvability of the theory of integers with addition, order, and multiplication by an arbitrary number

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