Foundations for Uniform Interpolation and Forgetting in Expressive Description Logics
Free Choice Petri Nets without frozen tokens and Bipolar Synchronization Systems
From Abstract Rewriting Systems to Abstract Proof Systems
From Causal Semantics To Duration Timed Models
From coinductive proofs to exact real arithmetic: theory and applications
From formal proofs to mathematical proofs: a safe, incremental way for building in first-order decision procedures
From formulas to cirquents in computability logic
From nominal sets binding to functions and lambda-abstraction: connecting the logic of permutation models with the logic of functions
From Nondeterministic Büchi and Streett Automata to Deterministic Parity Automata
From Proof Nets to the Free *-Autonomous Category
From Strong Amalgamability to Modularity of Quantifier-Free Interpolation
From Total Assignment Enumeration to Modern SAT Solver
From truth to computability I
From truth to computability II
From X to Pi; Representing the Classical Sequent Calculus in the Pi-calculus
Full Abstraction for a Recursively Typed Lambda Calculus with Parallel Conditional
Functional Answer Set Programming
Functional Equivalence Checking for Verification of Algebraic Transformations on Array-Intensive Source Code
Functional Interpretations of Intuitionistic Linear Logic
Functions as proofs as processes