DECIDABILITY OF THE RESTRICTED THEORIES OF A CLASS OF PARTIAL ORDERS

DOI10.17223/20710410/45/1zbMath1461.03008OpenAlexW2983077088MaRDI QIDQ5151271

A. Yu. Nikitin

Publication date: 17 February 2021

Published in: Prikladnaya Diskretnaya Matematika (Search for Journal in Brave)

Full work available at URL: http://mathnet.ru/eng/pdm666

zbMATH Keywords

posetpartially ordered setclassesdecidability of existential theorydecidability of universal theory

Mathematics Subject Classification ID

Partial orders, general (06A06) Decidability of theories and sets of sentences (03B25) Basic properties of first-order languages and structures (03C07)

Cites Work

• Algebraic geometry over algebraic structures. III: Equationally Noetherian property and compactness
• The complexity of the word problems for commutative semigroups and polynomial ideals
• The elementary theory of finite fields
• Model Theory
• ON COMPLEXITY OF THE SATISFIABILITY PROBLEM OF SYSTEMS OVER FINITE POSETS
• The complexity of theorem-proving procedures
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: DECIDABILITY OF THE RESTRICTED THEORIES OF A CLASS OF PARTIAL ORDERS