This is an old revision of this page, as edited by JenniferForUnity(talk | contribs) at 19:06, 5 February 2007(Gave the inference rule table borders. Was hard to read before.). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.Revision as of 19:06, 5 February 2007 by JenniferForUnity(talk | contribs)(Gave the inference rule table borders. Was hard to read before.)
HOL Light is a member of the HOL theorem prover family. Like
the other members, it is a proof assistant for classical
higher order logic. Compared with other HOL systems, HOL Light is
intended to have relatively simple foundations.
Logical foundations
HOL Light is based on a formulation of type theory with equality
as the only primitive concept. The primitive rules of inference
are the following:
REFL: reflexivity of equality
TRANS: transitivity of equality
MK_COMB: congruence of equality
ABS: abstraction of equality
BETA: connection of abstraction and function application
ASSUME: assuming , prove
EQ_MP: relation of equality and deduction
DEDUCT_ANTISYM_RULE: deduce equality from 2-way deducibility
INST: instantiate variables in assumptions and conclusion of theorem
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) harvtxt error: no target: CITEREFLambekScott1986 (help).
References
Lambek, J (1986). Introduction to Higher Order Categorical logic. Cambridge University Press. {{cite book}}: Unknown parameter |coauthors= ignored (|author= suggested) (help)