|Formal language: a language that usually consist of a set of symbols (icons for a defined domain of objects) and rules regarding their linkage. Purposes of formalization are brevity, uniqueness and versatility in applications like programming, automation, mathematics et al. See also domains, symbols, signs, language, recursion, rules, systems._____________Annotation: The above characterizations of concepts are neither definitions nor exhausting presentations of problems related to them. Instead, they are intended to give a short introduction to the contributions below. – Lexicon of Arguments. |
Benson Mates on Formal Language - Dictionary of Arguments
Artificial language/formal/counterpart/Mates: the statement forms of the natural language comply with formulas of the artificial, namely as a counterpart, not as abbreviations - if symbols are not assigned to meaning, then "uninterpreted calculus".
artificial language L/Mates: E.g. statement j: always true in relation to an interpretation I - values of "j": statements of the language L - values of I: interpretations of L.
_____________Explanation of symbols: Roman numerals indicate the source, arabic numerals indicate the page number. The corresponding books are indicated on the right hand side. ((s)…): Comment by the sender of the contribution. Translations: Dictionary of Arguments The note [Author1]Vs[Author2] or [Author]Vs[term] is an addition from the Dictionary of Arguments. If a German edition is specified, the page numbers refer to this edition.
Elementare Logik Göttingen 1969
Skeptical Essays Chicago 1981