| the scientific landscape |
| representation (models, semantics) |
| logic & reasoning | complexity & metrics | sets & numbers | ||||||||||
|
| meaning
| linguistic glossary |
| components & datatypes | relations | ||||||||||
|
| algebras | ||||||||||||||
|
Location: http://www.cs.mun.ca/~ulf/gloss/meta.html.
By Ulf Schünemann since 2001.
Please mail any comments.
| ||||||||||||||||
Lexical Supposition
I stipulate there is another meta-level supposition mode
by which one refers, neither to the form, sense, nor denotation,
but to the word as a symbol with an identity, traceable through history,
to the word as an element of the lexicon of a language,
i.e., to the lexical word or lexeme.
-> lexical word
No other supposition mode seems to match for the occurence of 'table' in
Table is a Latin loan word.
The same for 'Potenzial' in
Potenzial was spelled Potential in German before the spelling reform.
| Cf. modes of supposition in -> | programming languages |
| Man is a species of animal. | 'Man' is a three-lettered word. | |
| Socrates is a man. | Socrates is a man. | |
|
| ||
| Therefore, Socrates is a species of animal. | Therefore, Socrates is a three-lettered word. |
Alfred Tarski 1935 investigated meta-level statements of the following general scheme [DvR]:
1. Examples of referential transparency:
From [Stansifer]:
«The phrase "referential transparency" was first used by Whitehead and Russel
in Principia Mathematica to compare the following two syllogisms:
...
All men are mortal; Everything Xenophon said about Socrates is true;
Socreates is a man; Xenophon said: "Socrates is mortal";
Therefore Socrates is mortal. So Socrates is mortal. Tully was a Roman.
the word "Tully" may be replaced by "Cicero," which was another name of the same man.
2. Referential opacity based on material supposition: In the phrases
quote in Lisp [RTDU],
and C macros like assert
which apply the ``stringification'' operator '#' to their argument expressions.
3. Other cases of referential opacity: Intension, propositional attitude, etc., may destroy referential transparency (cf. extensionality below).
4. Leibniz's law: «There is ... the general criterion of identity which holds for all entities whatsoever, namely, Leibniz's principle, which states that two entities are the same if and only if they share all their properties (including relations). This law holds for states of affairs as well as for individual things, properties of individual things, classes, etc.» [OntRed 40]
5. The notion of substitutivity: Continuing with [Stansifer]: «We see the same idea reflected in Frege's Über Sinn und Bedeutung:
| The meaning [denotation] of a sentence must remain unchanged when a part of the sentence is replaced by an expression having the same meaning [denotation].» |
Term substitution vs text substitution [my own remark]
12 in calc(12) to yield calc(7 + 5)
is proper term substitution.
However, if calc is the definiens introduced by a nominal definition
whose meaning is defined
through textual substititution of arguments into the definiens
(as it is the case for macros of the programming language C),
then calc can be a referentially opaque context for its arguments:
#define calc(x) (1 * x * 2) calc(12) // value 24 calc(7 + 5) // value 17 |
6. Extensionality/Intensionality: There are some notions similar and/or related to referential transparency, often not clearly distinguished from referential transparency [RTDU]:
7. Definiteness (context-freedom): «We tend to assume automatically that the symbol x in an expression such as 3 x2 + 2 x + 17 stands for the same thing (or has the same value) on each occasion it occurs» [Strachey quoted from RTDU]. Here only those occurences of symbol x are meant which are in the scope of the same definition of x. (This qualification is necessary for languages allowing to introduce the same symbol name several times but only for certain (non-overlapping) parts of the text).
8. Unfoldability of the instantiation of generics (the application of lambda terms): Let f be a generic (a function) with parameter x defined by f(x) = F[x] where F is an expression in which x may occur. Unfoldability means that for all expressions E, the denotation of f(E) is the same as the denotation of F[E] where E has been substituted for x in F.