scientific article; zbMATH DE number 1169381
\textit{Georg Kreisel} stated in his paper ``Interpretation of analysis by means of constructive functionals of finite types [in: A. Heyting (ed.), Constructivity in mathematics, Proc. Colloq. Amsterdam 1957, 101-128 (1959; Zbl 0134.01001)] two important theorems of the theory of partial and total continuous higher order functionals: the \textit{density theorem} saying that any finite functional can be extended to a total one, and the \textit{choice principle for total continuous functionals}, ``which says that whenever for any total \(x\) there is a total \(y\) such that \(Rxy\), where the relation \(R\) is given by a total Boolean-valued functional, then this dependency can be realized by a total functional \(f\) (which can be found uniformly in \(R\)) (p. 335). The paper under review gives ``complete proofs of the density theorem and the choice principle for total continuous functionals in the natural and concrete context of the partial continuous functionals [\dots], especially by specializing more general treatments in the literature (p. 336). The proofs also yield effective versions of these theorems. They are built on the basic idea of information systems. An information system is defined to be the structure \((A, \text{Con}, \vdash)\) with \(A\) being a countable set (the tokens), Con being a nonempty set of finite subsets of \(A\) (the consistent sets) and \(\vdash\) being the entailment relation (p. 337). For the entire collection see [Zbl 0894.03002].
- Characterizing the continuous functionals
- scientific article; zbMATH DE number 1405571
- scientific article; zbMATH DE number 4114632
- scientific article; zbMATH DE number 4114613
- The predicate completion of a partial information system
- An intuitionistic version of Zermelo's proof that every choice set can be well-ordered
- scientific article; zbMATH DE number 1302490
- Recursive functionals
- scientific article; zbMATH DE number 90270
- Sur les fonctions croissantes et les fonctions entières.
- Towards a formal theory of computability
- Internal Density Theorems for Hierarchies of Continuous Functionals
- Nonflatness and totality
- scientific article; zbMATH DE number 3996468 (Why is no real title available?)
- scientific article; zbMATH DE number 1405571 (Why is no real title available?)
- Applications of the Kleene-Kreisel density theorem to theoretical computer science
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4397033)