HOL Light - Logical Foundations

Logical Foundations

HOL Light is based on a formulation of type theory with equality as the only primitive notion. The primitive rules of inference are the following:

REFL reflexivity of equality
\cfrac{\Gamma \vdash s = t \qquad \Delta \vdash t = u} {\Gamma \cup \Delta \vdash s = u} TRANS transitivity of equality
\cfrac{\Gamma \vdash f = g \qquad \Delta \vdash x = y} {\Gamma \cup \Delta \vdash f(x) = g(y)} MK_COMB congruence of equality
\cfrac{\Gamma \vdash s = t}{\Gamma \vdash (\lambda x. s) = (\lambda x. t)} ABS abstraction of equality ( must not be free in )
\cfrac{\qquad}{\vdash (\lambda x. t) x = t} BETA connection of abstraction and function application
\cfrac{\qquad }{ \{p\} \vdash p} ASSUME assuming, prove
\cfrac{\Gamma \vdash p = q \qquad \Delta \vdash p} {\Gamma \cup \Delta \vdash q} EQ_MP relation of equality and deduction
\cfrac{\Gamma \vdash p \qquad \Delta \vdash q} {(\Gamma - \{q\}) \cup (\Delta - \{p\}) \vdash p = q} DEDUCT_ANTISYM_RULE deduce equality from 2-way deducibility
\cfrac{\Gamma \vdash p} {\Gamma \vdash p} INST instantiate variables in assumptions and conclusion of theorem
\cfrac{\Gamma \vdash p} {\Gamma \vdash p} INST_TYPE instantiate type variables in assumptions and conclusion of theorem

This formulation of type theory is very close to the one described in section II.2 of Lambek & Scott (1986).

Read more about this topic:  HOL Light

Famous quotes containing the words logical and/or foundations:

    “A picture whose pictorial form is logical form is called a logical picture.”
    —Ludwig Wittgenstein (1889–1951)

    “For me, it is as though at every moment the actual world had completely lost its actuality. As though there was nothing there; as though there were no foundations for anything or as though it escaped us. Only one thing, however, is vividly present: the constant tearing of the veil of appearances; the constant destruction of everything in construction. Nothing holds together, everything falls apart.”
    —Eugène Ionesco (b. 1912)