Decomposable Theories

Decomposition of Decidable First-Order Logics over Integers and Reals

Decorated proofs for computational effects: Exceptions

Decreasing Diagrams and Relative Termination

Deduction as Reduction

Definability of linear equation systems over groups and rings

Definable functions in the simply typed lambda-calculus

Defining Rough Sets by Extended Logic Programs

Defining the Delays of the Asynchronous Circuits

Definitions by rewriting in the Calculus of Constructions

Definitions by Rewriting in the Calculus of Constructions

Degrees of Undecidability in Rewriting

Delta-Complete Decision Procedures for Satisfiability over the Reals

Denotation of syntax and metaprogramming in contextual modal type theory (CMTT)

Dense-choice Counter Machines revisited

Dense-Timed Petri Nets: Checking Zenoness, Token liveness<br> and<br><br> Boundedness

Dependence logic with a majority quantifier

Dependency Pairs and Polynomial Path Orders

Dependently-Typed Formalisation of Typed Term Graphs

Deriving a Hoare-Floyd logic for non-local jumps from a formulae-as-types notion of control