Computable bi-embeddable categoricity
type: Item
instance of: scholarly article
title: Computable bi-embeddable categoricity
zbMATH Open document ID: 1485.03106
published in: Algebra and Logic
publication date: 2019-03-13T00:00:00Z
Mathematics Subject Classification ID: 03C57
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03C35
zbMATH DE Number: 7035681
author: Nikolay Bazhenov
author: E. B. Fokina
author: Dino Rossegger
author: Luca San Mauro
MaRDI profile type: Publication
full work available at URL: s10469-018-9511-8
OpenAlex ID: W2903055266
cites work: Up to equimorphism, hyperarithmetic is recursive
cites work: On the Equimorphism Types of Linear Orderings
cites work: Ranked structures and arithmetic transfinite recursion
cites work: Bi‐embeddability spectra and bases of spectra
cites work: Degrees of categoricity of computable structures
cites work: Degrees of categoricity and the hyperarithmetic hierarchy
cites work: Computable structures and the hyperarithmetical hierarchy
cites work: Effective categoricity for distributive lattices and Heyting algebras
cites work: Degrees of bi-embeddable categoricity of equivalence structures
cites work: Autostability of models
cites work: Recursive isomorphism types of recursive Boolean algebras
cites work: Recursively Categorical Linear Orderings
cites work: The complexity of computable categoricity
Wikidata QID: Q128894197
DOI: 10.1007/S10469-018-9511-8
description: scientific article; zbMATH DE number 7035681