Výsledky vyhľadávania - Higher-type and set recursion theory

Exhaustible sets in higher-type computation Autor 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…”
Získať plný text

NOMINALISTIC ORDINALS, RECURSION ON HIGHER TYPES, AND FINITISM Autor 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…”
Získať plný text

Introduction to Ramsey Spaces Autor 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…”
Získať plný text

On Full Abstraction for PCF: I, II, and III Autor 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…”
Získať plný text

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

“…Recursion in higher types is an extension of the theory of recursive functions on the integers…”
Získať plný text

RECURSION OVER CONTINUOUS TYPE STRUCTURES Autor FENSON, EITAN MOSHE

“… We discuss Kleene-computation and two alternative higher-type computation theories: countable recursion and effective operations…”
Získať plný text

A lambda calculus for real analysis Autor Taylor

Získať plný text

Intersection types and higer-order model checking Autor 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…”
Získať plný text

Intersection types and higer-order model checking Autor 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…”
Získať plný text

Discrete Transfinite Computation Models Autor Welch, Philip D.

“… This chapter relates such models to classical accounts of higher type recursion theory, going back to Kleene…”
Získať plný text