Abstract Lindenbaum lemma for non-finitary consequence relations.

Petr Cintula

Normalization for epsilon calculus.

Elio La Rosa

Tennebaum’s Theorem for quotient presentations of nonstandard models of arithmetic

Michal Godziszewski

Big Ramsey degrees of unconstrained ω-categorical structures.

Matej Konecny

Symmetry, locality and hyperintensionality

Maria Beatrice Buonaguidi

On an ecumenical natural deduction with stoup.

Elaine Pimentel

Two computational clusters in ordinary mathematics.

Sam Sanders

On stable quotients.

Adrian Portillo

Big Ramsey degrees and trees with sucessor operation.

Jan Hubicka

A class of implicative expansions of Belnap-Dunn logic in whose elements a Boolean negation is definable.

José M. Méndez

On extracting variable Herbrand disjunctions.

Andrei Sipos

Weak and strong versions of effective transfinite recursion.

Patrick Uftring

Arithmetic via Carnap-categoricity.

Sebastian G.W. Speitel

Weakly Menger Ditopological Texture Spaces

Hafiz Ullah

Equivalence relations and learning of algebraic structures.

Vittorio Cipriani

Foundations of team semantics.

Fredrik Engstrom

Formalizing the Appendix of Kelley's General Topology in the Naproche Proof Checker.

Peter Koepke

On algebras of binary formulas for weakly circularly minimal theories.

Beibut Kulpeshov

Propositional identity. From semantics to proof theory.

Agata Tomczyk

A computability perspective on verified machine learning.

Tonicha Crook

Dimension in team semantics.

Jouko Väänänen

Unthreadability at aleph2.

Maxwell Levine

Automorphism invariant measures on some structures and on their automorphism groups.

Gabor Sagi

Meaning is Use - the Case of Propositional Identity.

Szymon Chlebowski

Effective Concept Classes of PAC and PACi Incomparable Degrees and Jump Structure.

Gihanee M. D. Senadheera

The logic E-Mingle and its Routley-Meyer semantics.

Gemma Robles

The phase transition for Harvey Friedman’s monotone Bolzano Weierstrass principle.

Andreas Weiermann

The strong small index property for the Fraisse limit of finite Heyting algebras

Kentaro Yamamoto

Methods of modelling linear time in hypersequent calculus.

Patrycja Kupś

Descriptive complexity for hard counting problems with easy decision versions

Aggeliki Chalki

Stability of generalized Johnson graphs

Bjarki Geir Benediktsson

Hyperarithmetical Worm Battles

Konstantinos Papafilippou

Can propositions be intentions, intuitionistically?

Bruno Bentzen

Frame definability in finitely-valued modal logic.

Guillermo Badia

Runtime monitoring for Hennessy-Milner logic with recursion over systems with data

Léo Exibard

Properties of lattices of existential formulas of Jonsson beautiful pairs.

Olga Ulbrikht

Proof Theory of Skew Non-Commutative MILL.

Cheng-Syuan Wan

Almost negative truth and fixpoints in intuitionistic logic.

Mattias Granberg Olsson

Relational semantics for some classical relevance logics.

Katalin Bimbó

Gödel Temporal Logic

Brett McLean

Syntactic and semantic similarities of hybrids of classes of the Jonsson spectrum of Jonsson quasivariety of the class K.

Nazerke Mussina

The reverse mathematical strength of hyperations.

Philipp Provenzano

Positive negation in constructive mathematics.

Iosif Petrakis

Decidability of modal definability problem on the class of quasilinear frames.

Tinko Tinchev

Exponential sums equations and tropical geometry.

Francesco Gallinaro

Arbitrary Abstraction and Logicality.

Ludovica Conti

1-Complete first-order mereological theories

Hsing-Chien Tsai

Minimally n-valued maximally paraconsistent expansions of LP.

Alexej Pynko

Games and Scott sentences for positive distances between metric structures.

Joni Puljujarvi

Truth-theoretic determinacy revisited.

Pablo Dopico

Intermediate Goodstein principles.

Oriola Gjetaj

Paraconsistent extensions of three-valued logics.

Alexej Pynko

On theories of dense spherical orders.

Sergey Sudoplatov

Between the Model-Theoretic and the Axiomatic Method of Characterizing Mathematical Truth

Michal Godziszewski

The structural complexity of models of arithmetic.

Dino Rossegger

Extensions of paraconsistent three-valued chain logics.

Alexej Pynko

Categorical representation of discrete dynamical systems computability

Mark Addis

The relevance of the incompleteness theorems with Hilbert's concrete proof theory.

Yong Cheng

Formalizing assignment of types to terms in NFU

Vedran Cacic

Proof complexity of monotone branching programs.

Avgerinos Delkos

Categoricity ordinals and models of Presburger arithmetic

Jason Block

Two halves of disjunctive correctness.

Cezary Cieśliński

Tarski's theorem about choice and the alternative axiomatic extension of NFU.

Tin Adlesic

Understanding trust assumptions for remote attestation via formal verification

Muhammad Usama Sardar

The categoricity of complete theories in second-order logic.

Tapio Saarinen

Reformulating supervaluational theory of truth.

Daichi Hayashi

Compactness and Types in Logics of Dependence.

Davide Quadrellaro

Fully Certified Dynamic Epistemic Logic for Security Protocols

Bogdan Macovei

More on Constructive Nonsense Logic

Hitoshi Omori

Forcing without AC and the Axiom of Dependent Choice

Jonathan Schilhan

Countable ranks at the first and second projective levels.

Philipp Schlicht

Paraconsistent and paracomplete Zermelo-Fraenkel set theory

Hrafn Oddsson

Model-theoretical characterizations of truth

Mateusz Lelyk

Sequent Calculus for non-Fregean Boolean theory WB.

Agata Tomczyk

Applications of the open dihypergraph dichotomy for generalized Baire spaces.

Dorottya Sziraki

Characterizing Cardinals by Lomega-sentences in an Absolute Way.

Ioannis Souldatos

Compositional proof-theoretic semantics for natural language.

Will Stafford

Computability of finite simplicial complexes and homology

Amir Djamel Eddine

What are magic sets?

Agnieszka Widz