Computability on linear orderings enriched with predicates (Q431704): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: H. S. Yoon / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 03D45 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 06A05 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6051447 / rank
 
Normal rank
Property / zbMATH Keywords
 
computability
Property / zbMATH Keywords: computability / rank
 
Normal rank
Property / zbMATH Keywords
 
quasidiscrete linear ordering
Property / zbMATH Keywords: quasidiscrete linear ordering / 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.1007/s10469-009-9067-8 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2088657950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Low Boolean Algebra is Isomorphic to a Recursive One / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every Low 2 Boolean Algebra has a Recursive Copy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computable Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Δ 2 0 -copies of linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hierarchies of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of Tennenbaum's theorem on effectively finite recursive linear orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Jumps of Orderings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A construction for recursive linear orderings / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:38, 5 July 2024

scientific article
Language Label Description Also known as
English
Computability on linear orderings enriched with predicates
scientific article

    Statements