Weak presentations of computable partial orderings
From MaRDI portal
Publication:2784777
zbMATH Open0993.03055MaRDI QIDQ2784777
Iskander Kalimullin, M. M. Arslanov
Publication date: 16 September 2002
Partial orders, general (06A06) Recursively (computably) enumerable sets and degrees (03D25) Theory of numerations, effectively presented structures (03D45)
Related Items (2)
A computably enumerable partial ordering without computably enumerable maximal chains and antichains ⋮ 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)
