The Undecidability of the Recursively Enumerable Degrees

Bulletin of the American Mathematical Society - United States
doi 10.1090/s0273-0979-1982-14970-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

The Quotient Semilattice of the Recursively Enumerable Degrees Modulo the Cappable Degrees

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1984English

Infinite Subclasses of Recursively Enumerable Classes

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1967English

Recursively Enumerable Reals and Chaitin Ω Numbers

Theoretical Computer Science
Computer ScienceTheoretical Computer Science
2001English

Two Notes on Recursively Enumerable Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1953English

The Family of All Recursively Enumerable Classes of Finite Sets

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1971English

Book Review: Recursively Enumerable Sets and Degrees: A Study of Computable Functions and Computably Generated Sets

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1988English

Cohesive Sets and Recursively Enumerable Dedekind Cuts

Pacific Journal of Mathematics
Mathematics
1969English

Exact Separation of Recursively Enumerable Sets Within Theories

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1960English

The n-r.e. DEGREES: UNDECIDABILITY AND Σ1SUBSTRUCTURES

Journal of Mathematical Logic
Logic
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy