Specification by quantifier-free theory of superlinear inequalities and complexity of its decidability

zbMATH Open1134.03315MaRDI QIDQ5457656FDOQ5457656

Kossovski Nikolai, Tishkov Artem

Publication date: 14 April 2008

Recommendations

• Computational complexity of quantifier-free negationless theory of field of rational numbers
• scientific article; zbMATH DE number 4014674
• On the computational complexity and geometry of the first-order theory of the reals. III: Quantifier elimination
• scientific article; zbMATH DE number 3895043
• scientific article; zbMATH DE number 16666

zbMATH Keywords

first-order logicmany-valued logicsequent calculusdecision algorithmquantifier-free theoryexp(lin)-time classe of algorithms

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25)

Cited In (1)

• Computational complexity of quantifier-free negationless theory of field of rational numbers

This page was built for publication: Specification by quantifier-free theory of superlinear inequalities and complexity of its decidability

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