1 | -- | 0 | Yuri Matiyasevich. Preface |
3 | -- | 11 | Matthias Baaz, Petr Hájek, Franco Montagna, Helmut Veith. Complexity of t-tautologies |
13 | -- | 52 | Danièle Beauquier, Anatol Slissenko. A first order logic for specification of timed algorithms: basic properties and a decidable class |
53 | -- | 58 | Anatoly Petrovich Beltiukov. The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete |
59 | -- | 80 | Luc Boasson, Patrick Cégielski, Irène Guessarian, Yuri Matiyasevich. Window-accumulated subsequence matching problem is linear |
81 | -- | 94 | Evgeny Dantsin, Michael Gavrilovich, Edward A. Hirsch, Boris Konev. MAX SAT approximation beyond the limits of polynomial-time approximation |
95 | -- | 119 | Gennady Davydov, Inna Davydova. Towards logical operations research - propositional case |
121 | -- | 151 | Lew Gordeev. Finite methods in 1-order formalisms |
153 | -- | 160 | Dima Grigoriev, Nicolai Vorobjov. Complexity of Null-and Positivstellensatz proofs |
161 | -- | 173 | Rosalie Iemhoff. A (nother) characterization of intuitionistic propositional logic |
175 | -- | 180 | Nikolai Kossovski. Computational complexity of quantifier-free negationless theory of field of rational numbers |
181 | -- | 206 | Vladimir Krupski. The single-conclusion proof logic and inference rules specification |
207 | -- | 224 | Vladimir Lifschitz. On calculational proofs |
225 | -- | 242 | Grigori Mints. Interpolation theorems for intuitionistic predicate logic |
243 | -- | 259 | Valery Plisko. Arithmetic complexity of the predicate logics of certain complete arithmetic theories |
261 | -- | 295 | N. A. Shanin. On a finitary version of mathematical analysis |
297 | -- | 322 | Zhaohui Luo. Coercion completion and conservativity in coercive subtyping |
323 | -- | 330 | Michael A. Taitslin. A general condition for collapse results |
331 | -- | 344 | Maxim Vsemirnov. The Woods-Erdös conjecture for polynomial rings |
345 | -- | 372 | Tatiana Yavorskaya. Logic of proofs and provability |
373 | -- | 387 | Rostislav E. Yavorsky. Provability logics with quantifiers on proofs |
389 | -- | 397 | I. D. Zaslavsky. Dual realizability in symmetric logic |