Precomplete numberings

DOI10.1007/s10958-021-05422-2OpenAlexW4256124436MaRDI QIDQ2036469

Victor L. Selivanov

Publication date: 29 June 2021

Published in: Journal of Mathematical Sciences (New York) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10958-021-05422-2

zbMATH Keywords

reducibilityuniversalityindex sethierarchynumberingprecomplete numberingcomplete numbering

Mathematics Subject Classification ID

Computable structure theory, computable model theory (03C57) Theory of numerations, effectively presented structures (03D45)

Related Items (max. 100)

Extremal numberings and fixed point theorems

Cites Work

• Generalized semilattices and m-degrees of index sets
• Fine hierarchies and m-reducibilities in theoretical computer science
• Structure of degrees of generalized index sets
• Index sets in the hyperarithmetical hierarchy
• Ershov hierarchy
• Index sets in the arithmetical hierarchy
• Ershov hierarchy and the T-jump
• Structure of the m-degrees of the index sets of families of partial recursive functions
• Relatively precomplete numerations and arithmetic
• Index sets of quotient objects of the Post numeration
• Turing degrees in refinements of the arithmetical hierarchy
• On recursively enumerable structures
• On degrees of recursively enumerable sets
• Fine hierarchy and definable index sets
• On the Cartesian subalgebras of a free Lie sum of Lie algebras
• The index sets of m-degrees
• Can partial indexings be totalized?
• A Note on Positive Equivalence Relations
• Towards the Effective Descriptive Set Theory
• Classifying positive equivalence relations
• Kleene index sets and functional m-degrees
• Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
• Pseudo Jump Operators. I: The R. E. Case
• Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
• Universal recursion theoretic properties of r.e. preordered structures
• A hierarchy of families of recursively enumerable degrees
• Alternative Characterizations of Precomplete Numerations
• Extensional Characterization of Index Sets
• Reducibility orderings: Theories, definability and automorphisms
• A noninitial segment of index sets
• Theorie der Numerierungen I
• Rice Theorems For D.R.E. Sets
• Extending Cooper’s theorem to Δ 3 0 Turing degrees
• The uniform Martin’s conjecture for many-one degrees
• Discrete ω-Sequences of Index Sets
• Index sets in Ershov's hierarchy
• Fine hierarchies and Boolean terms
• Remarks on Uniformly Finitely Precomplete Positive Equivalences
• Total Representations
• CONSTRUCTIVE ALGEBRAS I
• Index sets of finite classes of recursively enumerable sets
• A discrete chain of degrees of index sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Precomplete numberings