Heyting Session (Invited Papers) -- On the Early History of Intuitionistic Logic -- Heyting and Intuitionistic Geometry -- Summer School (Invited Lectures) -- Provability Logics for Relative Interpretability -- Constructive Mathematics and Computer-Assisted Reasoning Systems -- Markovโ{128}{153}s Constructive Mathematical Analysis: the Expextations and Results -- Normalization Theorems for the Intuitionistic Systems with Choice Principles -- Formalizing the Notion of Total Information -- Structural Rules and a Logical Hierarchy -- Semantics of Non-classical First Order Predicate Logics -- On the Computational Power of the Logic Programs -- Some Relations among Systems for Bounded Arithmetic -- A Survey of Intuitionistic Descriptive Set Theory -- Interpretability Logic -- Hierarchies of Provably Computable Functions -- Conference (Contributed Papers) -- Sequent Calculus for Intuitionistic Linear Propositional Logic -- Order Isomorphisms โ{128}{148} a Constructive Measure-Theoretic View -- 1-Generic Enumeration Degrees Below Oeโ{128}{153} -- Remarks on Denjoy Sets -- Normal Modal Logic in Which the Heyting Proposotional Calculus Can be Embedded -- Lattices Adequate for Intutionistic Predicate Logic -- A Note on Boolean Modal Logic -- Completeness and Incompleteness in the Bimodal Base L(R,?R) -- A Temporal Logic for Event Structures -- Completeness of Propositional Dynamic Logic with Infinite Repeating -- An Equivalence between Polinomial Constructivity of Markovโ{128}{153}s Principle and Equality P=NP -- Effective Enumerations of Abstract Structures -- Modal Characterization of the Classes of Finite and Infinite Quasi-Ordered Sets -- Least Fixed Points in Preassociative Combinatory Algebras -- Participants, Contributors and Programme Committee Members