A computably enumerable partial ordering without computably enumerable maximal chains and antichains
From MaRDI portal
Recommendations
- Infinite chains and antichains in computable partial orderings
- Computably enumerable partial orders
- scientific article; zbMATH DE number 4073041
- Maximal antichains in a partially ordered set
- Partially ordered sets with nondistributive lattices of maximal antichains
- Cardinality-restricted chains and antichains in partially ordered sets
- Chains and antichains in partial orderings
- Herrmann’s Beautiful Theorem on Computable Partial Orderings
- Weak presentations of computable partial orderings
- A note on maximal antichains in ordered sets
Cites work
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- Chains and antichains in partial orderings
- Computability of distributive lattices
- Computability on linear orderings enriched with predicates
- Computable linearizations of well-partial-orderings
- Computably enumerable partial orders
- Computing maximal chains
- Effective categoricity of computable linear orderings
- Initial segments of computable linear orders with additional computable predicates
- Linear orderings of low degree
- On computable self-embeddings of computable linear orderings
- Sufficient conditions for the existence of 0'-limitwise monotonic functions for computable \(\eta\)-like linear orders
- The block relation in computable linear orders
- The maximal linear extension theorem in second order arithmetic
- Δ 2 0 -copies of linear orderings
Cited in
(1)
This page was built for publication: A computably enumerable partial ordering without computably enumerable maximal chains and antichains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1673673)
