43 ;;Quote: FEA was developed for semantic information retrieval; also used for program assertions and potentially for non-procedural programming

43 ;;Quote: an atom of FEA is a predicate applied to one or more terms; the syntax of a term depends on the base system

43 ;;Quote: FEA formulas may have universal quantifiers, existential quantifiers, or one-and-only-one quantifiers

45 ;;Quote: use tags, punctuation and convention to indicate precedence in natural languages; used in FEA

49 ;;Quote: a definition in math and logic should be nominal; i.e., does not expand the theory or system, for comprehension only

49 ;;Quote: in math, a definition is preceded by an existence theorem, or an axiom/hypothesis that postulates its existence

50 ;;Quote: a definition consists of a context, a definiendum, and its definiens in terms of known concepts

52 ;;Quote: FEA developed for information storage and retrieval of algebraic theorems, definitions, axioms