The role of quantifier alternations in cut elimination. (English)
Notre Dame J. Formal Logic 46, No. 2, 165-171 (2005).
1
Expressive power of existential first-order sentences of Büchi’s sequential calculus. (English)
Discrete Math. 291, No. 1-3, 155-174 (2005).
2
Undecidability in diagonalizable algebras. (English)
J. Symb. Log. 62, No.1, 79-116 (1997).
3
Simple sentences that are hard to decide. (English)
Inf. Comput. 94, No.1, 62-82 (1991).
4
Refined hierarchy of formulas. (English)
Algebra Logic 30, No.5, 368-378 (1991); translation from Algebra Logika 30, No.5, 568-582 (1991).
5
Simple interpretations among complicated theories. (English)
Inf. Process. Lett. 35, No.5, 235-238 (1990).
6
Domino games with an application to the complexity of Boolean algebras with bounded quantifier alternations. (English)
STACS 88, Theoretical aspects of computer science, Proc. 5th Annu. Symp., Bordeaux/France 1988, Lect. Notes Comput. Sci. 294, 98-107 (1988).
7
Languages that capture complexity classes. (English)
SIAM J. Comput. 16, 760-778 (1987).
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
Start
Contact
Print
General Help
