Weak presentations of computable partial orderings

MaRDI QIDQ2784777zbMATH OpenFDO

Authors M. M. Arslanov, Iskander Kalimullin

Publication date 16 September 2002

zbMATH Keywords

computable orderingrecursive orderingweak presentation

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45) Partial orders, general (06A06)

Recommendations

• Weak presentations of computable ordered semigroups
• Infinite chains and antichains in computable partial orderings
• Order-computable sets
• Relative complexity for computable presentations of the conventional linear order on the set of naturals
• scientific article; zbMATH DE number 1303201

Cited in

(8)

• Chains and antichains in partial orderings
• Weak presentations of computable ordered semigroups
• Weakly semirecursive sets and r.e. orderings
• A computably enumerable partial ordering without computably enumerable maximal chains and antichains
• Relative complexity for computable presentations of the conventional linear order on the set of naturals
• Order-computable sets
• Infinite chains and antichains in computable partial orderings
• Computer Science Logic

This page was built for publication: Weak presentations of computable partial orderings

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