Strength and Weakness in Computable Structure Theory (Q2970966): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Degrees that are not degrees of categoricity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of categoricity and the hyperarithmetic hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: DEGREES OF CATEGORICITY ON A CONE VIA<i>η</i>-SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Schnorr and computable randomness, martingales, and machines / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Randomness and Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a hierarchy of sets. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of categoricity of computable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schnorr trivial reals: a construction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3567847 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees that Are Low for Isomorphism / rank
 
Normal rank
Property / cites work
 
Property / cites work: Schnorr trivial sets and truth-table reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lowness for isomorphism and degrees of genericity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective procedures in field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4249356 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degree spectra and computable dimensions in algebraic structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial principles weaker than Ramsey's Theorem for pairs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The atomic model theorem and type omitting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Realizing levels of the hyperarithmetic hierarchy as degree spectra of relations on computable structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees coded in jumps of orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non <i>Σ</i><sub><i>n</i></sub> axiomatizable almost strongly minimal theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: PRIORITY ARGUMENTS VIA TRUE STAGES / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descriptive set theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability and Randomness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Randomness, relativization and Turing degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. The theory of functions and sets of natural numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classical recursion theory. Vol. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040890 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Friedberg-Muchnik Theorem Re-Examined / rank
 
Normal rank

Latest revision as of 14:41, 13 July 2024

scientific article
Language Label Description Also known as
English
Strength and Weakness in Computable Structure Theory
scientific article

    Statements

    Strength and Weakness in Computable Structure Theory (English)
    0 references
    4 April 2017
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers