‘Contrariwise,’ continued Tweedledee, ‘if it was so, it might be; and if it were so, it would be; but as it isn’t, it ain’t. That’s logic.’

(Louis Carroll, Through the Looking Glass)



(0,1)(0,1)-Category theory

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-proposition, mere proposition
proofgeneralized elementprogram
cut rulecomposition of classifying morphisms / pullback of display mapssubstitution
cut elimination for implicationcounit for hom-tensor adjunctionbeta reduction
introduction rule for implicationunit for hom-tensor adjunctioneta conversion
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, (idemponent) monadmodal type theory, monad (in computer science)
linear logic(symmetric, closed) monoidal categorylinear type theory/quantum computation
proof netstring diagramquantum circuit
(absence of) contraction rule(absence of) diagonalno-cloning theorem
synthetic mathematicsdomain specific embedded programming language

homotopy levels




Traditionally, as a discipline, logic is the study of correct methods of reasoning. Logicians have principally studied deduction, the process of passing from premises to conclusion in such a way that the truth of the former necessitates the truth of the latter. In other words, deductive logic studies what it is for an argument to be valid. A second branch of logic studies induction, reasoning about how to assess the plausibility of general propositions from observations of their instances. This has often been done in terms of probability theory, particularly Bayesian.

Some philosophers, notably Charles Peirce, considered there to be third variety of reasoning for logic to study, namely, abduction. This is a process whereby one reasons to the truth of an explanation from its ability to account for what is observed. It is therefore sometimes also known as inference to the best explanation. At least some aspects of this can also be studied using Bayesian probability.

Deductive logic is the best developed of the branches. For centuries, treatments of the syllogism were at the forefront of the discipline. In the nineteenth century, however, spurred largely by the needs of mathematics, in particular the need to handle relations and quantifiers, a new logic emerged, known today as predicate logic.

As we said above, logic is traditionally concerned with correct methods of reasoning, and philosophers (and others) have had much to say prescriptively about logic. However, one can also study logic descriptively, taking it to be the study of methods of reasoning, without attempting to determine whether these methods are correct. One may study constructive logic, or a substructural logic, without saying that it should be adopted. Also psychologists study how people actually reason rapidly in situations without full information, such as by the fast and frugal approach.

A logic is a specific method of reasoning. There are several ways to formalise a logic as a mathematical object; see at Mathematical Logic below.

Mathematical logic

Mathematical logic or symbolic logic is the study of logic and foundations of mathematics as, or via, formal systems – theories – such as first-order logic or type theory.

Classical subfields

The classical subfields of mathematical logic are

Categorical logic

By a convergence and unification of concepts that has been named computational trinitarianism, mathematical logic is equivalently incarnated in

  1. type theory

  2. category theory

  3. programming theory

The logical theory that is specified by and specifies a given category 𝒞\mathcal{C} – called its internal logic, see there for more details and also see internal language, syntactic category. – is the one

Hence pure mathematical logic in the sense of the study of propositions is identified with (0,1)-category theory: where one concentrates only on (-1)-truncated objects. Genuine category theory, which is about 0-truncated objects, is the home for logic and set theory, or rather type theory, the 0-truncated objects being the sets/types/h-sets.

For instance,

Generally, (∞,1)-category theory, which is about untruncated objects, is the home for logic and types with a constructive notion of equality, the identity types in homotopy type theory.

See also at categorical model theory.

Entries on logic



Historically, in some philosophical circles ‘logic’ was understood in a broader sense:

On categorical logic

Revised on March 2, 2015 16:32:51 by Urs Schreiber (