Suchergebnisse - Higher-type and set recursion theory

Exhaustible sets in higher-type computation von Escardo, Martin

“… We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous …”
Volltext

NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM von HÄMEEN-ANTTILA, MARIA

“… of the Continuum Hypothesis. The idea that recursion on higher types could be used to simulate the limit-building in transfinite recursion seems to originate from Bernays …”
Volltext

Introduction to Ramsey Spaces von Todorcevic, Stevo

“… It is the first book-length treatment of this area of Ramsey theory, and emphasizes applications for related and surrounding fields of mathematics, such as set theory, combinatorics, real …”
Volltext

On Full Abstraction for PCF: I, II, and III von Hyland, J.M.E., Ong, C.-H.L.

“… The approach we have taken is very concrete and in nature goes back to S. C Kleene (1978, in “General Recursion Theory II, Proceedings of the 1977 Oslo Symposium …”
Volltext

Recursion in Higher Types von Kechris, Alexander S., Moschovakis, Yiannis N.

“… Recursion in higher types is an extension of the theory of recursive functions on the integers …”
Volltext

RECURSION OVER CONTINUOUS TYPE STRUCTURES von FENSON, EITAN MOSHE

“… We discuss Kleene-computation and two alternative higher-type computation theories: countable recursion and effective operations …”
Volltext

A lambda calculus for real analysis von Taylor

Volltext

Intersection types and higer-order model checking von Ramsay, Steven J

“… Since, as Ong has shown, the trees defined have a decidable monadic second order theory, recursion schemes have drawn the attention of research in program verification, where they sit naturally …”
Volltext

Intersection types and higer-order model checking von Ramsay, Steven J

“… Since, as Ong has shown, the trees defined have a decidable monadic second order theory, recursion schemes have drawn the attention of research in program verification, where they sit naturally …”
Volltext

Discrete Transfinite Computation Models von Welch, Philip D.

“… This chapter relates such models to classical accounts of higher type recursion theory, going back to Kleene …”
Volltext