The degree structure of Weihrauch-reducibility

Get full text

Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories

Get full text

Polylogarithmic Cuts in Models of V^0

Get full text

An Algebraic Preservation Theorem for Aleph-Zero Categorical Quantified Constraint Satisfaction

Get full text

Call-by-Value and Call-by-Name Dual Calculi with Inductive and Coinductive Types

Get full text

Unifying Büchi Complementation Constructions

Get full text

Collapsible Pushdown Graphs of Level 2 are Tree-Automatic

Get full text

L-Recursion and a new Logic for Logarithmic Space

Get full text

Bisimilarity on Basic Process Algebra is in 2-ExpTime (an explicit proof)

Get full text

On the Complexity of Equivalence and Minimisation for Q-weighted Automata

Get full text

Generalizing determinization from automata to coalgebras

Get full text

On (Subgame Perfect) Secure Equilibrium in Quantitative Reachability Games

Get full text

Coarse abstractions make Zeno behaviours difficult to detect

Get full text

Vector Addition System Reversible Reachability Problem

Get full text

A Rewriting View of Simple Typing

Get full text

Asymptotically almost all lambda-terms are strongly normalizing

Get full text

Counting CTL

Get full text

Type classes for efficient exact real arithmetic in Coq

Get full text

Continuous Markovian Logics - Axiomatization and Quantified Metatheory

Get full text

Probabilistic modal {mu}-calculus with independent product

Get full text