Map
Index
Random
Help
Quotes
Subtopics
Referenced
th

QuoteRef: postSW7_1978

all references > ThesaHelp: references p-r


--topics--
information retrieval
definition
definition
definition
descriptive languages
function application
hypothetical truth
mathematical proof
mathematics as a formal system
operator precedence
quantified repetition
requirement specification by assertion
symbolic manipulation of formulas

--subtopics--
axiom
axiom
definition as abbreviation
examples
formula manipulation
function as operator over operands
known to unknown
mathematical definition
natural language precedence
quantifiers in programs
role of definitions
semantic information
words convey meaning

--referenced--
ACM references m-z

Reference

Postma, S.W., "FEA* A formal English subset of algebra/assertions," SIGPLAN, 13.7:43-59, July 1978

Quotes up

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

Collected barberCB 1980
Copyright © 2002-2023 by C.B. Barber
Thesa, Avev, and thid-... are trademarks of C.B. Barber