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

Nikolai Kossovski. Computational complexity of quantifier-free negationless theory of field of rational numbers. Annals of Pure and Applied Logic, 113(1-3):175-180, 2001.

Abstract

Abstract is missing.