Logic group preprint series

A bounded retransmission protocol for large data packets

A computer-checked verification of Milner's scheduler

A correctness proof of a one-bit sliding window protocol in -m-CRL

A Modal logic quantifications and substitution

Cylindric modal logic

Embedding of Heyting Algebras

Hermann Weyl's intuitionistic mathematics

Invariants in process algebra with data

Linguistics, logic and finite trees

A crash course in arrow logic

Counting variables in a dynamic setting

Euler's f--function in the context of I-D-0

Hennessy-Milner classes and process algebra

Negative definability in modal logic

Network algebra for synchronous and asynchronous dataflow

Proof-checking a data link protocol

A proof-checked verification of a real-time communication protocol

A complete axiomatization for prefix iteration in branching bisimulation

A conservative look at term deduction systems with variable binding

A formal axiomatization for alphabet reasoning with parametrized processes

Abstract interpretation of reactive systems: preservation of CTL

An axiomatisation of strong negation and relational composition

Binary decision diagrams for first order predicate logic

Context in dynamic predicate logic

Focus points and convergent process operators

Formalising LPOs and invariants in Coq

Interpretations over Heyting's arithmetic

Interpreting reflexive theories in finitely many axioms

On the completeness of the equations for the Kleene star in bisimulation

On the design of a correct freeness analysis for logic programs

Relational validity & dynamic predicate logic

Safety criteria for Hoorn-Kersenboogerd railway station

A logic for signal inserted timed frames

An axiomatization for the terminal cycle

Confluence for process verification

Induction rules, reflection principles and provably recursive functions

On automating process algebra proofs

The bakery protocol

Uniform interpolation, automata and the modal U-calculus

Weakly associative relation algebras with polyadic composition operations

Machine function based control code algebras

A modal analysis of some principles of the provability logic of Heyting arithmetic

Admissible rules of modal logics

Brouwer en Weyl

Clausification in Coq

Continuity controlled hybrid automata

Dynamic bracketing and discourse representation

Dynamic negation, the one and only

Empiricist semantics and indeterminades of reference

Execution architectures for program algebra

Extended abstracts of the Fifth International Workshop on Termination (WST '01)

Godel's theorem

No escape from Vardanyan's Theorem

Parameter free induction and reflection

Proceedings of the Fourth Workshop on Explicit Substitutions Theory and Applications (WESTAPP '01)

Process algebra for hybrid systems

Process algebra nonstandard timing

Process algebra semantics of f SDL

Proofs as texts

Provability Logic

Q-algebras

Quantifier-free induction schema and the least element principle

Reflection principles and provability algebras in formal arithmetic

Relative Interpretations in Constructive Arithmetic

Residuals in Higher-Order rewriting

Specification and implementation of components of a u CRL toolbox

Submodels of Kripke models

The donkey and the monoid dynamic semantics with control elements

The worm principle

Variable binding operators in transition system specifications

Veblen hierarchy in the context of provability algebras

Verifying modal formulas over I/O-automata by means of type theory