Computable bi-embeddable categoricity (Q1731326)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Computable bi-embeddable categoricity	scientific article

Statements

scholarly article

0 references

Computable bi-embeddable categoricity (English)

0 references

Algebra and Logic

0 references

publication date

13 March 2019

0 references

Nikolay Bazhenov

0 references

Ekaterina B. Fokina

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s10469-018-9511-8

0 references

Up to equimorphism, hyperarithmetic is recursive

0 references

On the Equimorphism Types of Linear Orderings

0 references

Ranked structures and arithmetic transfinite recursion

0 references

Bi‐embeddability spectra and bases of spectra

0 references

Degrees of categoricity of computable structures

0 references

Degrees of categoricity and the hyperarithmetic hierarchy

0 references

Computable structures and the hyperarithmetical hierarchy

0 references

Effective categoricity for distributive lattices and Heyting algebras

0 references

Degrees of bi-embeddable categoricity of equivalence structures

0 references

Autostability of models

0 references

Recursive isomorphism types of recursive Boolean algebras

0 references

Recursively Categorical Linear Orderings

0 references

The complexity of computable categoricity

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s10469-018-9511-8

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1731326

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q1731326&oldid=37584459"