Stochastic mechanics of graph rewriting ( abstract )

On the Satisfiability of Some Simple Probabilistic Logics ( abstract )

Distinguishing Hidden Markov Chains ( abstract )

Quantitative Automata under Probabilistic Semantics ( abstract )

Deciding First-Order Satisfiability when Universal and Existential Variables are Separated ( abstract )

The diagonal problem for higher-order recursive schemes is decidable ( abstract )

Two-variable logic with a between relation ( abstract )

Decidability and Complexity for Quiescent Consistency ( abstract )

From positive and intuitionistic bounded arithmetic to proof complexity ( abstract )

Goedel's functional interpretation and the concept of learning ( abstract )

Understanding Gentzen and Frege Systems for QBF ( abstract )

Unified Semantics and Proof System for Classical, Intuitionistic and Affine Logics ( abstract )

Data Communicating Processes with Unreliable Channels ( abstract )

A New Perspective on FO Model Checking of Dense Graph Classes ( abstract )

Proving Liveness of Parameterized Programs ( abstract )

Model and Objective Separation with Conditional Lower Bounds: Disjunction is Harder than Conjunction ( abstract )

Complexity of regular abstractions of one-counter languages ( abstract )

Two-Way Visibly Pushdown Automata and Transducers ( abstract )

Automata on Infinite Trees with Equality and Disequality Constraints Between Siblings ( abstract )

Plays as Resource Terms via Non-idempotent Intersection Types ( abstract )

Perfect-information Stochastic Games with Generalized Mean-Payoff Objectives ( abstract )

Games with bound guess actions ( abstract )

Near-Optimal Lower Bounds on Quantifier Depth and Weisfeiler-Leman Refinement Steps ( abstract )

Hanf normal form for first-order logic with unary counting quantifiers ( abstract )

Upper Bounds on the Quantifier Depth For Graph Differentiation in First Order Logic ( abstract )

Querying Visible and Invisible Information ( abstract )

Coinduction All the Way Up ( abstract )

Denotational semantics of recursive types in synthetic guarded domain theory ( abstract )

Type Theory based on Dependent Inductive and Coinductive Types ( abstract )

Program Equivalence is Coinductive ( abstract )

Fixed Points in Quantitative Semantics ( abstract )

Ability to Count Messages Is Worth $\Theta(\Delta)$ Rounds in Distributed Computing ( abstract )

The Definitional Side of the Forcing ( abstract )

Towards Completeness via Proof Search in the Linear Time Mu-calculus ( abstract )

First-order definability of rational transductions: An algebraic approach ( abstract )

Order Invariance on Decomposable Structures ( abstract )

Definability equals recognizability for graphs of bounded treewidth ( abstract )

Monadic second order logic as the model companion of temporal logic ( abstract )

Interaction Graphs: Full Linear Logic ( abstract )

Conflict nets: efficient locally canonical MALL proof nets ( abstract )

Infinitary Lambda Calculi from a Linear Perspective ( abstract )

First-order logic with reachability for infinite-state systems ( abstract )

The Complexity of Coverability in ν-Petri Nets ( abstract )

Reachability in Two-Dimensional Unary Vector Addition Systems with States is NL-Complete ( abstract )

Comparing Chemical Reaction Networks: A Categorical and Algorithmic Perspective ( abstract )

A categorical approach to open and interconnected dynamical systems ( abstract )

Differential Refinement Logic ( abstract )

On Recurrent Reachability for Continuous Linear Dynamical Systems ( abstract )

Semantics for probabilistic programming: higher-order functions, continuous distributions, and soft constraints ( abstract )

Interacting Frobenius Algebras are Hopf. ( abstract )

Semi-galois Categories I: The Classical Eilenberg Variety Theory ( abstract )

A bifibrational reconstruction of Lawvere's presheaf hyperdoctrine ( abstract )

A Mechanization of the Blakers-Massey Connectivity Theorem in Homotopy Type Theory ( abstract )

Hybrid realizability for intuitionistic and classical choice ( abstract )

Trace semantics for polymorphic references ( abstract )

Constructions with Non-Recursive Higher Inductive Types ( abstract )

A constructive function-theoretic approach to topological compactness ( abstract )

The algebraic dichotomy conjecture for infinite domain Constraint Satisfaction Problems ( abstract )

Reducts of finitely bounded homogeneous structures, and lifting tractability from finite-domain constraint satisfaction ( abstract )

Weak consistency notions for all the CSPs of bounded width ( abstract )

Graphs of relational structures: restricted colours ( abstract )

The Power of Arc Consistency for CSPs Defined by Partially-Ordered Forbidden Patterns ( abstract )

Reasoning about Recursive Probabilistic Programs ( abstract )

Healthiness from Duality ( abstract )

Kolmogorov Extension, Martingale Convergence, and Compositionality of Processes ( abstract )

Quantitative Algebraic Reasoning ( abstract )

Rewriting modulo symmetric monoidal structure ( abstract )

Effective Brenier's Theorem: Applications to Computable Analysis and Algorithmic Randomness ( abstract )

Quantifier Free Definability on Infinite Algebras ( abstract )

Factor Varieties and Symbolic Computation ( abstract )

Proving Differential Privacy via Probabilistic Couplings ( abstract )

On Thin Air Reads: Towards an Event Structures Model of Relaxed Memory ( abstract )

Towards Compositional Feedback in Non-Deterministic and Non-Input-Receptive Systems ( abstract )

Divide and Congruence II: Delay and Weak Bisimilarity ( abstract )

How unprovable is Rabin's decidability theorem? ( abstract )

Solvability of Matrix-Exponential Equations ( abstract )

Order-Invariance of Two-Variable Logic is Decidable ( abstract )

A step up in expressiveness of decidable fixpoint logics ( abstract )

Church Meets Cook and Levin ( abstract )

Complexity Theory of (Functions on) Compact Metric Spaces ( abstract )

Semantically Acyclic Conjunctive Queries under Functional Dependencies ( abstract )

A Generalised Twinning Property for Minimisation of Cost Register Automata ( abstract )

Invisible Pushdown Languages ( abstract )

Minimization of Symbolic Tree Automata ( abstract )