|
Organizers |
Zofia Adamowicz
A new approach to bounded arithmetic
Patrick Cegielski
On the additive theory of prime numbers
Andrés Cordón
Provably total primitive recursive functions
C. Dimitracopoulos
Necessary and sufficient conditions for end extending models
Jacques Duparc
Solving Pushdown Games with Winning Conditions Beyond the Boolean Closure of \Sigma02-Sets
Henri-Alex Esbelin
Complexity of infinite series
Julia F. Knight
Coding in fragments of arithmetic
Alexander Lyaletski
On verification of mathematical texts in the System for Automated Deduction, SAD
Eugenio G. Omodeo
A pairing device for non-classic logics
Jean-Pierre Ressayre
On infinite real trace rational languages of maximum topological complexity
K. Shahbazyan and Yu. Shoukourian
EMSO-logic and automata related to homogeneous flow event structures
Maxim Vsemirnov
Mn-wise independent permutations: exact constructions and lower bounds
Alan Woods
Logical limit laws for ordinal numbers.
Igor D. Zaslavsky
Primitive recursive arithmetic containing not everywhere defined functions
Konrad Zdanowski
Logical properties of arithmetics of finite models
Konrad Zdanowski
The complexity of the set of true \Delta0 sentences