scientific article; zbMATH DE number 1746561
From MaRDI portal
Publication:4530730
zbMATH Open0989.03040MaRDI QIDQ4530730FDOQ4530730
Authors: Serikzhan A. Badaev, S. S. Goncharov 
Publication date: 28 May 2002
Full work available at URL: https://eudml.org/doc/187987
Title of this publication is not available (Why is that?)
Recommendations
- Ideals without minimal elements in Rogers semilattices
- Lattice properties of Rogers semilattices of compuatble and generalized computable families
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy
- Theories of Rogers semilattices of analytical numberings
Cited In (35)
- Rogers Semilattices of Finite Partially Ordered Sets
- A decomposition of the Rogers semilattice of a family of d.c.e. sets
- Rogers semilattices for families of equivalence relations in the Ershov hierarchy
- Some absolute properties of \(A\)-computable numberings
- Elementary theories and hereditary undecidability for semilattices of numberings
- On the embedding of the first nonconstructive ordinal in the Rogers semilattices
- Embedding of the first nonconstructive ordinal into the Rogers semilattices of families of arithmetic sets
- Computable Families of Sets in the Ershov Hierarchy Without Principal Numberings
- Rogers semilattices of limitwise monotonic numberings
- Effectively infinite classes of numberings and computable families of reals
- Friedberg numberings of families of partial computable functionals
- Two theorems on minimal generalized computable numberings
- The Rogers semilattices of generalized computable enumerations
- Enumeration reducibility and positive reducibility of the numberings of families of arithmetic sets
- On \(p \)-universal and \(p \)-minimal numberings
- Title not available (Why is that?)
- Extremal numberings and fixed point theorems
- Some properties of the upper semilattice of computable families of computably enumerable sets
- Theories of Rogers semilattices of analytical numberings
- Minimal generalized computable enumerations and high degrees
- A family with a single minimal but not least numbering
- Ideals without minimal elements in Rogers semilattices
- On cardinality of semilattices of enumerations of nondiscrete families
- Lattice properties of Rogers semilattices of compuatble and generalized computable families
- Effectively infinite classes of numberings of computable families of reals
- On Non-principal Arithmetical Numberings and Families
- Minimal generalized computable numberings and families of positive preorders
- Rogers semilattices with least and greatest elements in the Ershov hierarchy
- Some properties of precompletely and positively numbered sets
- Title not available (Why is that?)
- Local structure of Rogers semilattices of Σn 0-computable numberings
- On the limit property of the greatest element in the Rogers semilattice
- Title not available (Why is that?)
- Rogers semilattices of families of two embedded sets in the Ershov hierarchy
- Generalized computable universal numberings
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 Q4530730)
