Decomposing Borel functions using the Shore–Slaman join theorem (Q4983474): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963345984 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1304.0698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3509071 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Borel measurability and reducibility of functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Closed choice and a uniform low basis theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Choice and Boundedness Principles in Computable Analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Limits to joining with generics and randoms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Levels of discontinuity, limit-computability, and jump operators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quasi-Polish spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inside the Muchnik degrees. I: Discontinuity, learnability and constructivism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Inside the Muchnik degrees. II: The degree structures induced by the arithmetical hierarchy of countably continuous functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Application of Martin-Löf Randomness to Effective Probability Theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: The space of class $\alpha$ Baire functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: First level Borel functions and isomorphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: L1-Computability, Layerwise Computability and Solovay Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Structure of Finite Level and <i>ω</i>-Decomposable Borel Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Wadge-like reducibilities on arbitrary quasi-Polish spaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Borel functions and structure at finite levels of the Baire hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees joining to <b>0</b>′ / rank
 
Normal rank
Property / cites work
 
Property / cites work: \(\sigma \)-continuity and related forcings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Defining the Turing jump / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in the enumeration degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Borel sets and functions and the structure of Baire class 1 functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4485693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Real computation with least discrete advice: a complexity theory of nonuniform computability with applications to effective linear algebra / rank
 
Normal rank

Latest revision as of 22:21, 9 July 2024

scientific article; zbMATH DE number 6419990
Language Label Description Also known as
English
Decomposing Borel functions using the Shore–Slaman join theorem
scientific article; zbMATH DE number 6419990

    Statements

    Decomposing Borel functions using the Shore–Slaman join theorem (English)
    0 references
    0 references
    0 references
    26 March 2015
    0 references
    0 references
    0 references
    0 references
    0 references
    Borel function
    0 references
    Baire function
    0 references
    Turing degree
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references