Realizability and recursive set theory
نویسندگان
چکیده
منابع مشابه
Realizability, Set Theory and Term Extraction
3 Recursive Realizability Interpretations 16 3.1 Abstract Applicative Structure . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16 3.2 Realizability . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 17 3.3 Soundness for IZF . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 20 3.4 Term Extraction . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملRealizability for Constructive Zermelo-Fraenkel Set Theory
Constructive Zermelo-Fraenkel Set Theory, CZF, has emerged as a standard reference theory that relates to constructive predicative mathematics as ZFC relates to classical Cantorian mathematics. A hallmark of this theory is that it possesses a type-theoretic model. Aczel showed that it has a formulae-as-types interpretation in Martin-Löf’s intuitionist theory of types [14, 15]. This paper, thoug...
متن کاملPolynomially Bounded Recursive Realizability
A polynomially bounded recursive realizability, in which the recursive functions used in Kleene’s realizability are restricted to polynomially bounded functions, is introduced. It is used to show that provably total functions of Ruitenburg’s Basic Arithmetic are polynomially bounded (primitive) recursive functions. This sharpens our earlier result where those functions were proved to be primiti...
متن کاملGeneralizing realizability and Heyting models for constructive set theory
This article presents a generalisation of the two main methods for obtaining class models of constructive set theory. Heyting models are a generalisation of the Boolean models for classical set theory which are a kind of forcing, while realizability is a decidedly constructive method that has first been develloped for number theory by Kleene and was later very fruitfully adapted to constructive...
متن کاملRealizability of Concurrent Recursive Programs
We define and study an automata model of concurrent recursive programs. An automaton consists of a finite number of pushdown systems running in parallel and communicating via shared actions. Actually, we combine multi-stack visibly pushdown automata and Zielonka’s asynchronous automata towards a model with an undecidable emptiness problem. However, a reasonable restriction allows us to lift Zie...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1986
ISSN: 0168-0072
DOI: 10.1016/0168-0072(86)90050-3