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

DOI10.1016/S0168-0072(01)00057-4zbMath0988.03061MaRDI QIDQ5957912

No author found.

Publication date: 11 July 2002

Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)

zbMATH Keywords

decidabilitybinary rational numbersquantifier-free theory of the field of rational numbersuniversal negationless theory

Mathematics Subject Classification ID

Decidability and field theory (12L05) Decidability of theories and sets of sentences (03B25) Complexity of computation (including implicit computational complexity) (03D15) Other constructive mathematics (03F65)

Cites Work

• Solving systems of polynomial inequalities in subexponential time
• Definability and decision problems in arithmetic
• Unnamed Item
• Unnamed Item

This page was built for publication: Computational complexity of quantifier-free negationless theory of field of rational numbers