Pages that link to "Item:Q3260568"
From MaRDI portal
The following pages link to Recursive Functionals and Quantifiers of Finite Types I (Q3260568):
Displaying 50 items.
- Continuity of Gödel's system T definable functionals via effectful forcing (Q265800) (← links)
- Effective moduli from ineffective uniqueness proofs. An unwinding of de La Vallée Poussin's proof for Chebycheff approximation (Q688431) (← links)
- Speed-up theorems in type-2 computations using oracle Turing machines (Q733754) (← links)
- The extensional ordering of the sequential functionals (Q764278) (← links)
- Pointwise hereditary majorization and some applications (Q805612) (← links)
- Characteristics of discrete transfinite time Turing machine models: Halting times, stabilization times, and normal form theorems (Q1004086) (← links)
- Turing oracle machines, online computing, and three displacements in computability theory (Q1032637) (← links)
- Effective topological spaces. I: A definability theory (Q1061121) (← links)
- Reflection and forcing in E-recursion theory (Q1062978) (← links)
- Set recursion and \(\Pi ^ 1_ 2\)-logic (Q1063591) (← links)
- Effective topological spaces. II: A hierarchy (Q1073020) (← links)
- Some modifications of iterated Kleene calculability (Q1097877) (← links)
- Effective topological spaces. III: Forcing and definability (Q1098842) (← links)
- Inadmissible forcing (Q1102950) (← links)
- Kleene computable functionals and the higher order existence property (Q1104319) (← links)
- Generalized computations with oracles (Q1119570) (← links)
- Pre-recursive categories (Q1164127) (← links)
- Effective oracles (Q1191173) (← links)
- Generalized computations over regular enumerations (Q1211984) (← links)
- On computability with functionals (Q1212452) (← links)
- Generalized computability and the descriptive theory of sets (Q1220921) (← links)
- The halt problem and theory of hierarchies (Q1227730) (← links)
- Computational foundations of basic recursive function theory (Q1314348) (← links)
- Interpreting higher computations as types with totality (Q1337495) (← links)
- Power set recursion (Q1346246) (← links)
- A comparison of the indices arising in the transfinite iteration of functions (Q1394223) (← links)
- Towards a computation system based on set theory (Q1825191) (← links)
- A generalized constructable continuum (Q1844659) (← links)
- Some aspects of generalized computability (Q1846417) (← links)
- Polymorphic extensions of simple type structures. With an application to a bar recursive minimization (Q1919547) (← links)
- Computability with two-place oracle (Q1920828) (← links)
- Computation on abstract data types. The extensional approach, with an application to streams (Q1923575) (← links)
- Representations and the foundations of mathematics (Q2134273) (← links)
- Betwixt Turing and Kleene (Q2151412) (← links)
- Between Turing and Kleene (Q2151416) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- The strength of compactness in computability theory and nonstandard analysis (Q2326415) (← links)
- Bounded functional interpretation (Q2488269) (← links)
- Representability in some systems of second order arithmetic (Q2545877) (← links)
- Iterated Kleene computability (Q2639056) (← links)
- On the Cantor–Bendixson rank of a set that is searchable in Gödel’s T (Q2799751) (← links)
- Mathematics, Metaphysics and the Multiverse (Q2891317) (← links)
- Discrete Transfinite Computation (Q2906573) (← links)
- Term extraction and Ramsey's theorem for pairs (Q2915896) (← links)
- R.E. degrees of continuous functionals (Q3043133) (← links)
- On predicates expressible in the $1$-function quantifier forms in Kleene Hierarchy with free variables of type $2$ (Q3276700) (← links)
- Hyperarithmetical Sets (Q3305318) (← links)
- THE RAMIFIED ANALYTICAL HIERARCHY USING EXTENDED LOGICS (Q4961868) (← links)
- On the ‘definability of definable’ problem of Alfred Tarski, Part II (Q5045614) (← links)
- Three topological reducibilities for discontinuous functions (Q5046178) (← links)
