Volume 113, Number 1-3, 27 December 2001
Anatoly Petrovich Beltiukov
: The set of the true regular protothetics formulas with partially ordered quantifiers is NEXPTIME-complete.
: Finite methods in 1-order formalisms.
: A (nother) characterization of intuitionistic propositional logic.
: Computational complexity of quantifier-free negationless theory of field of rational numbers.
: The single-conclusion proof logic and inference rules specification.
: Interpolation theorems for intuitionistic predicate logic.
: Arithmetic complexity of the predicate logics of certain complete arithmetic theories.
N. A. Shanin
: On a finitary version of mathematical analysis.
: Coercion completion and conservativity in coercive subtyping.