nLab axiom

Contents

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

logicset theory (internal logic of)category theorytype theory
propositionsetobjecttype
predicatefamily of setsdisplay morphismdependent type
proofelementgeneralized elementterm/program
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
truesingletonterminal object/(-2)-truncated objecth-level 0-type/unit type
falseempty setinitial objectempty type
proposition, truth valuesubsingletonsubterminal object/(-1)-truncated objecth-proposition, mere proposition
logical conjunctioncartesian productproductproduct type
disjunctiondisjoint union (support of)coproduct ((-1)-truncation of)sum type (bracket type of)
implicationfunction setinternal homfunction type
negationfunction set into empty setinternal hom into initial objectfunction type into empty type
universal quantificationindexed cartesian productdependent productdependent product type
existential quantificationindexed disjoint union (support of)dependent sum ((-1)-truncation of)dependent sum type (bracket type of)
logical equivalencebijectionisomorphism/adjoint equivalenceequivalence of types
support setsupport object/(-1)-truncationpropositional truncation/bracket type
n-image of morphism into terminal object/n-truncationn-truncation modality
equalitydiagonal function/diagonal subset/diagonal relationpath space objectidentity type/path type
completely presented setsetdiscrete object/0-truncated objecth-level 2-type/set/h-set
setset with equivalence relationinternal 0-groupoidBishop set/setoid with its pseudo-equivalence relation an actual equivalence relation
equivalence class/quotient setquotientquotient type
inductioncolimitinductive type, W-type, M-type
higher inductionhigher colimithigher inductive type
-0-truncated higher colimitquotient inductive type
coinductionlimitcoinductive type
presettype without identity types
set of truth valuessubobject classifiertype of propositions
domain of discourseuniverseobject classifiertype universe
modalityclosure operator, (idempotent) 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

semantics

Contents

Idea

An axiom is a proposition in logic that a given theory requires to be true: every model of the theory is required to make the axiom hold true. The sense however is that an axiom is a basic true proposition, used to prove other true propositions (the theorems) in the theory.

Definition

Given a language LL (perhaps specified by a signature: a collection of types, function symbols and relation symbols), a theory is the collection of assertions which are derivable (using the rules of deduction of the ambient logic or deductive system) from a given set of assertions, called axioms of the theory. In other words, a theory is generated from a set of axioms, by starting with those axioms and applying rules of deduction, much as terms in an algebraic system may be generated from a set of basic terms by applying operations. Axioms should therefore be considered as presenting a theory; different axiom sets may well give the same theory.

In terms of a deductive system, axioms can be regarded as “rules with zero hypotheses”. The form of such axioms depends on the details of the deductive system used: it could be natural deduction, sequent calculus, a Hilbert system, etc. If we take sequent calculus, for instance, then any collection of sequents written in the given language LL

ϕ xψ \vec{\phi} \vdash_{\vec x} \vec{\psi}

(asserting that “If every proposition ϕ i\phi_i is true in context x\vec{x} then also some ψ i\psi_i is/has to be true”) can be taken as a collection of axioms for some theory. Models of the theory will then be those structures of the language in which the axioms are interpreted as true statements. For example, a model of group theory is a structure in the language of groups for which the group theory axioms hold, which is (of course) a group.

Assuming the deductive system is sound?, every sequent which is the conclusion of a valid sequent deduction, starting from the axioms, will also be true in every model. And if the deductive system is also complete, then every sequent of the language which is true in every model will in fact be provable from the axioms.

Examples

(…)

(…)

References

For instance def. D1.1.6 in

Last revised on October 30, 2022 at 14:48:21. See the history of this page for a list of all contributions to it.