scientific article; zbMATH DE number 1752644

MaRDI QIDQ4533283zbMATH OpenFDO

Authors Iskander Kalimullin

Publication date 9 June 2002

zbMATH Keywords

\(n\)-recursively enumerable \(e\)-degrees\(n\)-recursively enumerable Turing degreeselementary equivalence of semilattices

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25) Semilattices (06A12)

Recommendations

• On multiple positive reducibility
• The elementary theory of the recursively enumerable degrees is not \(\aleph _ 0\)-categorical
• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• Relations between reducibilities of table type
• Upper semilattice of recursively enumerable Q-degrees

Cited in

(9)

• On elementary theories of semilattices of partial orders on sets
• Elementary theories and structural properties of d-c.e. and n-c.e. degrees
• Splitting properties of n-c.e. enumeration degrees
• A survey of results on the d-c.e. and n-c.e. degrees
• On cardinality of semilattices of enumerations of nondiscrete families
• The \(\text{low}_n\) and \(\text{low}_m\) r.e. degrees are not elementarily equivalent
• A semilattice generated by superlow computably enumerable degrees
• On the definition of a Lachlan semilattice
• scientific article; zbMATH DE number 24993 (Why is no real title available?)

This page was built for publication:

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