scientific article; zbMATH DE number 3912368
[For the entire collection see Zbl 0504.00001.] In his June 13, 1977 Oslo address [Generalized recursion theory. II. Proc. 1977 Oslo Symp., Stud. Logic Found. Math. 94, 185-222 (1978; Zbl 0453.03047)] the author proposed an alternative definition of computations in higher types. In a subsequent paper [The Kleene Symp., Proc., Madison/Wis. 1978, Stud. Logic Found. Math. 101, 1-29 (1980; Zbl 0453.03048)] he took steps to develop a certain semantics for his computations and in the present paper this work is continued. A notion of oracle for partial monotone operators is developed and basic properties are shown. The basic idea is that an oracle A will not ask a question of another oracle B unless A finds that an answer may be essential for the answer A will give to a question asked of A. The author overcomes the technical difficulties in working this into a sound definition. In the present paper it is mainly the type-3 oracles that are discussed.
- Some modifications of iterated Kleene calculability
- The sequentially realizable functionals
- A game-semantic model of computation
- scientific article; zbMATH DE number 3983152 (Why is no real title available?)
- Recursion in Kolmogorov's R-operator and the ordinal σ3
- Recursive Functionals and Quantifiers of Finite Types Revisited, V
- scientific article; zbMATH DE number 1354009 (Why is no real title available?)
- Syntax and Semantics in Higher-Type Recursion Theory
- Closed machine-oracle model of the arithmetic of transfinite types
- scientific article; zbMATH DE number 3310899 (Why is no real title available?)
- Recursion in Partial Type‐1 Objects With Well‐Behaved Oracles
- Oracle programming in a higher level language
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 Q3689176)