|
2008, Volume 358
|
|
|
|
Studies in constructive mathematics and mathematical logic. Part XI
|
Complexity of the identity checking problem for finite semigroups J. Almeida, M. V. Volkov, S. V. Gol'dberg
|
5–22 |
|
Non-maximal decidable structures A. Bès, P. Cégielski
|
23–37 |
|
Tree inclusions in windows and slices I. Guessarian, P. Cégielski
|
38–53 |
|
Time hierarchies for cryptographic function inversion with advice E. A. Hirsch, D. Yu. Grigor'ev, K. V. Pervyshev
|
54–76 |
|
Proof compressions with circuit-structured substitutions L. Gordeev, E. H. Haeusler, V. G. da Costa
|
77–99 |
|
The decision problem for some logics for finite words on infinite alphabets S. Grigorieff, Ch. Choffrut
|
100–119 |
|
On equations in free semigroups with certain constraints on their solutions V. G. Durnev, O. V. Zetkina
|
120–129 |
|
Fuzzy constructive logic I. D. Zaslavsky
|
130–152 |
|
The Lengths of Proofs: Kreisel's conjecture and Gödel's speed-up theorem S. Cavagnetto
|
153–188 |
|
Borel reducibility as an additive property of domains V. G. Kanovei, V. A. Lyubetskii
|
189–198 |
|
Defining the integers in large rings of a number field using one universal quantifier G. Cornelissen, A. Shlapentokh
|
199–223 |
|
In some curved spaces, one can solve NP-hard problems in polynomial time V. Kreinovich, M. Margenstern
|
224–250 |
|
Logical equations in monadic logic G. Mints, T. Hoshi
|
251–270 |
|
On a class of bases for Boolean functions D. Skordev
|
271–281 |
|
Faster subsequence recognition in compressed strings A. Tiskin
|
282–300 |
|
|