Finn Lawler empty 7 (Rev #1, changes)

Showing changes from revision #0 to #1: Added | Removed | Changed

Contents

We’ll roughly follow the Elephant and Seely. The following is all entirely standard and here only to fix notation and terminology.

Type theory

A signature is a collection X,Y,X, Y, \ldots of types, together with function symbols f:XYf \colon \vec X \to Y and relation symbols RXR \subset \vec X, where X\vec X is a finite list X 1,X 2,,X nX_1, X_2, \ldots, X_n of types.

For each sort XX there should be an inexhaustible supply of fresh variables of sort XX. A context is a finite list x\vec x of variables, and the sort of a context is the list X\vec X of the sorts of the variables in it.

A term of sort XX is either a variable of xx of sort XX or an expression of the form f(t 1,t 2,,t n)f(t_1, t_2, \ldots, t_n) where f:Y 1,Y 2,,Y nXf \colon Y_1, Y_2, \ldots, Y_n \to X and each t it_i is a term of sort Y iY_i. The free variables of a term are precisely the variables that appear in it.

Formulas

The formulas of regular logic are built up from the atomic formulas R(t)R(\vec t) (where the sort of t\vec t is the sort of RR) and t= Xst =_X s (where tt and ss are terms of sort XX) using \top (true), \wedge (conjunction) and \exists. The free variables of a formula are defined in the usual way. A context x\vec x is suitable for a formula ϕ\phi (term tt) if the free variables of ϕ\phi (tt) are contained in x\vec x. A formula ϕ\phi (term tt) taken in some suitable context x\vec x will be written ϕ[x]\phi[\vec x] (t[x]t[\vec x]), and ϕ\phi by itself will often mean ϕ[FV(ϕ)]\phi[FV(\phi)], with the free variables FV(ϕ)FV(\phi) in some canonical order.

The substitution ϕ[t/x]\phi[\vec t / \vec x] of the terms t\vec t for the variables x\vec x is defined as usual, as is the substitution t[s/x]t[\vec s / \vec x].

Logic

A sequent (wrt a given signature) is an expression ϕ xψ\phi \vdash_{\vec x} \psi where the context x\vec x is suitable for both ϕ\phi and ψ\psi. A theory is a set of sequents (over the same signature, obviously).

The inference rules of regular logic are the usual ones, including these

ϕ xϕ(Axiom)ϕ xψψ xχϕ xχ(Cut) \frac{}{\phi \vdash_{\vec x} \phi} \text{(Axiom)} \qquad\qquad \frac{\phi \vdash_{\vec x} \psi \qquad \psi \vdash_{\vec x} \chi}{\phi \vdash_{\vec x} \chi} \text{(Cut)}
ϕ xψϕ[t/x] yψ[t/x](Substitution) \frac{\phi \vdash_{\vec x} \psi}{\phi[\vec t/ \vec x] \vdash_{\vec y} \psi[\vec t / \vec x]} \text{(Substitution)}

where y\vec y contains the variables of the terms t\vec t. The other rules are as in Seely. We also have to add the Frobenius axiom ϕy.ψ xy.(ϕψ)\phi \wedge \exists y. \psi \vdash_{\vec x} \exists y.(\phi \wedge \psi), where yy is not in x\vec x.

Proofs are considered up to the rewrites given in Seely and Prawitz, together with those making the Frobenius axiom the two-sided inverse to the usual proof of the converse (see e.g. Elephant p. 832).

Models

Models of regular theories are regular fibrations.

If p:EBp \colon E \to B is a regular fibration, then an interpretation II of a signature assigns

  • to each sort XX an object IXI X of BB

  • to each list X=X 1,X 2,,X n\vec X = X_1, X_2, \ldots, X_n of sorts the product IX=IX 1×IX 2××IX nI \vec X = I X_1 \times I X_2 \times \cdots \times I X_n

  • to each function symbol f:XYf \colon \vec X \to Y a morphism If:IXIYI f \colon I \vec X \to I Y in BB

  • to each relation symbol RXR \subset \vec X an object IRI R in E IXE_{I \vec X} (the fibre of pp over IXI \vec X)

Given an interpretation of a signature, terms and formulas over it are given the following meanings:

  • I(x i[x])=π i:Π jX jX iI (x_i[\vec x]) = \pi_i \colon \Pi_j X_j \to X_i.

  • If(t 1,t 2,,t n)=If(It 1,It 2,,It n)I f(t_1, t_2, \ldots, t_n) = I f \circ (I t_1, I t_2, \ldots, I t_n).

  • IR(t 1,t 2,,t n)=(It i) i *IRI R(t_1, t_2, \ldots, t_n) = (I t_i)_i^* I R, where (It i) i(I t_i)_i is the pairing of the meanings of the t it_i.

  • I(x= Xx)= Δ IXI(x =_{\vec X} x') = \exists_{\Delta_{I \vec X}} \top, where Δ IX:IXIX×IX\Delta_{I \vec X} \colon I \vec X \to I \vec X \times I \vec X is the diagonal.

  • \top and \wedge are interpreted by the finite products in EE, of course, and \exists by the left adjoints π\exists_\pi to product projections π\pi.

An interpretation II satisfies a sequent S=ϕ xψS = \phi \vdash_{\vec x} \psi, written ISI \models S, if there is a vertical morphism IϕIψI \phi \to I \psi over IXI \vec X where X\vec X is the sort of x\vec x.

An interpretation is a model of a theory, written ITI \models T, if it satisfies each sequent contained in the theory.

Soundness Theorem

If a theory TT proves a sequent SS, then for any model II of TT, ISI \models S.

Proof

Revision on February 2, 2011 at 16:51:51 by Finn Lawler?. See the history of this page for a list of all contributions to it.