Harrop formula - Alchetron, The Free Social Encyclopedia

In intuitionistic logic, the Harrop formulae, named after Ronald Harrop, are the class of formulae inductively defined as follows:

Atomic formulae are Harrop, including falsity (⊥);

A ∧ B is Harrop provided A and B are;

¬ F is Harrop for any well-formed formula F ;

F → A is Harrop provided A is, and F is any well-formed formula;

∀ x . A is Harrop provided A is.

By excluding disjunction and existential quantification (except in the antecedent of implication), non-constructive predicates are avoided, which has benefits for computer implementation. From a constructivist point of view, Harrop formulae are "well-behaved." For example, in Heyting arithmetic, Harrop formulae satisfy a classical equivalence not usually satisfied in constructive logic:

A ↔ ¬ ¬ A .

Harrop formulae were introduced around 1956 by Ronald Harrop and independently by Helena Rasiowa. Variations of the fundamental concept are used in different branches of constructive mathematics and logic programming.

Hereditary Harrop formulae and logic programming

A more complex definition of hereditary Harrop formulae is used in logic programming as a generalisation of horn clauses, and forms the basis for the language λProlog. Hereditary Harrop formulae are defined in terms of two (sometimes three) recursive sets of formulae. In one formulation:

Rigid atomic formulae, i.e. constants r or formulae r ( t 1 , . . . , t n ) , are hereditary Harrop;

A ∧ B is hereditary Harrop provided A and B are;

∀ x . A is hereditary Harrop provided A is;

G → A is hereditary Harrop provided A is rigidly atomic, and G is a G-formula.

G-formulae are defined as follows:

Atomic formulae are G-formulae, including truth(⊤);

A ∧ B is a G-formula provided A and B are;

A ∨ B is a G-formula provided A and B are;

∀ x . A is a G-formula provided A is;

∃ x . A is a G-formula provided A is;

H → A is a G-formula provided A is, and H is hereditary Harrop.

References

Harrop formula Wikipedia

(Text) CC BY-SA