Recursive Functionals and Quantifiers of Finite Types I
From MaRDI portal
Publication:3260568
DOI10.2307/1993145zbMath0088.01301OpenAlexW4229611399MaRDI QIDQ3260568
Publication date: 1959
Published in: Transactions of the American Mathematical Society (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/1993145
Related Items (73)
Continuity of Gödel's system T definable functionals via effectful forcing ⋮ Mathematics, Metaphysics and the Multiverse ⋮ Interpreting higher computations as types with totality ⋮ On the ‘definability of definable’ problem of Alfred Tarski, Part II ⋮ Three topological reducibilities for discontinuous functions ⋮ Representations and the foundations of mathematics ⋮ Measure theory and higher order arithmetic ⋮ ON THE UNCOUNTABILITY OF ⋮ Power set recursion ⋮ Some modifications of iterated Kleene calculability ⋮ Effective topological spaces. III: Forcing and definability ⋮ Iterated Kleene computability ⋮ Inadmissible forcing ⋮ Betwixt Turing and Kleene ⋮ Between Turing and Kleene ⋮ Kleene computable functionals and the higher order existence property ⋮ Term extraction and Ramsey's theorem for pairs ⋮ Unnamed Item ⋮ Generalized computations with oracles ⋮ Polymorphic extensions of simple type structures. With an application to a bar recursive minimization ⋮ Computability with two-place oracle ⋮ Computation on abstract data types. The extensional approach, with an application to streams ⋮ Hyperanalytic Predicates ⋮ A comparison of the indices arising in the transfinite iteration of functions ⋮ Discrete Transfinite Computation ⋮ Internal Density Theorems for Hierarchies of Continuous Functionals ⋮ The non-normal abyss in Kleene's computability theory ⋮ Syntax and Semantics in Higher-Type Recursion Theory ⋮ On the computational properties of the uncountability of the real numbers ⋮ Hierarchies of Effective Descriptive Set Theory ⋮ A Hierarchy Based on a Type Two Object ⋮ Pre-recursive categories ⋮ On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$ ⋮ Theses for Computation and Recursion on Concrete and Abstract Structures ⋮ Hyperarithmetical Sets ⋮ Effective oracles ⋮ Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation ⋮ Effective operations of type 2 in PCAs ⋮ Generalized computations over regular enumerations ⋮ On computability with functionals ⋮ Bounded functional interpretation ⋮ On the ubiquity of certain total type structures ⋮ Generalized computability and the descriptive theory of sets ⋮ R.E. degrees of continuous functionals ⋮ The halt problem and theory of hierarchies ⋮ General logical metatheorems for functional analysis ⋮ On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T ⋮ Speed-up theorems in type-2 computations using oracle Turing machines ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems ⋮ THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS ⋮ Feferman on Computability ⋮ On the Computability of the Fan Functional ⋮ Representability in some systems of second order arithmetic ⋮ The extensional ordering of the sequential functionals ⋮ Turing oracle machines, online computing, and three displacements in computability theory ⋮ Towards a computation system based on set theory ⋮ A game-semantic model of computation ⋮ Measure-theoretic uniformity and the Suslin functional ⋮ The strength of compactness in computability theory and nonstandard analysis ⋮ A generalized constructable continuum ⋮ Some aspects of generalized computability ⋮ A SCHEMATIC DEFINITION OF QUANTUM POLYNOMIAL TIME COMPUTABILITY ⋮ Aspects of Categorical Recursion Theory ⋮ Effective topological spaces. I: A definability theory ⋮ The theory of recursive functions, approaching its centennial ⋮ Reflection and forcing in E-recursion theory ⋮ Set recursion and \(\Pi ^ 1_ 2\)-logic ⋮ Computational foundations of basic recursive function theory ⋮ Pointwise hereditary majorization and some applications ⋮ La théorie des fonctions récursives et ses applications. (Exposé d'information générale) ⋮ Constructive transfinite number classes ⋮ Effective topological spaces. II: A hierarchy
This page was built for publication: Recursive Functionals and Quantifiers of Finite Types I
