Logic group preprint series

Embedding of Heyting Algebras

Invariants in process algebra with data

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

A bounded retransmission protocol for large data packets

A computer-checked verification of Milner's scheduler

Proofs as texts

Linguistics, logic and finite trees

Hermann Weyl's intuitionistic mathematics

Cylindric modal logic

A Modal logic quantifications and substitution

A crash course in arrow logic

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

Proof-checking a data link protocol

Negative definability in modal logic

Network algebra for synchronous and asynchronous dataflow

Hennessy-Milner classes and process algebra

Counting variables in a dynamic setting

A complete axiomatization for prefix iteration in branching bisimulation

Binary decision diagrams for first order predicate logic

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

Process algebra semantics of f SDL

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

Dynamic bracketing and discourse representation

Abstract interpretation of reactive systems: preservation of CTL

A formal axiomatization for alphabet reasoning with parametrized processes

Safety criteria for Hoorn-Kersenboogerd railway station

The bakery protocol

Confluence for process verification

Interpreting reflexive theories in finitely many axioms

Interpretations over Heyting's arithmetic

A conservative look at term deduction systems with variable binding

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

Focus points and convergent process operators

Context in dynamic predicate logic

Relational validity & dynamic predicate logic

On the design of a correct freeness analysis for logic programs

Formalising LPOs and invariants in Coq

An axiomatisation of strong negation and relational composition

Specification and implementation of components of a u CRL toolbox

On automating process algebra proofs

A logic for signal inserted timed frames

Uniform interpolation, automata and the modal U-calculus

An axiomatization for the terminal cycle

Induction rules, reflection principles and provably recursive functions

Weakly associative relation algebras with polyadic composition operations

Parameter free induction and reflection

Q-algebras

Dynamic negation, the one and only

Empiricist semantics and indeterminades of reference

Clausification in Coq

The donkey and the monoid dynamic semantics with control elements

Submodels of Kripke models

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

Variable binding operators in transition system specifications

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

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

Brouwer en Weyl

Process algebra nonstandard timing

The worm principle

Godel's theorem

Continuity controlled hybrid automata

Execution architectures for program algebra

Machine function based control code algebras

Veblen hierarchy in the context of provability algebras

Provability Logic

Reflection principles and provability algebras in formal arithmetic

Admissible rules of modal logics

No escape from Vardanyan's Theorem

Process algebra for hybrid systems

Quantifier-free induction schema and the least element principle

Relative Interpretations in Constructive Arithmetic

Residuals in Higher-Order rewriting