.png){kind=icon}
.png){kind=icon}
Return
Algorithmic Transformations of Partial Orders into Linearly Ordered Structures
.png){kind=icon}
PRE
AI
DOI：10.1007/s10469-026-09822-8.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We prove that there exists a partial order having no computable copies in which any effectively interpreted linearly ordered structure has a computable copy, but there are linearly ordered structures with the same degree spectrum which are obtained by a natural algorithmic transformation not directly related to effective interpretability.
Keywords:
algebraic structure
partial order
linear order
effective interpretability
algorithmic transformation