|Lambda Calculus, philosophy: The lambda calculus provides a way to avoid problems related to paradoxes, since, unlike the quantification of predicate logic, it does not make any existence assumptions. Where the quantification (Ex)(Fx) is translated colloquially as "There is an x with the property F" (in short "Something is F"), the translation of the corresponding form in the Lambda calculus is "An x, so that...". See also 2nd order logic._____________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. |
Books on Amazon
Lamdaoperator/abstraction operator/Prior: is not equivalent with abstract nouns. It does not refer to properties, for it cannot replace the name variable. - ((s) Adjunction of characteristics.)
No problem: "something φ-s or ψ-s" - but not
"the property of φ-ing-or-ψ-ing" as an abstract entity.
Solution: "A v C "(either A-ing or C-ing" - not an abstract noun, but complex verb that forms a sentence - LO is necessary if one wants to formulate laws on propositions._____________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.
Objects of thought Oxford 1971
Arthur N. Prior
Papers on Time and Tense 2nd Edition Oxford 2003