Mathematical Structures in Computer Science · 2009 · 20 citations · 26 references
Natural SciencesComputer ScienceMathematicsDynamical SystemsLogicSet TheoryBoolean AlgebraCategory TheoryDeductive ReasoningModel TheoryDynamic LogicDynamic Logic Models
A restriction category is an abstract category of partial maps. A Boolean restriction category is a restriction category that supports classical (Boolean) reasoning. Such categories are models of loop-free dynamic logic that is deterministic in the sense that < α > Q ⊂ [α] Q . Classical restriction categories are restriction categories with a locally Boolean structure: it is shown that they are precisely full subcategories of Boolean restriction categories. In particular, a Boolean restriction category may be characterised as a classical restriction category with finite coproducts in which all restriction idempotents split. Every restriction category admits a restriction embedding into a Boolean restriction category. Thus, every abstract category of partial maps admits a conservative extension that supports classical reasoning. An explicit construction of the classical completion of a restriction category is given.
26
Peter Freyd · Bulletin of the Australian Mathematical Society · 1972 · 263 citations · Full text
Restriction categories I: categories of partial maps
J.R.B. Cockett, Stephen Lack · Theoretical Computer Science · 2002 · 165 citations · Full text