We study here a natural subclass of the locally stratified programs which we call acyclic. Acyclic programs enjoy several natural properties. First, they terminate for a large and natural class ofâ€¦ (More)

We study a powerful class of logic programs which terminate for a large class of goals. Both classes are characterized in a natural way in terms of mappings from variable-free atoms to naturalâ€¦ (More)

We present a possible computational content of the negative translation of classical analysis with the Axiom of Choice Our interpretation seems computationally more direct than the one based on Gâ€¦ (More)

We present a model of type theory with dependent product, sum, and identity, in cubical sets. We describe a universe and explain how to transform an equivalence between two types in an equality. Weâ€¦ (More)

We provide rules for calculating with invariants in process algebra with data, and illustrate these with examples. The new rules turn out to be equivalent to the well known Recursive Specificationâ€¦ (More)

First-order coherent logic (CL) extends resolution logic in that coherent formulas allow certain existential quantifications. A substantial number of reasoning problems (e.g., in confluence theory,â€¦ (More)

At first sight, the argument which F. P. Ramsey gave for (the infinite case of) his famous theorem from 1927, is hopelessly unconstructive. If suitably reformulated, the theorem is trueâ€¦ (More)

We model a one bit sliding window protocol and prove that its external behaviour is a bi directional bu er of capacity The proof is given in CRL which is a process algebra extended with data Due toâ€¦ (More)