Computability and non-monotone induction
From MaRDI portal
Cites work
- A type-theoretical alternative to ISWIM, CUCH, OWHY
- Betwixt Turing and Kleene
- Computability theory, nonstandard analysis, and their connections
- Computations in higher types
- Functionals of type 3 as realisers of classical theorems in analysis
- Higher type recursion for transfinite machine theory
- Higher-order computability
- scientific article; zbMATH DE number 3685474 (Why is no real title available?)
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 3456919 (Why is no real title available?)
- scientific article; zbMATH DE number 3477148 (Why is no real title available?)
- scientific article; zbMATH DE number 3497881 (Why is no real title available?)
- scientific article; zbMATH DE number 3445235 (Why is no real title available?)
- scientific article; zbMATH DE number 2236640 (Why is no real title available?)
- Hyperanalytic Predicates
- Infinite time Turing machines
- LCF considered as a programming language
- On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor
- On some points in the theory of functions.
- On the computational properties of basic mathematical notions
- On the mathematical and foundational significance of the uncountable
- On the uncountability of \(\mathbb{R}\)
- Open sets in computability theory and reverse mathematics
- Pincherle's theorem in reverse mathematics and computability theory
- Recursive Functionals and Quantifiers of Finite Types I
- The axiom of choice in computability theory and reverse mathematics with a cameo for the continuum hypothesis
- The countably based functionals
- The strength of compactness in computability theory and nonstandard analysis
- Turing's legacy. Developments from Turing's ideas in logic
This page was built for publication: Computability and non-monotone induction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6594831)
