Recursively Enumerable Sets of Polynomials Over a Finite Field Are Diophantine

Inventiones Mathematicae - Germany
doi 10.1007/s00222-007-0078-6
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Springer Science and Business Media LLC

Related search

The Family of All Recursively Enumerable Classes of Finite Sets

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1971English

Two Notes on Recursively Enumerable Sets

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1953English

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

Recursively Enumerable Sets of Positive Integers and Their Decision Problems

Bulletin of the American Mathematical Society
1944English

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

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

Equivalence Classes of Sets of Functions Over a Finite Field

Acta Arithmetica
Number TheoryAlgebra
1980English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy