Weak Arithmetics play a fundamental role in several areas of philosophy, mathematics, and computer science. Among the topics are proofs in arithmetic with restricted system of axioms, decidability, undecidability, and complexity of arithmetical theories, definability in arithmetic structures, machines, automata and words, word structures.
Further details you find on the JAF's conference website at the University of Passau.
The registration for the participation is open as long there is space. Students of the university are very welcome. To register, please send your details (full name, affiliation, planned dates of arrival and departure) to azza.gaysin@gmail.com.
Share this page
