Computable isomorphisms for certain classes of infinite graphs (Q4579860): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Created claim: Wikidata QID (P12): Q129840774, #quickstatements; #temporary_batch_1729681987854
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: Computable structures and the hyperarithmetical hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Effective categoricity of equivalence structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computability-theoretic properties of injection structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-to-one structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Categoricity of Graphs with Finite Components / rank
 
Normal rank
Property / cites work
 
Property / cites work: Autostability of models / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computable dimension of ordered abelian groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable categoricity of trees of finite height / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computable dimension of trees of infinite height / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive isomorphism types of recursive Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursively Categorical Linear Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040892 / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129840774 / rank
 
Normal rank

Latest revision as of 13:27, 23 October 2024

scientific article; zbMATH DE number 6916017
Language Label Description Also known as
English
Computable isomorphisms for certain classes of infinite graphs
scientific article; zbMATH DE number 6916017

    Statements

    Identifiers