Higher-Order Computability

DOI10.1007/978-3-662-47992-6zbMath1471.03002OpenAlexW2293460502MaRDI QIDQ3457676

John Longley, Dag Normann

Publication date: 16 December 2015

Published in: Theory and Applications of Computability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-47992-6

zbMATH Keywords

computability theorymathematical logiccomputability at higher types

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Semantics in the theory of computing (68Q55) Combinatory logic and lambda calculus (03B40) Higher-type and set recursion theory (03D65) Type theory (03B38)

Related Items (49)

Countable sets versus sets that are countable in reverse mathematics ⋮ Non-deterministic effects in a realizability model ⋮ A constructive manifestation of the Kleene-Kreisel continuous functionals ⋮ ON THE UNCOUNTABILITY OF ⋮ Reverse mathematics and parameter-free transfer ⋮ Converse extensionality and apartness ⋮ Partial combinatory algebra and generalized numberings ⋮ Betwixt Turing and Kleene ⋮ Computability models over categories and presheaves ⋮ Between Turing and Kleene ⋮ Splittings and disjunctions in reverse mathematics ⋮ Unnamed Item ⋮ Extensions of Scott's graph model and Kleene's second algebra ⋮ To be or not to be constructive, that is not the question ⋮ Higher-order concepts for the potential infinite ⋮ The non-normal abyss in Kleene's computability theory ⋮ Embeddings between partial combinatory algebras ⋮ On the computational properties of the uncountability of the real numbers ⋮ A Computable Solution to Partee’s Temperature Puzzle ⋮ Apartness, sharp elements, and the Scott topology of domains ⋮ Nonflatness and totality ⋮ Unnamed Item ⋮ On the Semantics of Intensionality ⋮ A Density Theorem for Hierarchies of Limit Spaces over Separable Metric Spaces ⋮ Well Quasi-orders and the Functional Interpretation ⋮ Quantitative continuity and Computable Analysis in Coq ⋮ Incomputability Emergent, and Higher Type Computation ⋮ The machine as data: a computational view of emergence and definability ⋮ TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ Unnamed Item ⋮ On the Computability of the Fan Functional ⋮ Pincherle's theorem in reverse mathematics and computability theory ⋮ On the mathematical and foundational significance of the uncountable ⋮ Continuous and monotone machines ⋮ Fixed point theorems for precomplete numberings ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ Dynamic game semantics ⋮ A game-semantic model of computation ⋮ The sequential functionals of type $(\iota \rightarrow \iota)^n \rightarrow \iota$ form a dcpo for all $n \in \Bbb N$ ⋮ Measure-theoretic uniformity and the Suslin functional ⋮ The strength of compactness in computability theory and nonstandard analysis ⋮ Exploring mathematical objects from custom-tailored mathematical universes ⋮ Formalizing abstract computability: Turing categories in Coq ⋮ Aspects of Categorical Recursion Theory ⋮ ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS ⋮ Higher order functions and Brouwer’s thesis ⋮ Third-order functionals on partial combinatory algebras ⋮ Admissibly Represented Spaces and Qcb-Spaces

Uses Software

• Eriskay

This page was built for publication: Higher-Order Computability