On the computational properties of basic mathematical notions

DOI10.1093/LOGCOM/EXAC075OpenAlexW4309824122MaRDI QIDQ5872876FDOQ5872876

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

Recommendations

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

zbMATH Keywords

regulated functionsbounded variationpartialityhigher-order computability theoryKleene S1--S9

Mathematics Subject Classification ID

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

Cited In (6)

• On the uncountability of \(\mathbb{R}\)
• Title not available (Why is that?)
• The non-normal abyss in Kleene's computability theory
• Exploring the abyss in Kleene's computability theory
• Computability and non-monotone induction
• On the computational properties of the uncountability of the real numbers

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)