Countable thin \(\Pi^0_1\) classes (Q1208080): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Members of countable \(\Pi ^ 0_ 1\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time versus recursive models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively presented games and strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the ranked points of a <i>Π<sub>1</sub><sup>0</sup></i> set / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Recursive Trees with a Unique Infinite Branch / rank
 
Normal rank
Property / cites work
 
Property / cites work: Retraceable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Abstract dependence, recursion theory, and the lattice of recursively enumerable filters / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximal theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: On \(\Pi{}^ 0_ 1\) classes and their ranked points / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197814 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Countable algebra and set existence axioms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some properties of the constructivization of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semirecursive Sets and Positive Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships Between Reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Degrees of members of \(\Pi_ 1^ 0\) classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5541832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lattice of Recursively Enumerable Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Initial segments of the degrees of unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective Matchmaking (Recursion Theoretic Aspects of a Theorem of Philip Hall) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classes of Recursively Enumerable Sets and Degrees of Unsolvability / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Degrees of Hyperimmune Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Axiomatizable theories with few axiomatizable extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective content of field theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph colorings and recursively bounded \(\Pi ^ 0_ 1\)-classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively enumerable Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5573961 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective aspects of profinite groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automorphisms of the lattice of recursively enumerable sets. Part II: Low sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively Enumerable Sets and Retracing Functions / rank
 
Normal rank

Latest revision as of 16:09, 17 May 2024

scientific article
Language Label Description Also known as
English
Countable thin \(\Pi^0_1\) classes
scientific article

    Statements

    Countable thin \(\Pi^0_1\) classes (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 May 1993
    0 references
    0 references
    0 references
    0 references
    0 references
    lattice of recursively enumerable sets
    0 references
    paths in a recursive infinite tree
    0 references
    Cantor-Bendixson rank
    0 references
    maximal sets
    0 references
    undecidability degree
    0 references
    propositional theories
    0 references
    recursive Boolean algebras
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references