On decidability and axiomatizability of some ordered structures

DOI10.1007/s00500-018-3247-1zbMath1418.03171arXiv1709.05157OpenAlexW3099601755WikidataQ57533014 ScholiaQ57533014MaRDI QIDQ2318170

Ziba Assadi, Saeed Salehi

Publication date: 14 August 2019

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1709.05157

zbMATH Keywords

undecidabilityfirst-order theorycompletenessquantifier eliminationdecidabilityincompletenessordered structures

Mathematics Subject Classification ID

Undecidability and degrees of sets of sentences (03D35) Decidability of theories and sets of sentences (03B25) First-order arithmetic and fragments (03F30)

Related Items

Axiomatic (and non-axiomatic) mathematics

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Mathematical logic and model theory. A brief introduction
• Logical number theory I. An introduction
• On \(\mathsf{Q}\)
• Elementary Properties of Ordered Abelian Groups
• Computability and Logic
• On Axiomatizability of the Multiplicative Theory of Numbers
• Model Theory
• New Proof of the Generalized Chinese Remainder Theorem
• Definability and decision problems in arithmetic
• On direct products of theories
• The General Chinese Remainder Theorem
• Elementary properties of Abelian groups

This page was built for publication: On decidability and axiomatizability of some ordered structures