|
Organizers |
Alexey V. Chernavsky
Decision Problems for Manifolds
Sergei Adian
The Burnside Problem on Periodic Groups and Related Topics
Sergei Artemov
From Proof Polynomials to Reflexive Combinators
Daniele Beauquier
Decidable Properties for Monadic Abstract State Machines
Anatoly Beltiukov
A Nonasymptotic Lower Time Bound for a Strictly Bounded Second Order Arithmetic
David Chemouil
Extensional Isomorphisms of Inductive Types in Simply-Typed Lambda-Calculus
Alexander L. Chistov
Application of Monodromy to Constructing Linear Sections in General Position of an Algebraic Variety
Alexandre P. Francisco
Circuits of Finite Memory Retrospective Operators
Se'verine Fratani
Iterated Pushdown Automata and Sequences of Rational Numbers
Olivier Hermant
A Model Based Cut Elimination Proof
Edward A. Hirsch
Several Notes on the Power of Gomory-Chvatal Cuts
Nikolai Kossovski
About Complexity of Constant Modulo Arithmetic
Svyatoslav Lavrov
In Which Form do Foundations of Mathematics Exist?
Alexander Letichevsky
Message Sequence Charts as a Model of Computation
Leonid P. Lisovik
Macrotransducers, Continuity and Computability
Alexander Lyaletski
On Efficient Quantifiers Manipulation in Gentzen's Calculi LK and LJ
Alexandre Lyaletsky, Jr.
On the Notion of Efficiency of Formal Systems from the Point of View of Inference Search Problems
Victor Makarov
Predicate Logic with Definitions and the General Concept of Algorithm
Grigori Mints
An Epsilon Substitution Method for a Theory of Non-iterated Inductive Definitions
Shinya Miyajima
On the Application of the Best Multiplication to Division in Affine Arithmetic
Nikolaj S. Nikitchenko
Compositional Logics and Abstract Computability over Nominative Data
Andreas Schumann
Quasi-solvability of \omega-order Predicate Calculus
Alexei Semenov
Natural Examples of Simple and Hypersimple Sets.
Nikolai A. Shanin
On Finitary Interpretations of Theorems of the Theory of Algorithms and Recursively Enumerable Sets
Henry Towsner
A Realizability Interpretation of Classical Analysis
Sergei Tupailo
On the Intuitionistic Strength of Monotone Inductive Definitions
Sergei Vakulenko
Complexity of Patterns Generated by Genetic Circuits and Pfaffian Functions
Mars Valiev
Complexity of Asynchronous Behavior of Multi-Agent Systems
Dan E. Willard
A Generalization of the Second Incompleteness Theorem and Some Exceptions to It
Valeri Zakharov
Universal Sets, Tarski Sets, and Inaccessible von Neumann Sets
Valeri Zakharov
MacLane's Problem on Foundations of Category Theory and Local Theory of Sets
Yi Zhang
Definable Sets of Generators in Maximal Cofinitary Groups