Math 2.0

Mathematical logic and foundations Definition

Internal language

Builds on ToposSubobject classifierExponential objectProductPullback

Definition

Let ℰ\mathcal{E} be a topos with subobject classifier ⊤ ⁣:1→Ω\top \colon 1 \to \Omega, and write PXPX for the exponential object ΩX\Omega^X. The internal language (Mitchell–Bénabou language) of ℰ\mathcal{E} is the typed language described as follows.

  1. The types are the objects of ℰ\mathcal{E}; the type of a product X×YX \times Y is the product type, and PXPX is the power type of XX.
  2. There are variables of each type, and each morphism f ⁣:X→Yf \colon X \to Y is a function symbol from type XX to type YY.
  3. Terms are built from variables by function symbols and by pairing ⟨σ,τ⟩\langle \sigma, \tau \rangle. For terms σ,τ\sigma, \tau of the same type, σ=τ\sigma = \tau is a term of type Ω\Omega. For σ\sigma of type XX and τ\tau of type PXPX, the membership σ∈τ\sigma \in \tau is a term of type Ω\Omega. For a term φ\varphi of type Ω\Omega, the comprehension {x∈X∣φ}\set{x \in X \mid \varphi} is a term of type PXPX.
  4. A formula is a term of type Ω\Omega.

A term τ\tau of type YY whose free variables are x1:X1,…,xn:Xnx_1 : X_1, \dots, x_n : X_n is interpreted as a morphism X1×⋯×Xn→YX_1 \times \cdots \times X_n \to Y. Variables are interpreted by projections, function symbols by composition, σ=τ\sigma = \tau by the characteristic morphism of the diagonal Y→Y×YY \to Y \times Y, and σ∈τ\sigma \in \tau by the evaluation morphism X×PX→ΩX \times PX \to \Omega. A formula φ\varphi is valid in ℰ\mathcal{E} when its interpretation equals ⊤\top composed with the unique morphism X1×⋯×Xn→1X_1 \times \cdots \times X_n \to 1.

Remarks

The connectives ∧,∨,⇒,¬\wedge, \vee, \Rightarrow, \neg and the quantifiers ∀,∃\forall, \exists are definable from equality, membership and comprehension; on subobjects they act as the Heyting algebra operations and as the adjoints to pullback. The valid formulas are closed under the rules of higher-order intuitionistic logic, but not in general under the law of excluded middle. Example: in 𝐒𝐞𝐭\mathbf{Set}, a formula is valid exactly when it is true for all values of its variables in the usual sense. Example: a morphism f ⁣:X→Yf \colon X \to Y is a monomorphism exactly when the formula ∀x,x′∈X (f(x)=f(x′)⇒x=x′)\forall x, x' \in X\, (f(x) = f(x') \Rightarrow x = x') is valid. Non-example: in the topos Sh(ℝ)\mathrm{Sh}(\R) of sheaves on the real line, the formula ∀p∈Ω (p∨¬p)\forall p \in \Omega\, (p \vee \neg p) is not valid, so excluded middle is not part of the internal logic.

Reading path

To understand this page from the ground up, read these 6 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Exponential object concept
  2. Product concept
  3. Pullback concept
  4. Subobject classifier concept
  5. Topos concept
  6. Internal language definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Categorical_logic
About this page
Tag3CJ8XA1VAB
URIm2://3CJ8XA1VAB
Kinddefinition
WritingW0 stub
MSC03G30, 18B25, 03B38
DefinesInternal language
UsesTopos, Subobject classifier, Exponential object, Product, Pullback
Changed2 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)
  • a source with a locator (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.