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

DOI10.1007/BF01147467zbMATH Open0274.02019MaRDI QIDQ2264657FDOQ2264657

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

• Introduction to model theory and to the metamathematics of algebra
• Title not available (Why is that?)

Cited In (2)

• $\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

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)