Higher-order computability

DOI10.1007/978-3-662-47992-6MaRDI QIDQ3457676zbMATH OpenOpenAlexFDO

Authors 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) Combinatory logic and lambda calculus (03B40) Semantics in the theory of computing (68Q55) Higher-type and set recursion theory (03D65) Type theory (03B38)

Recommendations

• Recursive functionals
• The Foundations of Computability Theory
• scientific article; zbMATH DE number 2204752
• Computing with Functionals—Computability Theory or Computer Science?
• scientific article; zbMATH DE number 1955470

Cited in

(76)

• Splittings and disjunctions in reverse mathematics
• Embeddings between partial combinatory algebras
• Continuous and monotone machines
• Computability theory, nonstandard analysis, and their connections
• Betwixt Turing and Kleene
• Truncation and semi-decidability notions in applicative theories
• Nonflatness and totality
• Asymptotic speedup via effect handlers
• Measure-theoretic uniformity and the Suslin functional
• On the uncountability of \(\mathbb{R}\)
• Formalizing abstract computability: Turing categories in Coq
• Admissibly Represented Spaces and Qcb-Spaces
• Incomputability emergent, and higher type computation
• Computable analysis and notions of continuity in \textsc{Coq}
• Third-Order Computation and Bounded Arithmetic
• The non-normal abyss in Kleene's computability theory
• A game-semantic model of computation
• A Computable Solution to Partee’s Temperature Puzzle
• The strength of compactness in computability theory and nonstandard analysis
• scientific article; zbMATH DE number 3916254 (Why is no real title available?)
• Non-deterministic effects in a realizability model
• A constructive manifestation of the Kleene-Kreisel continuous functionals
• scientific article; zbMATH DE number 2204752 (Why is no real title available?)
• Reverse mathematics and parameter-free transfer
• Exploring the abyss in Kleene's computability theory
• To be or not to be constructive, that is not the question
• Computability and non-monotone induction
• On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
• Computing with Functionals—Computability Theory or Computer Science?
• On the computational properties of the uncountability of the real numbers
• Higher order interpretation for higher order complexity
• The sequential functionals of type \((\iota \rightarrow \iota)^n \rightarrow \iota\) form a \textit{dcpo} for all \(n \in \mathbb N\)
• The recursion hierarchy for PCF is strict
• A density theorem for hierarchies of limit spaces over separable metric spaces
• Fixed point theorems in computability theory
• Computable structure theory of partial combinatory algebras
• On the computational properties of weak continuity notions
• Big in reverse mathematics: the uncountability of the reals
• Third-order functionals on partial combinatory algebras
• Isomorphisms between HEO and HRO^E, ECF and ICF^E
• On the logical and computational properties of the Vitali covering theorem
• Partial combinatory algebra and generalized numberings
• Fixed point theorems for precomplete numberings
• Between Turing and Kleene
• Dynamic game semantics
• Computability models over categories and presheaves
• Apartness, sharp elements, and the Scott topology of domains
• On higher-order cryptography
• Computability structures, simulations and realizability
• The complexity of completions in partial combinatory algebra
• The Grothendieck computability model
• Converse extensionality and apartness
• On sequential theorems in reverse mathematics
• Big in reverse mathematics: measure and category
• A reflection principle for potential infinite models of type theory
• On some computational properties of open sets
• Recursive functionals
• Quantitative continuity and Computable Analysis in Coq
• Higher-order concepts for the potential infinite
• On the mathematical and foundational significance of the uncountable
• Extensions of Scott's graph model and Kleene's second algebra
• Ordinal analysis of partial combinatory algebras
• Sharp elements and apartness in domains
• On the semantics of intensionality
• On the computability of the fan functional
• Well quasi-orders and the functional interpretation
• Exploring mathematical objects from custom-tailored mathematical universes
• Higher order functions and Brouwer's thesis
• Completions of Kleene's second model
• Countable sets versus sets that are countable in reverse mathematics
• Continuous and algebraic domains in univalent foundations
• The computational content of nonstandard analysis
• The machine as data: a computational view of emergence and definability
• Aspects of categorical recursion theory
• Pincherle's theorem in reverse mathematics and computability theory
• Computability in partial combinatory algebras

Describes a project that uses

Uses Software

• Eriskay

This page was built for publication: Higher-order computability

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3457676)