Sequences of <i>n</i>-diagrams (Q4779662): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Q282116 / rank
Normal rank
 
Property / author
 
Property / author: Julia F. Knight / rank
Normal rank
 
Property / author
 
Property / author: Andrey S. Morozov / rank
Normal rank
 
Property / author
 
Property / author: Valentina S. Harizanov / rank
 
Normal rank
Property / author
 
Property / author: Julia F. Knight / rank
 
Normal rank
Property / author
 
Property / author: Andrey S. Morozov / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.2178/jsl/1190150160 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2106044804 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4052109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Possible degrees in recursive copies. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generic copies of countable 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: An undecidable linear order that is \(n\)-decidable for all \(n\) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:53, 4 June 2024

scientific article; zbMATH DE number 1836138
Language Label Description Also known as
English
Sequences of <i>n</i>-diagrams
scientific article; zbMATH DE number 1836138

    Statements

    Sequences of <i>n</i>-diagrams (English)
    0 references
    2002
    0 references
    0 references
    0 references
    0 references
    0 references
    computable languages
    0 references
    countable structures
    0 references
    Turing reducibility
    0 references
    models of Peano arithmetic
    0 references
    0 references
    0 references
    0 references
    0 references