A computably enumerable partial ordering without computably enumerable maximal chains and antichains
From MaRDI portal
Publication:1673673
DOI10.1134/S0037446618030096OpenAlexW2810976196MaRDI QIDQ1673673
Publication date: 13 September 2018
Published in: Siberian Mathematical Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0037446618030096
Combinatorics of partially ordered sets (06A07) Theory of numerations, effectively presented structures (03D45)
Cites Work
- Unnamed Item
- Computability on linear orderings enriched with predicates
- Initial segments of computable linear orders with additional computable predicates
- Computing maximal chains
- Linear orderings of low degree
- The maximal linear extension theorem in second order arithmetic
- The block relation in computable linear orders
- Chains and antichains in partial orderings
- Computability of distributive lattices
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- Computable linearizations of well-partial-orderings
- On computable self-embeddings of computable linear orderings
- Computably Enumerable Partial Orders
- Δ 2 0 -copies of linear orderings
- Effective categoricity of computable linear orderings
This page was built for publication: A computably enumerable partial ordering without computably enumerable maximal chains and antichains
