Embedding lattices into the <i>wtt</i>-degrees below 0′ (Q4323049): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2307/2275710 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2015048280 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The existence of recursively enumerable minimal truth-tabular degrees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3329452 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The weak truth table degrees of recursively enumerable sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification of degree classes associated with r.e. subspaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: D.R.E. Degrees and the Nondiamond Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong reducibilities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every finite lattice can be embedded in a finite partition lattice / rank
 
Normal rank

Latest revision as of 10:57, 23 May 2024

scientific article; zbMATH DE number 722198
Language Label Description Also known as
English
Embedding lattices into the <i>wtt</i>-degrees below 0′
scientific article; zbMATH DE number 722198

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references