Books on Amazon
|Compositionality||Berka I 478
composed / statement / complex /propositional function/p.f./ Tarski: composite statements need not be connections of simpler statements - which applies only to propositional functions (p.f.) - compositionality: Only for p.f., not for statements? - Problem: then a "reconstruction" of operators does not lead to the truth or falsity of a given statement - reason: because we get statements as certain special cases of p.f. - solution: performance - scheme: for every a - a complies with the p.f. x iff. p - Example A fulfilled the p.f. "x is white ’iff. A is white - then particularly snow fulfills the p.f. "x is white" - ((s) because fulfillment is precisely related to p.f. and not to statements).
Logic, Semantics, Metamathematics: Papers from 1923-38 Indianapolis 1983
K. Berka/L. Kreiser
Logik Texte Berlin 1983