Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423228 | Electronic Notes in Theoretical Computer Science | 2010 | 23 Pages |
Abstract
This paper explores the fine structure of classifying categories of partial equational theories. The central concept is that of unitary category, and results about those are applied to the problem of completing partial algebras to total ones. We also look at the special case of partial combinatory logic and give a characterization of the global sections of the generic PCA.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics