scientific article; zbMATH DE number 7204368
From MaRDI portal
Publication:5111248
Recommendations
- Two more characterizations of \(K\)-triviality
- scientific article; zbMATH DE number 2247262
- A higher rank version of Kitai's theorem
- A CHARACTERIZATION OF CERTAIN MORPHIC TRIVIAL EXTENSIONS
- A characterization of \(k\)-normal varieties
- A characterization of Dedekind structures
- A characterization of KK-theory
- A universal characterization of higher algebraic \(K\)-theory
- scientific article; zbMATH DE number 6133026
- Some characterizations of Krull domains
Cites work
- scientific article; zbMATH DE number 194101 (Why is no real title available?)
- scientific article; zbMATH DE number 722611 (Why is no real title available?)
- scientific article; zbMATH DE number 3322964 (Why is no real title available?)
- Algorithmic randomness and complexity.
- Computability and randomness
- Computuing \(K\)-trivial sets by incomplete random sets
- Continuous higher randomness
- Cupping with random sets
- Descriptive set theory
- Higher randomness and forcing with closed sets
- Higher randomness and genericity
- Infinite time Turing machines
- Lowness and nullsets
- Lowness notions, measure and domination
- Lowness of higher randomness notions
- Lowness properties and randomness
- Randomness via effective descriptive set theory
- Recursion theory. Computational aspects of definability
- The definition of random sequences
- Thin Maximal Antichains in the Turing Degrees
- Two more characterizations of \(K\)-triviality
- Using random sets as oracles
Cited in
(3)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111248)
