Precomplete numberings
type: Item
instance of: scholarly article
title: Precomplete numberings
published in: Journal of Mathematical Sciences (New York)
publication date: 2021-06-29T00:00:00Z
Mathematics Subject Classification ID: 03D45
Mathematics Subject Classification ID: 03C57
zbMATH DE Number: 7364540
zbMATH Keywords: numbering
zbMATH Keywords: precomplete numbering
zbMATH Keywords: complete numbering
zbMATH Keywords: universality
zbMATH Keywords: reducibility
zbMATH Keywords: hierarchy
zbMATH Keywords: index set
author: Victor Selivanov
MaRDI profile type: Publication
full work available at URL: s10958-021-05422-2
OpenAlex ID: W4256124436
cites work: Q3674634
cites work: Q3325710
cites work: Q3792671
cites work: Q4205434
cites work: Q4133617
cites work: Q4198491
cites work: Q4460829
cites work: Classifying positive equivalence relations
cites work: Index sets in the arithmetical hierarchy
cites work: On the Cartesian subalgebras of a free Lie sum of Lie algebras
cites work: Q3893915
cites work: Q3919704
cites work: Q5619076
cites work: Q5619077
cites work: Theorie der Numerierungen I
cites work: Q4111546
cites work: Index sets in Ershov's hierarchy
cites work: Index sets of finite classes of recursively enumerable sets
cites work: A discrete chain of degrees of index sets
cites work: Discrete ω-Sequences of Index Sets
cites work: Q4775860
cites work: A noninitial segment of index sets
cites work: Rice Theorems For D.R.E. Sets
cites work: Extensional Characterization of Index Sets
cites work: Recursively enumerable sets modulo iterated jumps and extensions of Arslanov's completeness criterion
cites work: Pseudo Jump Operators. I: The R. E. Case
cites work: Pseudo-jump operators. II: Transfinite iterations, hierarchies and minimal covers
cites work: The index sets of m-degrees
cites work: On degrees of recursively enumerable sets
cites work: Alternative Characterizations of Precomplete Numerations
cites work: The uniform Martin’s conjecture for many-one degrees
cites work: Q4723720
cites work: Q5602916
cites work: Structure of the m-degrees of the index sets of families of partial recursive functions
cites work: Generalized semilattices and m-degrees of index sets
cites work: A Note on Positive Equivalence Relations
cites work: CONSTRUCTIVE ALGEBRAS I
cites work: Q5546784
cites work: Q5596230
cites work: Kleene index sets and functional m-degrees
cites work: Relatively precomplete numerations and arithmetic
cites work: Universal recursion theoretic properties of r.e. preordered structures
cites work: Q5322161
cites work: Reducibility orderings: Theories, definability and automorphisms
cites work: Q5573961
cites work: Q4168913
cites work: Q4198492
cites work: Q3880827
cites work: Structure of degrees of generalized index sets
cites work: Q3671954
cites work: Q3320353
cites work: Index sets in the hyperarithmetical hierarchy
cites work: Ershov hierarchy
cites work: Q3791143
cites work: Index sets of quotient objects of the Post numeration
cites work: Ershov hierarchy and the T-jump
cites work: Q3815291
cites work: Q4712236
cites work: Fine hierarchy and definable index sets
cites work: Q3986256
cites work: Q4005036

Precomplete numberings (cites work)
cites work: Fine hierarchies and Boolean terms

Precomplete numberings (cites work)
cites work: Q3837740

Precomplete numberings (cites work)
cites work: On recursively enumerable structures

Precomplete numberings (cites work)
cites work: Fine hierarchies and m-reducibilities in theoretical computer science

Precomplete numberings (cites work)
cites work: Total Representations

Precomplete numberings (cites work)
cites work: Towards the Effective Descriptive Set Theory

Precomplete numberings (cites work)
cites work: Turing degrees in refinements of the arithmetical hierarchy

Precomplete numberings (cites work)
cites work: Extending Cooper’s theorem to Δ 3 0 Turing degrees

Precomplete numberings (cites work)
cites work: Remarks on Uniformly Finitely Precomplete Positive Equivalences

Precomplete numberings (cites work)
cites work: Q4040892

Precomplete numberings (cites work)
cites work: Can partial indexings be totalized?

Precomplete numberings (cites work)
cites work: Q4982355

Precomplete numberings (cites work)
cites work: Q4982356

Precomplete numberings (cites work)
cites work: Q4288344

Precomplete numberings (cites work)
cites work: Q3922646

Precomplete numberings (cites work)
cites work: Q3751553

Precomplete numberings (cites work)
cites work: Q4485693

Precomplete numberings (cites work)
cites work: A hierarchy of families of recursively enumerable degrees

Precomplete numberings (DOI)
DOI: 10.1007/S10958-021-05422-2

Precomplete numberings (Recommended article)
Recommended article: Q4982355
Similarity Score: 0.9085413
Recommender Run: Recommender Run 3

Precomplete numberings (Recommended article)
Recommended article: Q4005036
Similarity Score: 0.8320855
Recommender Run: Recommender Run 3

Precomplete numberings (Recommended article)
Recommended article: A note on partial numberings
Similarity Score: 0.8125253
Recommender Run: Recommender Run 3

Precomplete numberings (Recommended article)
Recommended article: Q3068278
Similarity Score: 0.7967968
Recommender Run: Recommender Run 3

Precomplete numberings (Recommended article)
Recommended article: Alternative Characterizations of Precomplete Numerations
Similarity Score: 0.7893586
Recommender Run: Recommender Run 3

Precomplete numberings (Recommended article)
Recommended article: Fixed point theorems for precomplete numberings
Similarity Score: 0.78219634
Recommender Run: Recommender Run 3

Precomplete numberings (Recommended article)
Recommended article: Numberings and Randomness
Similarity Score: 0.78115326
Recommender Run: Recommender Run 3

Precomplete numberings (Recommended article)
Recommended article: Numeration and enumeration
Similarity Score: 0.7757653
Recommender Run: Recommender Run 3

Precomplete numberings (Recommended article)
Recommended article: Q4934289
Similarity Score: 0.77174973
Recommender Run: Recommender Run 3

Precomplete numberings (Recommended article)
Recommended article: Numberings and learnability
Similarity Score: 0.7673018
Recommender Run: Recommender Run 3