Categorical logic

Source: Wikipedia, the free encyclopedia.

Categorical logic is the branch of mathematics in which tools and concepts from category theory are applied to the study of mathematical logic. It is also notable for its connections to theoretical computer science.[1] In broad terms, categorical logic represents both syntax and semantics by a category, and an interpretation by a functor. The categorical framework provides a rich conceptual background for logical and type-theoretic constructions. The subject has been recognisable in these terms since around 1970.

Overview

There are three important themes in the categorical approach to logic:

Categorical semantics
Categorical logic introduces the notion of structure valued in a category C with the classical
impredicative theories, such as System F
, is an example of the usefulness of categorical semantics.
It was found that the
adjoint functor, and that the quantifiers were also best understood using adjoint functors.[2]
Internal languages
This can be seen as a formalization and generalization of proof by .
Term-model constructions
In many cases, the categorical semantics of a logic provide a basis for establishing a correspondence between
βη-equational logic over simply typed lambda calculus and Cartesian closed categories. Categories arising from theories via term-model constructions can usually be characterized up to equivalence by a suitable universal property. This has enabled proofs of meta-theoretical properties of some logics by means of an appropriate categorical algebra. For instance, Freyd gave a proof of the disjunction and existence properties of intuitionistic logic
this way.

See also

Notes

  1. ^ Goguen, Joseph; Mossakowski, Till; de Paiva, Valeria; Rabe, Florian; Schroder, Lutz (2007). "An Institutional View on Categorical Logic".
    CiteSeerX 10.1.1.126.2361
    .
  2. ^ Lawvere 1971, Quantifiers and Sheaves

References

Books

Further reading

External links