Weaks Arithmetics play a fundamental role in several areas of philosophy, mathematics, and computer science by studying the nature and properties of natural numbers from a logical point of view.
The aim of the conference is to provide a forum for researchers to present their results to those members of communities who study or apply weak arithmetics in the different fields and formalisms.
Proofs in arithmetic with restricted system of axioms.
Non-standard Models of such systems.
Decidability, undecidability, complexity of arithmetical theories.
Definability in arithmetic structures.
Machines, automata and words, related to arithmetic.
Finite model theory, words structures.
Patrick Cégielski, université Paris Est Créteil (université Paris 12, France),
Julien Cervelle, université Paris Est Créteil (université Paris 12, France),
Andrés Córdon-Franco, Seville (Spain),
Ali Enayat, Göteborg (Sweden),
Costas Dimitracopoulos, Athens (Greece),
Alex Esbelin, Clermont-Ferrand (France),
Neil Thapen, Prague, Academy of Sciences of the Czech Republic
E-mail: cegielski at u-pec.fr