Result 1 to 13 from 13 total
Consequences of neocompact quantifier elimination. (English)
Math. Log. Q. 49, No.2, 150-162 (2003).
1
Program verification based on the specification language SIMPLE. (English)
Jt. Bull. NCC IIS, Ser. Comput. Sci. 15, 1-16 (2001).
2
Complexity of computing the local dimension of a semialgebraic set. (English)
J. Symb. Comput. 27, No.6, 565-579 (1999).
3
Sentences over integral domains and their computational complexities. (English)
Inf. Comput. 149, No.2, 99-133 (1999).
4
Polynomial time algorithms for sentences over number fields. (English)
Inf. Comput. 97, No.2, 262-276 (1992).
5
Computational complexity of solving real algebraic formulae. (English)
Proc. Int. Congr. Math., Kyoto/Japan 1990, Vol. II, 1595-1605 (1991).
6
Complexité du principe de Tarski-Seidenberg. (Complexity of Tarski- Seidenberg’s principle). (French)
C. R. Acad. Sci., Paris, Sér. I 309, No.13, 825-830 (1989).
7
Relations intrinsically recursive in linear orders. (English)
Z. Math. Logik Grundlagen Math. 32, 467-472 (1986).
8
Complexity of quantifier elimination in the theory of algebraically closed fields. (English)
Mathematical foundations of computer science, Proc. 11th Symp., Praha/Czech. 1984, Lect. Notes Comput. Sci. 176, 17-31 (1984).
9
Some applications of a model theoretic fact to (semi-)algebraic geometry. (English)
Indag. Math. 44, 397-401 (1982).
10
Quantifier elimination for linear formulas over ordered and valued fields. (English)
Bull. Soc. Math. Belg., Sér. B 33, 19-31 (1981).
11
On quantifier-free $ε_0$-recursive arithmetic. (English)
Mosc. Univ. Math. Bull. 32, No.6, 15-20 (1977).
12
On quantifier-free $ε_0$-recursive arithmetic. (Russian)
Vestn. Mosk. Univ., Ser. I 1977, No.6, 19-25 (1977).
13
Result 1 to 13 from 13 total
Start
Contact
Print
General Help
