Result 1 to 20 of 67 total
On decidable extensions of Presburger arithmetic: From A. Bertrand numeration systems to Pisot numbers. (English)
J. Symb. Log. 65, No.3, 1347-1374 (2000).
1
On the restraining power of guards. (English)
J. Symb. Log. 64, No.4, 1719-1742 (1999).
2
The ground-negative fragment of first-order logic is $Π_2^p$-complete. (English)
J. Symb. Log. 64, No.3, 984-990 (1999).
3
Bounded arithmetic, proof complexity and two papers of Parikh. (English)
Ann. Pure Appl. Logic 96, No.1-3, 43-55 (1999).
4
Lifting independence results in bounded arithmetic. (English)
Arch. Math. Logic 38, No.2, 123-138 (1999).
5
Other proofs of old results. (English)
Math. Log. Q. 44, No.4, 474-480 (1998).
6
Extracting algorithms from intuitionistic proofs. (English)
Math. Log. Q. 44, No.2, 143-160 (1998).
7
Extensions of models of PV. (English)
Makowsky, Johann A. (ed.) et al., Logic colloquium ’95. Proceedings of the Annual European Summer Meeting of the Association of Symbolic Logic, Haifa, Israel, August 9‒18, 1995. Berlin: Springer. Lect. Notes Log. 11, 104-114 (1998).
8
A fast deterministic algorithm for formulas that have many satisfying assignments. (English)
Log. J. IGPL 6, No.1, 59-71 (1998).
9
Relating the provable collapse of $\bold P$ to $\bold N\bold C^1$ and the power of logical theories. (English)
Beame, Paul W. (ed.) et al., Proof complexity and feasible arithmetics. Papers from the DIMACS workshop, Rutgers, NJ, USA, April 21‒24, 1996. Providence, RI: American Mathematical Society. DIMACS, Ser. Discrete Math. Theor. Comput. Sci. 39, 73-91 (1998).
10
On bounded set theory. (English)
Dalla Chiara, Maria Luisa (ed.) et al., Logic and scientific methods. Volume one of the proceedings of the tenth international congress of logic, methodology and philosophy of science, Florence, Italy, August 19‒25, 1995. Dordrecht: Kluwer Academic Publishers. Synth. Libr. 259, 85-103 (1997).
11
On parallel hierarchies and $R_k^i$. (English)
Ann. Pure Appl. Logic 89, No.2-3, 231-273 (1997).
12
Parameter free induction and reflection. (English)
Gottlob, Georg (ed.) et al., Computational logic and proof theory. 5th Kurt Gödel Colloquium, KGC ’97. Vienna, Austria. August 25‒29, 1997. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 1289, 103-113 (1997).
13
The theory of integer multiplication with order restricted to primes is decidable. (English)
J. Symb. Log. 62, No.1, 123-130 (1997).
14
Definability, decidability, complexity. (English)
Ann. Math. Artif. Intell. 16, No.1-4, 311-341 (1996).
15
A bounded arithmetic theory for constant depth threshold circuits. (English)
Hájek, Petr (ed.), Gödel ’96. Logical foundations of mathematics, computer science and physics ‒ Kurt Gödel’s legacy. Proceedings of a conference, Brno, Czech Republic, August 1996. Berlin: Springer-Verlag. Lect. Notes Log. 6, 224-234 (1996).
16
A fundamental problem of mathematical logic. (English)
Collegium logicum. Annals of the Kurt Gödel Society. Volume 2. Wien: Springer-Verlag. 56-64 (1996).
17
Complexity of the decidability of one class of formulas in quantifier-free set theory with a set-union operator. (English)
Georgian Math. J. 3, No.1, 97-100 (1996).
18
On the consistency of classical formal arithmetic. (K voprosu o neprotivorechivosti klassicheskoj formal’noj arifmetiki.) (Russian)
Soobshcheniya po Prikladnoj Matematike. Moskva: Vychislitel’nyj Tsentr RAN, 26 p. (1995).
19
Transfinite induction within Peano arithmetic. (English)
Ann. Pure Appl. Logic 76, No.3, 231-289 (1995).
20
Result 1 to 20 of 67 total
Start
Contact
Print
General Help
