ePrints Repository

# Partial Horn logic and cartesian categories

Palmgren, E and Vickers, Steven (2006) Partial Horn logic and cartesian categories. Annals of Pure and Applied Logic, 143 (3). pp. 314-353. ISSN 0168-0072

 PDF (456Kb)

Identification Number/DOI: doi:10.1016/j.apal.2006.10.001

A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the substitution rule has to be modified. It is developed here in its minimal form, with equality and conjunction, as “partial Horn logic”.

Various kinds of logical theory are equivalent: partial Horn theories, “quasi-equational” theories (partial Horn theories without predicate symbols), cartesian theories and essentially algebraic theories.

The logic is sound and complete with respect to models in , and sound with respect to models in any cartesian (finite limit) category.

The simplicity of the quasi-equational form allows an easy predicative constructive proof of the free partial model theorem for cartesian theories: that if a theory morphism is given from one cartesian theory to another, then the forgetful (reduct) functor from one model category to the other has a left adjoint.

Various examples of quasi-equational theory are studied, including those of cartesian categories and of other classes of categories. For each quasi-equational theory another, , is constructed, whose models are cartesian categories equipped with models of . Its initial model, the “classifying category” for , has properties similar to those of the syntactic category, but more precise with respect to strict cartesian functors.

Type of Work: Article 20 November 2006 (Publication) Schools (1998 to 2008) > School of Computer Science Computer Science Q Science (General)QA75 Electronic computers. Computer scienceQA Mathematics University of Birmingham Elsevier 198 YES

Repository Staff Only: item control page