Last update: Wed Sep 26 02:11:46 MDT 2018
@Article{Shore:1992:DRS,
author = "R. A. Shore and T. A. Slaman",
title = "The $p$-{$T$}-degrees of the recursive sets: lattice
embeddings, extensions of embeddings and the
two-quantifier theory",
journal = j-THEOR-COMP-SCI,
volume = "97",
number = "2",
pages = "263--284",
day = "27",
month = apr,
year = "1992",
CODEN = "TCSCDI",
ISSN = "0304-3975 (print), 1879-2294 (electronic)",
ISSN-L = "0304-3975",
bibdate = "Sat Nov 22 13:24:22 MST 1997",
bibsource = "http://www.math.utah.edu/pub/tex/bib/tcs1990.bib",
acknowledgement = ack-nhfb,
classification = "C4210 (Formal logic); C4220 (Automata theory); C4240
(Programming and algorithm theory)",
corpsource = "Cornell Univ., Ithaca, NY, USA",
fjournal = "Theoretical Computer Science",
journal-URL = "http://www.sciencedirect.com/science/journal/03043975/",
keywords = "computational complexity; density type; formal
languages; looking back; nondistributive lattices;
polynomial-time Turing degrees; priority style
arguments; recursive lattice; recursive sets;
sentences; Turing machines; two-quantifier theory",
pubcountry = "Netherlands",
treatment = "T Theoretical or Mathematical",
}