Hostname: page-component-74656f9884-rdgjk Total loading time: 0 Render date: 2026-11-09T02:58:07.588Z Has data issue: false hasContentIssue false

Boolean and classical restriction categories

Published online by Cambridge University Press:  01 April 2009

ROBIN COCKETT
Affiliation:
Department of Computer Science, University of Calgary, Calgary, T2N 1N4, Alberta, Canada
ERNIE MANES
Affiliation:
Department of Mathematics and Statistics, University of Massachusetts, Amherst, Massachusetts 01003, U.S.A.
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

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.

Information

Type
Paper
Copyright
Copyright © Cambridge University Press 2009