## Contributed Talks

The list of contributed talks is in random order. The links to authors' web pages are as provided by EasyChair.

On Families of Theories of Abelian Groups

An Improved Algorithm for Representation in Relational Mereotopology

Non-Archimedean Stratifications in Power Bounded T-convex Fields

An Overview of the C(n)-large Cardinals

Definability of the Jump Operator in the ω-enumeration Degrees

Incorrect Moves and Testable States

The Greatest Paraconsistent Analogue of Intuitionistic Logic

A Method for Companionability, Applied to Group Actions and Valuations

Reducibility and Bi-reducibility Spectra of Equivalence Relations

An Analogue of Hilbert's Tenth Problem for the Ring of Exponential Sums

Modal Depth of Formulas in K45 and K5

Nonequational Stable Groups

PSPACE Reasoning in an Expressive Description Logic with Rational Grading

Online Learning of Logical Theories for Complex Event Recognition

Proof Mining: An "Effective" Program (Even) for Ineffective Mathematics

Model Theory, Topological Dynamics and Descriptive Set Theory

Computable Bi-embeddable Categoricity of Equivalence Structures

Games Orbits Play and Obstructions to Borel Reducibility

Brouwer, Kleene, Kripke and the End of Time

Groups of Finite Morley Rank with a Finitary Automorphism Group

On Some Mathematical Aspects of Leitgeb's Theory of Groundedness

Computable Quotient Presentations of Models of Arithmetic and Set Theory

Yablo Sequences in Partial Semantics and Potentially Infinite Domains

Short Elementary Cuts in Countable Recursively Saturated Models of Arithmetic

Expressiveness and Complexity of Similarity Quantifiers%

Stability and Sparsity in Sets of Natural Numbers

An Analogue of Hilbert's Tenth Problem for Rings of Analytic Functions of Many Variables

A Type-Theoretic Alternative to LISP

Conjunctive Paraconsistency and the Law of Non-Dialetheia

Semiotic Systems in Pragmatics

The Complexity of Probabilistic Justification Logic

Epistemic-entrenchment Characterization of Parametrized Difference Revision Operators

Six Degrees of Separation in Answer Set Programming

The Complexity of Identifying Characteristic Formulas for muHML

Aristotle, Leibniz, and Beyond

End Extensions of Models of Arithmetic Theories, II

Tableau Complexity Measures