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