nLab
Horn theory

Context

Type theory

natural deduction metalanguage, practical foundations

  1. type formation rule
  2. term introduction rule
  3. term elimination rule
  4. computation rule

type theory (dependent, intensional, observational type theory, homotopy type theory)

syntax object language

computational trinitarianism = propositions as types +programs as proofs +relation type theory/category theory

logiccategory theorytype theory
trueterminal object/(-2)-truncated objecth-level 0-type/unit type
falseinitial objectempty type
proposition(-1)-truncated objecth-level 1-type/h-prop
proofgeneralized elementprogram
conjunctionproductproduct type
disjunctioncoproduct ((-1)-truncation of)sum type (bracket type of)
implicationinternal homfunction type
negationinternal hom into initial objectfunction type into empty type
universal quantificationdependent productdependent product type
existential quantificationdependent sum ((-1)-truncation of)dependent sum type (bracket type of)
equivalencepath space objectidentity type
equivalence classquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
completely presented setdiscrete object/0-truncated objecth-level 2-type/preset/h-set
setinternal 0-groupoidBishop set/setoid
universeobject classifiertype of types
modalityclosure operator monadmodal type theory, monad (in computer science)

homotopy levels

semantics

(0,1)-Category theory

Contents

Idea

A Horn theory is a theory in which every axiom has a certain special form.

Definition

Let Σ be a signature. A term of Σ is an expression built out of variables and function symbols. (For example, xy 1z is a term in the language of groups.) An atomic formula relative to Σ is a formula that consists of a relation symbol of Σ (including equality) applied to terms.

A Horn clause is a logical expression of the form

ϕ 1ϕ nϕ\phi_1 \wedge \ldots \wedge \phi_n \vdash \phi

where each ϕ i and ϕ is atomic. A (universal) Horn theory is a theory in which every axiom is a Horn clause.

Revised on August 25, 2012 21:44:45 by Urs Schreiber (82.113.106.150)