Functional representation of preiterative/combinatory formalism

Rok, strany: 2004, 327 - 335

Both formalisms model systems of multi-argument selfmaps closed under composition as well as argument permutation and identification by using abstract algebraic operations for these transformations and substitution. Developed are the additional requirements, for each system, to be representable as a system of concrete selfmaps on some set in which these operations act in the expected way.

ISO 690:

Fleischer, I. 2004. Functional representation of preiterative/combinatory formalism. In Mathematica Slovaca, vol. 54, no.4, pp. 327-335. 0139-9918.

APA:

Fleischer, I. (2004). Functional representation of preiterative/combinatory formalism. Mathematica Slovaca, 54(4), 327-335. 0139-9918.