Algorithmic transformations of partial orders into linearly ordered structures

DOI10.1007/S10469-026-09822-8MaRDI QIDQ7285657zbMATH OpenFDO

Authors Iskander Kalimullin

Publication date 22 June 2026

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S10469-026-09822-8

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45) Total orders (06A05) Partial orders, general (06A06)

Cites work

• Algorithmic reducibilities of algebraic structures
• Computable functors and effective interpretability
• Degrees of presentability of structures. I
• scientific article; zbMATH DE number 890268 (Why is no real title available?)
• Spectral universality of linear orders with one binary relation
• The _2⁰-spectrum of a linear order

This page was built for publication: Algorithmic transformations of partial orders into linearly ordered structures

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7285657)