Infinite Subclasses of Recursively Enumerable Classes

Proceedings of the American Mathematical Society - United States
doi 10.1090/s0002-9939-1967-0218234-9
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

The Family of All Recursively Enumerable Classes of Finite Sets

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1971English

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 Undecidability of the Recursively Enumerable Degrees

Bulletin of the American Mathematical Society
MathematicsApplied Mathematics
1982English

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

Implementation of Recursively Enumerable Languages in Universal Turing Machine

International Journal of Computer Theory and Engineering
2011English

Recursively Enumerable Sets of Positive Integers and Their Decision Problems

Bulletin of the American Mathematical Society
1944English

Recursively Enumerable Sets of Polynomials Over a Finite Field Are Diophantine

Inventiones Mathematicae
Mathematics
2007English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy