On the computational properties of basic mathematical notions

DOI10.1093/LOGCOM/EXAC075MaRDI QIDQ5872876zbMATH OpenOpenAlexFDO

Authors Sam Sanders, Dag Normann

Publication date 4 January 2023

Published in Journal Of Logic And Computation (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/2203.05250

zbMATH Keywords

bounded variationhigher-order computability theoryKleene S1--S9partialityregulated functions

Mathematics Subject Classification ID

Mathematical logic and foundations (03-XX) Computer science (68-XX)

Recommendations

• On the computational properties of the uncountability of the real numbers
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions
• Computability on continuous, lower semi-continuous and upper semi-continuous real functions
• The countably based functionals
• Real number computability and domain theory

Cited in

(15)

• Betwixt Turing and Kleene
• On the uncountability of \(\mathbb{R}\)
• scientific article; zbMATH DE number 3322506 (Why is no real title available?)
• The non-normal abyss in Kleene's computability theory
• On the computational properties of the uncountability of the real numbers
• Exploring the abyss in Kleene's computability theory
• Computability and non-monotone induction
• Big in reverse mathematics: measure and category
• On some computational properties of open sets
• The biggest five of reverse mathematics
• Sometimes tame, sometimes wild: weak continuity
• On the computational properties of weak continuity notions
• Big in reverse mathematics: the uncountability of the reals
• Approximation theorems throughout reverse mathematics
• On the computational properties of ambivalent sets and functions

This page was built for publication: On the computational properties of basic mathematical notions

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