Computability and non-monotone induction

DOI10.3233/COM-200321MaRDI QIDQ6594831

Dag Normann

Publication date: 29 August 2024

Published in: Computability (Search for Journal in Brave)

zbMATH Keywords

sequential proceduresKleene computabilityreflection propertiesnon-monotone induction

Mathematics Subject Classification ID

Computability and recursion theory (03Dxx)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Computations in higher types
• LCF considered as a programming language
• A type-theoretical alternative to ISWIM, CUCH, OWHY
• Functionals of type 3 as realisers of classical theorems in analysis
• Betwixt Turing and Kleene
• Higher type recursion for transfinite machine theory
• Pincherle's theorem in reverse mathematics and computability theory
• The strength of compactness in computability theory and nonstandard analysis
• Turing's legacy. Developments from Turing's ideas in logic
• Recursive Functionals and Quantifiers of Finite Types I
• The countably based functionals
• Higher-Order Computability
• Infinite time Turing machines
• The Axiom of Choice in computability theory and Reverse Mathematics with a cameo for the Continuum Hypothesis
• ON THE UNCOUNTABILITY OF
• Open sets in computability theory and reverse mathematics
• COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS
• On the mathematical and foundational significance of the uncountable
• Hyperanalytic Predicates
• On the computational properties of basic mathematical notions
• On some points in the theory of functions.
• On robust theorems due to Bolzano, Weierstrass, Jordan, and Cantor

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)