Front title (PDF)
Copyright and reprint permission (PDF)
Committees (PDF)
External reviewers (PDF)
Logic and regular cost functions (PDF)
Symbolic execution and probabilistic reasoning (Abstract)
Algorithms for some infinite-state MDPs and stochastic games (PDF)
Quantitative semantics of the lambda calculus: Some generalisations of the relational model (Abstract)
Linear combinations of unordered data vectors (Abstract)
An interpretation of system F through bar recursion (Abstract)
On the extension of computable real functions (Abstract)
Logics for continuous reachability in Petri nets and vector addition systems with states (Abstract)
Foundation for a series of efficient simulation algorithms (Abstract)
Separation for dot-depth two (Abstract)
Foundational nonuniform (Co)datatypes for higher-order logic (Abstract)
Common knowledge and multi-scale locality analysis in Cayley structures (Abstract)
Bar induction: The good, the bad, and the ugly (Abstract)
Constructive completeness for the linear-time μ-calculus (Abstract)
Gödel logic: From natural deduction to parallel computation (Abstract)
Higher-order parity automata (Abstract)
Large scale geometries of infinite strings (Abstract)
Regular separability of one counter automata (Abstract)
Learning first-order definable concepts over structures of small degree (Abstract)
Descriptive complexity of linear equation systems and applications to propositional proof complexity (Abstract)
Definability of summation problems for Abelian groups and semigroups (Abstract)
Timed pushdown automata and branching vector addition systems (Abstract)
Fibred fibration categories (Abstract)
The logic of counting query answers (Abstract)
Enumeration reducibility in closure spaces with applications to logic and algebra (Abstract)
The limits of SDP relaxations for general-valued CSPs (Abstract)
Cut-free completeness for modal mu-calculus (Abstract)
Dual-context calculi for modal logic (Abstract)
Computing quantiles in Markov chains with multi-dimensional costs (Abstract)
Riesz Modal logic for Markov processes (Abstract)
Succinct progress measures for solving parity games (Abstract)
Generalised species of rigid resource terms (Abstract)
A fine-grained hierarchy of hard problems in the separated fragment (Abstract)
A categorical semantics for causal structure (Abstract)
On delay and regret determinization of max-plus automata (Abstract)
The clocks are ticking: No more delays! (Abstract)
Revisiting reachability in timed automata (Abstract)
Uniform, integral and efficient proofs for the determinant identities (Abstract)
Parity objectives in countable MDPs (Abstract)
Polynomial automata: Zeroness and applications (Abstract)
On the axiomatizability of quantitative algebras (Abstract)
Infinitary intersection types as sequences: A new answer to Klop's problem (Abstract)
Foundations of information integration under bag semantics (Abstract)
Perfect half space games (Abstract)
The homomorphism problem for regular graph patterns (Abstract)
The Weisfeiler-Leman dimension of planar graphs is at most 3 (Abstract)
Definability of semidefinite programming and lasserre lower bounds for CSPs (Abstract)
A monad for full ground reference cells (Abstract)
Quotients in monadic programming: Projective algebras are equivalent to coalgebras (Abstract)
Register automata with linear arithmetic (Abstract)
The geometry of concurrent interaction: Handling multiple ports by way of multiple tokens (Abstract)
An effectful way to eliminate addiction to dependence (Abstract)
Equivalence of inductive definitions and cyclic proofs under arithmetic (Abstract)
Model-checking for successor-invariant first-order formulas on graph classes of bounded expansion (Abstract)
The complexity of minimal inference problem for conservative constraint languages (Abstract)
Effectful applicative bisimilarity: Monads, relators, and Howe's method (Abstract)
Fully abstract encodings of λ-calculus in HOcore through abstract machines (Abstract)
The continuity of monadic stream functions (Abstract)
A cartesian-closed category for higher-order model checking (Abstract)
Understanding the complexity of #SAT using knowledge compilation (Abstract)
The primitivity of operators in the algebra of binary relations under conjunctions of containments (Abstract)
Capturing polynomial time using Modular Decomposition (Abstract)
A type-theoretical definition of weak ω-categories (Abstract)
Games with costs and delays (Abstract)
Verification of randomized security protocols (Abstract)
Typability in bounded dimension (Abstract)
The equivalence of two dichotomy conjectures for infinite domain constraint satisfaction problems (Abstract)
The pebbling comonad in Finite Model Theory (Abstract)
Stack semantics of type theory (Abstract)
MDPs with energy-parity objectives (Abstract)
Partial derivatives on graphs for Kleene allegories (Abstract)
First-order logic with counting (Abstract)
On strong determinacy of countable stochastic games (Abstract)
Domains and event structures for fusions (Abstract)
Strategy logic with imperfect information (Abstract)
A convenient category for higher-order probability theory (Abstract)
Untwisting two-way transducers in elementary time (Abstract)
Bounded time computation on metric spaces and Banach spaces (Abstract)
Quantifiers on languages and codensity monads (Abstract)
Decidability, complexity, and expressiveness of first-order logic over the subword ordering (Abstract)
Lean and full congruence formats for recursion (Abstract)
Differentiation in logical form (Abstract)
Static analysis of deterministic negotiations (Abstract)
On shift-invariant maximal filters and hormonal cellular automata (Abstract)
The real projective spaces in homotopy type theory (Abstract)
Data structures for quasistrict higher categories (Abstract)
A crevice on the Crane Beach: Finite-degree predicates (Abstract)
Descriptive Complexity for counting complexity classes (Abstract)
Categorical liveness checking by corecursive algebras (Abstract)
Unrestricted stone duality for Markov processes (Abstract)
A weakest pre-expectation semantics for mixed-sign expectations (Abstract)
