Structures of the degrees of unsolvability of index sets (original) (raw)

2007

Decomposition and infima in the computably enumerable degrees

The Journal of Symbolic Logic, 2003

Structure of powers of generalized index sets

Victor Selivanov

Algebra and Logic, 1982

On the Some Particular Sets

Ozen Ozer

2016

An algebraic decomposition of the recursively enumerable degrees and the coincidence of several degree classes with the promptly simple degrees

Richard Shore

Transactions of the American Mathematical Society, 1984

Index sets in the hyperarithmetical hierarchy

Victor Selivanov

Siberian Mathematical Journal, 1985

Some highly undecidable lattices

Menachem Magidor

Annals of Pure and Applied Logic, 1990

Degrees which do not bound minimal degrees

Annals of Pure and Applied Logic, 1986

Some properties of K< set

Mehmet Akif Ince

New Trends in Mathematical Science, 2016

The Pigeonhole Principle and Fragments of Arithmetic

Costas Dimitrakopoulos

Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1986

Minimal Degrees and Recursively Inseparable Pairs of Recursively Enumerable Sets

Zeitschrift für Mathematische Logik und Grundlagen der Mathematik, 1991

D -Simple Sets, Small Sets, and Degree Classes

Pacific Journal of Mathematics, 1980

Embedding finite lattices into the computably enumerable degrees — a status survey

Cambridge University Press eBooks, 2017

The p-T-degrees of the recursive sets: lattice embeddings, extensions of embeddings and the two-quantifier theory

Richard Shore

Theoretical Computer Science, 1992

A Hierarchy of Computably Enumerable Degrees

The Bulletin of Symbolic Logic, 2018

Recursively Enumerable m- and tt-Degrees III: Realizing all Finite Distributive Lattices

Journal of the London Mathematical Society, 1994

On finite lattices of degrees of constructibility of reals

Zofia Adamowicz

Journal of Symbolic Logic, 1976

On relative enumerability of Turing degrees

Shamil Ishmukhametov

Archive for Mathematical Logic, 2000

Index sets and presentations of complexity classes

Kenneth Regan

Theoretical Computer Science, 1996

Additive indecomposability of submodular set functions and its generalization (Information and mathematics of non-additivity and non-extensivity : contacts with nonlinearity and non-commutativity)

Katsushige FUJIMOTO

On extensions, linear extensions, upsets and downsets of ordered sets

Jayme Szwarcfiter

Discrete Mathematics, 2005

A necessary and sufficient condition for embedding principally decomposable finite lattices into the computably enumerable degrees preserving greatest element

Annals of Pure and Applied Logic, 2001

On the complexity of posets

William Trotter

Discrete Mathematics, 1976

On the orbits of computably enumerable sets

Journal of the American Mathematical Society, 2008

On the indecomposability of ωn

Jared Corduan

2011

Some intersection theorems for ordered sets and graphs

Ronald Graham

Journal of Combinatorial Theory, Series A, 1986

Invariant Constructions of Simple and Maximal Sets

Frank P Weber

Mathematical Logic Quarterly, 1995

Index sets of computable structures

Valentina Harizanov

Algebra and Logic, 2006

Some results on the complexity of families of sets

Daniel Grieser

Discrete Mathematics, 1991

Degree theoretic definitions of the low2 recursively enumerable sets

Journal of Symbolic Logic, 1995

A Study on Arithmetic Integer Additive Set-Indexers of Graphs

K. A. Germina

arXiv: Combinatorics, 2013

Chapter II: Embeddings and Extensions of Embeddings in the Degrees

1983

Decidability and Invariant Classes for Degree Structures

Transactions of the American Mathematical Society, 1988

Hierarchies of Sets and Degrees Below 0

Richard Kramer

1979

Enumerations of canonically calculable families of finite sets

Victor Selivanov

Siberian Mathematical Journal, 1978