Decidability of the restricted theories of a class of partial orders
From MaRDI portal
(Redirected from Publication:5151271)
Recommendations
- On complexity of the satisfiability problem of systems over finite posets
- scientific article; zbMATH DE number 4008363
- scientific article; zbMATH DE number 1302871
- Decidability of classes of algebraic systems in polynomial time
- On complexity of the existential and universal theories of finite fields
Cites work
- Algebraic geometry over algebraic structures. III: Equationally Noetherian property and compactness
- scientific article; zbMATH DE number 3172309 (Why is no real title available?)
- scientific article; zbMATH DE number 1181276 (Why is no real title available?)
- scientific article; zbMATH DE number 3316936 (Why is no real title available?)
- scientific article; zbMATH DE number 3336816 (Why is no real title available?)
- Model Theory
- On complexity of the satisfiability problem of systems over finite posets
- The complexity of the word problems for commutative semigroups and polynomial ideals
- The complexity of theorem-proving procedures
- The elementary theory of finite fields
Cited in
(8)- Decidability, partial decidability and sharpness relation for L-subsets
- Decidability of the restriction equational theory in the partial lambda calculus
- On the generic existential theory of finite graphs
- On Partial Covers, Reducts and Decision Rules
- scientific article; zbMATH DE number 4008363 (Why is no real title available?)
- A decidable two-sorted quantified fragment of set theory with ordered pairs and some undecidable extensions
- scientific article; zbMATH DE number 7340151 (Why is no real title available?)
- A remark concerning decidability of complete theories
This page was built for publication: Decidability of the restricted theories of a class of partial orders
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5151271)