Talks
The list of all abstracts is available here.
Talk
-
Descriptive complexity for hard counting problems with easy decision versions
-
Runtime monitoring for Hennessy-Milner logic with recursion over systems with data
-
The categoricity of complete theories in second-order logic.
-
Effective Concept Classes of PAC and PACi Incomparable Degrees and Jump Structure.
-
Big Ramsey degrees of unconstrained ω-categorical structures.
-
Minimally n-valued maximally paraconsistent expansions of LP.
-
Games and Scott sentences for positive distances between metric structures.
-
Properties of lattices of existential formulas of Jonsson beautiful pairs.
-
Understanding trust assumptions for remote attestation via formal verification
-
Fully Certified Dynamic Epistemic Logic for Security Protocols
-
Almost negative truth and fixpoints in intuitionistic logic.
-
Abstract Lindenbaum lemma for non-finitary consequence relations.
-
The relevance of the incompleteness theorems with Hilbert's concrete proof theory.
-
Tarski's theorem about choice and the alternative axiomatic extension of NFU.
-
Between the Model-Theoretic and the Axiomatic Method of Characterizing Mathematical Truth
-
Formalizing the Appendix of Kelley's General Topology in the Naproche Proof Checker.
-
Removing Reinhardt's replacement.
-
Weak and strong versions of effective transfinite recursion.
-
Characterizing Cardinals by Lomega-sentences in an Absolute Way.
-
Applications of the open dihypergraph dichotomy for generalized Baire spaces.
-
On algebras of binary formulas for weakly circularly minimal theories.
-
Automorphism invariant measures on some structures and on their automorphism groups.
-
The strong small index property for the Fraisse limit of finite Heyting algebras
-
Compositional proof-theoretic semantics for natural language.
-
The phase transition for Harvey Friedman’s monotone Bolzano Weierstrass principle.
-
Tennebaum’s Theorem for quotient presentations of nonstandard models of arithmetic
-
Decidability of modal definability problem on the class of quasilinear frames.
-
Categorical representation of discrete dynamical systems computability
Plenary Talk
-
On the actions of finite permutation groups on groups of finite Morley rank
-
The uniform Kruskal theorem: a bridge between finite combinatorics and abstract set existence
-
Limits of applicability of Gödel’s second incompleteness theorem
Tutorial
-
Tutorial - Algebra and Logic in the Complexity of Constraints
Special Session
-
Computer Science Logic - On the dynamics of cut-elimination for circular and non-wellfounded proofs
-
Proof Theory and Ordinal Analysis - From interpolation to proofs
-
Philosophy of Mathematics - Geometrizing Kripke modal semantics
-
Reverse Mathematics and Combinatorial Principles - The strength of versions of Mycielski’s Theorem
-
Computer Science Logic - Alternating (In)Dependence-Friendly Logic ‡
-
Proof Theory and Ordinal Analysis - Isominimal realizations of patterns
-
Set Theory - Making the diamond principle fail at an inaccessible cardinal
-
Computer Science Logic - On the Power of Symmetric Linear Programs
-
Proof Theory and Ordinal Analysis - The Π21-spectrum conjecture
-
Philosophy of Mathematics - Hermann Weyl and the roots of mathematical logic
-
Computer Science Logic - Sequent calculi with restricted cuts for non-classical logics
-
Proof Theory and Ordinal Analysis - On the Constructive Constructible Universe
-
Philosophy of Mathematics - Conceptions of absolute generality
-
Model Theory - Monadic dividing lines and hereditary classes
-
Set Theory - A stationary-tower-free proof of Sealing from a supercompact
-
Computer Science Logic - Proofs, circuits, and total search problems
-
Model Theory - Henselian discretely valued fields and existential AKE principles
-
Set Theory - Club stationary reflection and consequences of square principles
-
Computer Science Logic - Should Type Theory replace Set Theory as the Foundation of Mathematics?
-
Philosophy of Mathematics - MOON theory: Mathematical Objects with Ontological Neutrality
-
Reverse Mathematics and Combinatorial Principles - Ackermann Function and Reverse Mathematics
Break
-
Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live Live
-
-
-