Measure-theoretic uniformity and the Suslin functional
From MaRDI portal
Publication:4995604
DOI10.3233/COM-190248MaRDI QIDQ4995604
Publication date: 25 June 2021
Published in: Computability (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1810.07543
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Set theory. An introduction to independence proofs
- Probability measures and the C-sets of Selivanovskij
- Functionals of type 3 as realisers of classical theorems in analysis
- Higher type recursion for transfinite machine theory
- The strength of compactness in computability theory and nonstandard analysis
- A model of set-theory in which every set of reals is Lebesgue measurable
- Turing's Legacy
- Recursive Functionals and Quantifiers of Finite Types I
- Higher-Order Computability
- Classical hierarchies from a modern standpoint. Part I. C-sets
- The Length of Infinite Time Turing Machine Computations
- Infinite time Turing machines
- RANDOMNESS VIA INFINITE COMPUTATION AND EFFECTIVE DESCRIPTIVE SET THEORY
- On the mathematical and foundational significance of the uncountable
- Hierarchies of Effective Descriptive Set Theory
- Measure-Theoretic Uniformity in Recursion Theory and Set Theory
- Axiom of choice
This page was built for publication: Measure-theoretic uniformity and the Suslin functional