ThesaHelp: references pr
Group: information retrieval
Topic: requirement specification by assertion
Topic: descriptive languages
Topic: function application
Topic: quantified repetition
Topic: operator precedence
Topic: definition
Topic: symbolic manipulation of formulas
 
Reference
Postma, S.W.,
"FEA* A formal English subset of algebra/assertions",
SIGPLAN, 13, 7, pp. 4359, July 1978.
Google
Quotations
43 ;;Quote: FEA was developed for semantic information retrieval; also used for program assertions and potentially for nonprocedural 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 oneandonlyone 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

Related Topics
ThesaHelp: references pr (245 items)
Group: information retrieval (25 topics, 662 quotes)
Topic: requirement specification by assertion (28 items)
Topic: descriptive languages (22 items)
Topic: function application (18 items)
Topic: quantified repetition (11 items)
Topic: operator precedence (13 items)
Topic: definition (16 items)
Topic: symbolic manipulation of formulas (12 items)
