The following pages link to Higher-Order Computability (Q3457676):
Displaying 46 items.
- A constructive manifestation of the Kleene-Kreisel continuous functionals (Q290639) (← links)
- The machine as data: a computational view of emergence and definability (Q514566) (← links)
- Reverse mathematics and parameter-free transfer (Q1634526) (← links)
- Extensions of Scott's graph model and Kleene's second algebra (Q1688948) (← links)
- To be or not to be constructive, that is not the question (Q1688964) (← links)
- Exploring mathematical objects from custom-tailored mathematical universes (Q2080581) (← links)
- Third-order functionals on partial combinatory algebras (Q2105095) (← links)
- Non-deterministic effects in a realizability model (Q2130600) (← links)
- Partial combinatory algebra and generalized numberings (Q2148902) (← links)
- Betwixt Turing and Kleene (Q2151412) (← links)
- Computability models over categories and presheaves (Q2151413) (← links)
- Between Turing and Kleene (Q2151416) (← links)
- Splittings and disjunctions in reverse mathematics (Q2176407) (← links)
- Pincherle's theorem in reverse mathematics and computability theory (Q2304540) (← links)
- Fixed point theorems for precomplete numberings (Q2311209) (← links)
- A game-semantic model of computation (Q2319854) (← links)
- The strength of compactness in computability theory and nonstandard analysis (Q2326415) (← links)
- Formalizing abstract computability: Turing categories in Coq (Q2333325) (← links)
- Higher-order concepts for the potential infinite (Q2682910) (← links)
- A Computable Solution to Partee’s Temperature Puzzle (Q2964003) (← links)
- On the Semantics of Intensionality (Q2988392) (← links)
- A Density Theorem for Hierarchies of Limit Spaces over Separable Metric Spaces (Q2988845) (← links)
- Well Quasi-orders and the Functional Interpretation (Q3295153) (← links)
- (Q4585074) (← links)
- Nonflatness and totality (Q4611200) (← links)
- Incomputability Emergent, and Higher Type Computation (Q4637227) (← links)
- The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ (Q4637682) (← links)
- TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES (Q4692077) (← links)
- COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS (Q4984865) (← links)
- Dynamic game semantics (Q4988428) (← links)
- (Q4989411) (← links)
- Measure-theoretic uniformity and the Suslin functional (Q4995604) (← links)
- Aspects of Categorical Recursion Theory (Q5014598) (← links)
- (Q5015363) (← links)
- ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS (Q5015728) (← links)
- Higher order functions and Brouwer’s thesis (Q5016215) (← links)
- Admissibly Represented Spaces and Qcb-Spaces (Q5024575) (← links)
- Countable sets versus sets that are countable in reverse mathematics (Q5037215) (← links)
- ON THE UNCOUNTABILITY OF (Q5052009) (← links)
- Converse extensionality and apartness (Q5060186) (← links)
- Continuous and monotone machines (Q5089226) (← links)
- COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS (Q5207560) (← links)
- On the Computability of the Fan Functional (Q5214781) (← links)
- On the mathematical and foundational significance of the uncountable (Q5223120) (← links)
- Quantitative continuity and Computable Analysis in Coq (Q5875440) (← links)
- Apartness, sharp elements, and the Scott topology of domains (Q6190408) (← links)