@misc{Lexicon of Arguments,
title = {Quotation from: Lexicon of Arguments – Concepts - Ed. Martin Schulz, 28 Mar 2024},
author = {Stechow,Arnim von},
subject = {Lambda-Abstraction},
note = {48
Lambda notation: [λx: f. g]. - E.g. if g is a sentence: - the function f, such that for any x that satisfies f : f (x) = 1 if g is true, 0 if g is false.
161
Lambda abstraction: returns the value sequence of a function.
Lambda-bound variables: have no reference. - The variable in the lambda operator is neither bound nor free.
>Lambda calculus, >Variables, >Bound variable, >Free variable, >Reference,
>Operators, >Functions, >Value progression.},