Coding in the partial order of enumerable sets
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 194103 (Why is no real title available?)
- scientific article; zbMATH DE number 6318 (Why is no real title available?)
- scientific article; zbMATH DE number 841091 (Why is no real title available?)
- Automorphisms of the lattice of recursively enumerable sets. I: Maximal sets
- Classes of Recursively Enumerable Sets and Degrees of Unsolvability
- Definability in the Turing degrees
- Effectively dense Boolean algebras and their applications
- Hyperarithmetical Index Sets in Recursion Theory
- Interpretability and Definability in the Recursively Enumerable Degrees
- Intervals of the Lattice of Computably Enumerable Sets and Effective Boolean Algebras
- Post's program and incomplete recursively enumerable sets.
- The Theory of the Degrees below 0 ′
- The elementary theory of recursively enumerable sets
- The first order properties of products of algebraic systems
- The last question on recursively enumerable m-degrees
- Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication
Cited in
(23)- On unordered codes
- Atomless \(r\)-maximal sets
- Coding a family of sets
- Interpreting true arithmetic in the \(\Delta_2^0\)-enumeration degrees
- ON THE DEFINABILITY OF THE DOUBLE JUMP IN THE COMPUTABLY ENUMERABLE SETS
- PARAMETER DEFINABILITY IN THE RECURSIVELY ENUMERABLE DEGREES
- Computably enumerable sets and related issues
- Definable Encodings in the Computably Enumerable Sets
- On propositional coding techniques for the distinguishability of objects in finite sets
- Effectively dense Boolean algebras and their applications
- Coding into Ramsey sets
- scientific article; zbMATH DE number 5521857 (Why is no real title available?)
- scientific article; zbMATH DE number 4160713 (Why is no real title available?)
- A coding theorem for enumerable output machines
- scientific article; zbMATH DE number 3920534 (Why is no real title available?)
- A coding of the countable linear orderings
- On the lattices of effectively open sets
- Coding over a measurable cardinal
- Effectively inseparable Boolean algebras in lattices of sentences
- Boolean pairs formed by the \(\Delta_ n^ 0\)-sets
- Descriptive complexity of \(\mathsf{qc} \mathsf{b}_0\)-spaces
- Interpreting \(\mathbb{N}\) in the computably enumerable weak truth table degrees
- Isomorphisms of splits of computably enumerable sets
This page was built for publication: Coding in the partial order of enumerable sets
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1380333)
