M. Andrew Moshier

TL;DR: A Gentzen style sequent calculus where the formulas on the left and right of the turnstile need not necessarily come from the same logical system is studied, which can be seen as a consequence between different domains of reasoning.

TL;DR: Dcpos can be presented by preorders of generators and inequational relations expressed as covers and satisfies all the inequational laws satisfied by the generating algebra.

TL;DR: This paper lets the morphisms between stably compact spaces be certain “closed relations” and study the resulting categorical properties, exploiting this Stone-type duality to establish that the category of stable compact spaces and closed relations has bilimits.

TL;DR: The work reported here begins to bridge the gap between the domain theoretic and verification (model checking) perspectives on Probabilistic computation by exhibiting sound and complete logics for probabilistic powerdomains that arise directly from given logics from the underlying domains.