Abstracts

Sergei Artemov Formalization of Brouwer-Heyting-Kolmogorov semantics for intuitionistic logic
Anatoly Beltiukov Recognising Complexity of True Regular Protothetics Formulas With Partially Ordered Quantifiers
Sergei Bogomolov Logic Programming with Temporal Constraint Graphs
Inna Davydova Logical operations research
Lew Gordeew Finite methods in 1-order formalism
Petr Hájek Decidability of t-tautologies
Rosalie Iemhoff On the Admissible Rules of Intuitionistic Propositional Logic
Eduard Karavaev Deontic logic and some calculations
Ulrich Kohlenbach The computational strength of extensions of weak König's lemma
Nikolai Kossovski Decidability Complexity of Quantifier-free Negationless Theory of Field of Rational Numbers
Vladimir Krupski On proof term representation for deterministic operations on proofs
Vladimir Lifschitz Calculational Proofs
Grigori Mints Interpolation Theorems for Intuitionistic Predicate Logic
Valery Plisko \Sigma_n-realizability and its predicate logic
Regimantas Pliuskevicius On Effective Deductive Procedure for a Restricted First-order Linear Temporal Logic
Dimiter Skordev On the computer proof of a result in the abstract theory of segments
Anatol Slissenko A Logic for Specification of Timed Algorithms
Sergei Soloviev Coercion completion and conservativity in coercive subtyping
Enn Tyugu Which logic to use for program specifications?
Nicolai Vorobjov Computing the complexification of a semialgebraic set
Tatiana Yavorskaja (Sidon) Nonaxiomatizability of first order logics of proofs
Rostislav Yavorsky Provability logics with quantifiers on proofs