6 citations · 12 across the 5 of their papers we have counts for
6 papers
Provability in BI's Sequent Calculus is Decidable
Alexander Gheorghiu, Simon Docherty, David Pym
Warning: This paper contains a mistake, rendering the proof of the main theorem invalid. The logic of Bunched Implications (BI) combines both additive and multiplicative connective…
Robust Mean Estimation on Highly Incomplete Data with Arbitrary Outliers
Lunjia Hu, Omer Reingold
We study the problem of robustly estimating the mean of a -dimensional distribution given examples, where most coordinates of every example may be missing and $\varepsilon N…
Partially Observable Concurrent Kleene Algebra
Jana Wagemaker, Paul Brunet, Simon Docherty +3
We introduce partially observable concurrent Kleene algebra (POCKA), an algebraic framework to reason about concurrent programs with control structures, such as conditionals and lo…
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…
Stone-Type Dualities for Separation Logics
Simon Docherty, David Pym
Stone-type duality theorems, which relate algebraic and relational/topological models, are important tools in logic because -- in addition to elegant abstraction -- they strengthen…
Intuitionistic Layered Graph Logic: Semantics and Proof Theory
Simon Docherty, David Pym
Models of complex systems are widely used in the physical and social sciences, and the concept of layering, typically building upon graph-theoretic structure, is a common feature.…