The slides of the presentations are available at the authors' permission.
All rights reserved.
Konstantinos Kartas
Decidability of local fields and their extensions
Jürgen Landes
A Triple Uniqueness of the Maximum Entropy Approach
Manos Kamarianakis, Dimitra Chompitaki and Thanases Pheidas
Decidability of the theory of addition and the Frobenius map in fields of rational functions
Ivan Titov and Wolfgang Merkle
Total variants of Solovay reducibility and speedability
Nick Galatos and Peter Jipsen
Generalized bunched implication logic
Simone Picenni
Exact truthmaking and self-reference: a model for self-applicable exact truthmaking
Ioannis Eleftheriadis and Aristomenis-Dionysios Papadopoulos
NSOP in Classes of Graphs
Iosif Petrakis
Proof-relevance in Bishop-style constructive mathematics
Fabian Pregel
Frege's Concept of Completeness
Vladimir Stepanov
Dynamic Approximation of Self-Referential Sentences
Pawel Pawlowski and Elio La Rosa
8-valued non-deterministic semantics for modal logics
Katerina Petsi
The Foundations of Arithmetic: Peano vs Dedekind
Philippos Papayannopoulos
Some Philosophical Remarks on the Current Definitions of Algorithms
Evan Iatrou
Non-monotonic rule-based logical programming for modelling legal reasoning the example of Answer Set Programming (ASP)
Antonis Kakas
Argumentation: Reasoning Universalis
Edoardo Rivello
The largest intrinsic disquotational definition of truth
Elli Anastasiadi, Antonis Achilleos, Adrian Francalanza and Jasmine Xuereb
Epistemic logic for verifying runtime verification communication protocols