Strong reducibilities

From MaRDI portal
Publication:3942949

DOI10.1090/S0273-0979-1981-14863-1zbMath0484.03024OpenAlexW4246936007MaRDI QIDQ3942949

Piergiorgio Odifreddi

Publication date: 1981

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0273-0979-1981-14863-1




Related Items

Embedding the Diamond Lattice in the Recursively Enumerable Truth-Table DegreesStructural interactions of the recursively enumerable T- and W-degreesThe structure of the honest polynomial m-degreesIntervals and sublattices of the r.e. weak truth table degrees. I: DensityClassification of degree classes associated with r.e. subspacesRecursively enumerable \(m\)- and \(tt\)-degrees. II: The distribution of singular degreesA note on complete problems for complexity classesLattice Embeddings in the Recursively Enumerable Truth Table DegreesInterpreting true arithmetic in the theory of the r.e. truth table degreesWhere join preservation fails in the bounded Turing degrees of c.e. setsThe index set {e: We1X}.Recursively enumerable m- and tt-degrees. I: The quantity of m-degreesThe theory of the recursively enumerable weak truth-table degrees is undecidable1-reducibility inside an m-degree with a maximal setEmbedding lattices into the wtt-degrees below 0′Degree theoretic definitions of the low2 recursively enumerable setsReducibility by means of almost polynomial functionsMinimal Weak Truth Table Degrees and Computably Enumerable Turing DegreesHonest polynomial time reducibilities and the \(P=?NP\) problemIndex Sets and Boolean OperationsTabular degrees in \(\alpha\)-recursion theoryContiguity and distributivity in the enumerable Turing degreesKleene index sets and functional m-degreesMaximal r.e. equivalence relations1998–99 Annual Meeting of the Association for Symbolic LogicUndecidability and initial segments of the (r.e.) tt-degreesT-Degrees, Jump Classes, and Strong ReducibilitiesOn \(1\)-degrees inside \(m\)-degreesA problem of OdifreddiTwo Theorems on Truth Table DegreesDegrees of sets having no subsets of higher m- and t t-degreeOn the complexity-relativized strong reducibilitiesCappable recursively enumerable degrees and Post's programRecursive versus recursively enumerable binary relationsErshov hierarchy



Cites Work