1 citations · 1 across the 3 of their papers we have counts for
5 papers
A Non-wellfounded, Labelled Proof System for Propositional Dynamic Logic
Simon Docherty, Reuben N. S. Rowe
We define a infinitary labelled sequent calculus for PDL, G3PDL^{\infty}. A finitarily representable cyclic system, G3PDL^ω, is then given. We show that both are sound and complete…
Infinitary and Cyclic Proof Systems for Transitive Closure Logic
Liron Cohen, Reuben N. S. Rowe
Transitive closure logic is a known extension of first-order logic obtained by introducing a transitive closure operator. While other extensions of first-order logic with inductive…
Size Relationships in Abstract Cyclic Entailment Systems
Reuben N. S. Rowe, James Brotherston
A cyclic proof system generalises the standard notion of a proof as a finite tree of locally sound inferences by allowing proof objects to be potentially infinite. Regular infinite…
Encoding the Factorisation Calculus
Reuben N. S. Rowe
Jay and Given-Wilson have recently introduced the Factorisation (or SF-) calculus as a minimal fundamental model of intensional computation. It is a combinatory calculus containing…
Semantic Predicate Types and Approximation for Class-based Object Oriented Programming
Steffen van Bakel, Reuben N. S. Rowe
We apply the principles of the intersection type discipline to the study of class-based object oriented programs and; our work follows from a similar approach (in the context of Ab…