Journal: Annals of Pure and Applied Logic

Volume 113, Issue 1-3

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