On MODkP Counting Degrees

&
Mathematical Logic Quarterly 45 (3):327-342 (1999)
  Copy   BIBTEX

Abstract

For a prime k, the embeddability of finite lattices are discussed for various kind of the MODkP degrees of recursive sets. In particular, all finite lattices are embeddable into the MODkP Turing degrees, whereas the non distributive lattice M3 is embeddable into the MOD2P many-one degrees but N5 is not

Categories

Keywords

Reprint years

DOI

10.1002/malq.19990450305

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,202

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Similar books and articles

On Nondeterminism, Enumeration Reducibility and Polynomial Bounds.Kate Copestake - 1997 - Mathematical Logic Quarterly 43 (3):287-310.
On polynomial time computation over unordered structures.Andreas Blass, Yuri Gurevich & Saharon Shelah - 2002 - Journal of Symbolic Logic 67 (3):1093-1125.
Strong Enumeration Reducibilities.Roland Sh Omanadze & Andrea Sorbi - 2006 - Archive for Mathematical Logic 45 (7):869-912.
Strong polynomial-time reducibility.Juichi Shinoda - 1997 - Annals of Pure and Applied Logic 84 (1):97-117.
On the reducibility of relations: Variations on a theme of Peirce.Ernst Kleinert - 2007 - Transactions of the Charles S. Peirce Society 43 (3):509 - 520.
Bounded enumeration reducibility and its degree structure.Daniele Marsibilio & Andrea Sorbi - 2012 - Archive for Mathematical Logic 51 (1-2):163-186.
The existential theory of the poset of R.e. Degrees with a predicate for single jump reducibility.Steffen Lempp & Manuel Lerman - 1992 - Journal of Symbolic Logic 57 (3):1120-1130.
A New Reducibility between Turing‐ and wtt‐Reducibility.Sui Yuefei - 1994 - Mathematical Logic Quarterly 40 (1):106-110.
Enumeration Reducibility Using Bounded Information: Counting Minimal Covers.S. Barry Cooper - 1987 - Mathematical Logic Quarterly 33 (6):537-560.
A characterization of the Δ⁰₂ hyperhyperimmune sets.Roland Sh Omanadze & Andrea Sorbi - 2008 - Journal of Symbolic Logic 73 (4):1407-1415.
Wtt-degrees and t-degrees of R.e. Sets.Michael Stob - 1983 - Journal of Symbolic Logic 48 (4):921-930.
The expressive power of fixed-point logic with counting.Martin Otto - 1996 - Journal of Symbolic Logic 61 (1):147-176.
Approximate counting by hashing in bounded arithmetic.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (3):829-860.
Polynomial clone reducibility.Quinn Culver - 2014 - Archive for Mathematical Logic 53 (1-2):1-10.
1-reducibility inside an m-degree with maximal set.E. Herrmann - 1992 - Journal of Symbolic Logic 57 (3):1046-1056.

Analytics

Added to PP
2014-01-16

Downloads
12 (#1,020,711)

6 months
2 (#1,136,865)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references