Computably enumerable sets and related issues

DOI10.1007/S10469-012-9161-1MaRDI QIDQ695800zbMATH OpenOpenAlexFDO

Authors I. A. Lavrov

Publication date 17 December 2012

Published in Algebra and Logic (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10469-012-9161-1

zbMATH Keywords

algebraic descriptionscomputably enumerable setsdecidabilitydefinabilitylattice of c.e. setsm-reducibilityprincipal filtersprincipal idealssemilattice of c.e. many-one degrees

Mathematics Subject Classification ID

Recursively (computably) enumerable sets and degrees (03D25)

Recommendations

• The computably enumerable sets: recent results and future directions
• Definable structures in the lattice of recursively enumerable sets
• Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
• Algebraic aspects of the computably enumerable degrees.
• On definable filters in computably enumerable degrees

Cites work

• A Decidable Fragment of the Elementary Theory of the Lattice of Recursively Enumerable Sets
• A Dichotomy of the Recursively Enumerable Sets
• A note on universal sets
• A theorem on hyperhypersimple sets
• A theorem on maximal sets
• Atomless r-maximal sets
• Automorphisms of the Lattice of Recursively Enumerable Sets: Promptly Simple Sets
• Characterization of Recursively Enumerable Sets with Supersets Effectively Isomorphic to all Recursively Enumerable Sets
• Classes of Recursively Enumerable Sets and Degrees of Unsolvability
• Classical recursion theory. The theory of functions and sets of natural numbers
• Coding in the partial order of enumerable sets
• Definability, Automorphisms, and Dynamic Properties of Computably Enumerable Sets
• Definable Encodings in the Computably Enumerable Sets
• Degrees of classes of RE sets
• Degrees of recursively enumerable sets which have no maximal supersets
• scientific article; zbMATH DE number 3117565 (Why is no real title available?)
• scientific article; zbMATH DE number 3966058 (Why is no real title available?)
• scientific article; zbMATH DE number 194103 (Why is no real title available?)
• scientific article; zbMATH DE number 3532933 (Why is no real title available?)
• scientific article; zbMATH DE number 3601575 (Why is no real title available?)
• scientific article; zbMATH DE number 1531921 (Why is no real title available?)
• scientific article; zbMATH DE number 1531936 (Why is no real title available?)
• scientific article; zbMATH DE number 841085 (Why is no real title available?)
• scientific article; zbMATH DE number 841087 (Why is no real title available?)
• scientific article; zbMATH DE number 1390011 (Why is no real title available?)
• scientific article; zbMATH DE number 1390017 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• scientific article; zbMATH DE number 3342829 (Why is no real title available?)
• scientific article; zbMATH DE number 3387326 (Why is no real title available?)
• Isomorphisms of splits of computably enumerable sets
• Model theory of the computably enumerable many-one degrees
• On a property of creative sets
• On computable enumerations. II
• On the Cartesian subalgebras of a free Lie sum of Lie algebras
• On the degrees less than 0'
• On the Lattice of Recursively Enumerable Sets
• Post's program and incomplete recursively enumerable sets.
• Recursively Enumerable Sets and Retracing Functions
• Recursively enumerable sets of positive integers and their decision problems
• Several results on upper semilattices and m-degrees
• Simplicity of recursively enumerable sets
• Some theorems on R-maximal sets and major subsets of recursively enumerable sets
• Structure of the upper semilattice of recursively enumerable m-degrees and related questions. I
• The computable enumerations of families of general recursive functions
• The elementary theory of recursively enumerable sets
• The intervals of the lattice of recursively enumerable sets determined by major subsets
• The last question on recursively enumerable m-degrees
• The upper semilattice of numerations of a finite set
• Theory of Formal Systems. (AM-47)
• Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
• tt- and m-degrees
• Undecidable fragments of elementary theories

Cited in

(16)

• The complexity types of computable sets
• Computably enumerable sets and quasi-reducibility
• Constructive sets in computable sets
• A journey to computably enumerable structures (tutorial lectures)
• On definable filters in computably enumerable degrees
• Sub-computabilities
• scientific article; zbMATH DE number 4145890 (Why is no real title available?)
• Almost computably enumerable families of sets
• scientific article; zbMATH DE number 3914303 (Why is no real title available?)
• Post's program and incomplete recursively enumerable sets.
• Computably enumerable sets below random sets
• scientific article; zbMATH DE number 1390017 (Why is no real title available?)
• ASYMPTOTIC DENSITY AND COMPUTABLY ENUMERABLE SETS
• The computably enumerable sets: recent results and future directions
• On the filter of computably enumerable supersets of an r-maximal set
• Some recent research directions in the computably enumerable sets

This page was built for publication: Computably enumerable sets and related issues

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