Computable bi-embeddable categoricity

Algebra and Logic 5 (57):392-396 (2018)
Download Edit this record How to cite View on PhilPapers
Abstract
We study the algorithmic complexity of isomorphic embeddings between computable structures.
Keywords
No keywords specified (fix it)
Categories
(categorize this paper)
PhilPapers/Archive ID
MAUCBC-2
Upload history
Archival date: 2022-08-04
View other versions
Added to PP index
2022-08-04

Total views
9 ( #72,624 of 71,407 )

Recent downloads (6 months)
9 ( #58,725 of 71,407 )

How can I increase my downloads?

Downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.