Annals of Pure and Applied Logic 171 (7):102766 (2020)

Authors
Alexander Melnikov
National Research University Higher School of Economics
Abstract This article has no associated abstract. (fix it)
Keywords No keywords specified (fix it)
Categories (categorize this paper)
DOI 10.1016/j.apal.2019.102766
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 50,241
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

No citations found.

Add more citations

Similar books and articles

Bounds in the Turing Reducibility of Functions.Karol Habart & K. Habart - 1992 - Mathematical Logic Quarterly 38 (1):423-430.
A New Reducibility Between Turing‐ and Wtt‐Reducibility.Sui Yuefei - 1994 - Mathematical Logic Quarterly 40 (1):106-110.
Embeddings in the Strong Reducibilities Between 1 and Npm.Phil Watson - 1997 - Mathematical Logic Quarterly 43 (4):559-568.
About Segment Complexity of Turing Reductions.Valeriy K. Bulitko - 1999 - Mathematical Logic Quarterly 45 (4):561-571.
Mass Problems and Measure-Theoretic Regularity.Stephen G. Simpson - 2009 - Bulletin of Symbolic Logic 15 (4):385-409.
Turing Computable Embeddings.Julia Knight, Sara Miller & M. Vanden Boom - 2007 - Journal of Symbolic Logic 72 (3):901-918.
Turing Computable Embeddings.F. Knight Julia, Miller Sara & M. Vanden Boom - 2007 - Journal of Symbolic Logic 72 (3):901-918.
On Polynomial-Time Relation Reducibility.Su Gao & Caleb Ziegler - 2017 - Notre Dame Journal of Formal Logic 58 (2):271-285.
Hierarchies of [ ... ] º 2-Measurable K -Partitions.Victor L. Selivanov - 2007 - Mathematical Logic Quarterly 53 (4-5):446-461.
Post's Problem for Reducibilities of Bounded Complexity.Valeriy K. Bulitko - 2002 - Mathematical Logic Quarterly 48 (3):367-373.
A Reducibility Related To Being Hyperimmune-Free.Frank Stephan & Liang Yu - 2014 - Annals of Pure and Applied Logic 165 (7-8):1291-1300.
Computably Enumerable Sets and Quasi-Reducibility.R. Downey, G. LaForte & A. Nies - 1998 - Annals of Pure and Applied Logic 95 (1-3):1-35.
Wtt-Degrees and T-Degrees of R.E. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
The Logic of Interactive Turing Reduction.Giorgi Japaridze - 2007 - Journal of Symbolic Logic 72 (1):243 - 276.

Analytics

Added to PP index
2019-12-14

Total views
7 ( #960,756 of 2,325,376 )

Recent downloads (6 months)
5 ( #171,137 of 2,325,376 )

How can I increase my downloads?

Downloads

My notes