AbstractWe prove that a relation over Fq[Z] is recursively enumerable if and only if it is Diophantine over Fq[W,Z]. We do this by first constructing a model of N in Fq[Z], where n is represented by Zn. In a second step, we show that it suffices to eliminate a bounded universal quantifier. Then finally, the hardest part of the proof is to show that we can eliminate this quantifier
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
AbstractSyntactical properties of representations of integers in various number systems are well kno...
International audienceYuri Matiyasevich's theorem states that the set of all Diophantine equations w...
Let R be a number field or a recursive subring of a number field and consider the polynomial ring R[...
Main theme of this thesis are diophantine equations and diophantine sets. In the first chapter we al...
Let L be a recursive algebraic extension of Q. Assume that, given alpha is an element of L, we can c...
Abstract. A class F of partial recursive functions is called recursively enumerable if there exists ...
You can’t always get what you want You can’t always get what you want You can’t always get what you ...
AbstractSets whose members are enumerated by some Turing machine are called recursively enumerable. ...
In 1900, the German mathematician David Hilbert proposed a list of 23 unsolved mathematical problems...
'We int¡oduce recursively invariant p-recursion theory as a new approach towards recursion theo...
4noThe Davis-Putnam-Robinson theorem showed that every partially computable m-ary function f(a_1, . ...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analys...
Abstract. Pólya’s enumeration theorem states that the number of labelings of a finite set up to symm...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
AbstractSyntactical properties of representations of integers in various number systems are well kno...
International audienceYuri Matiyasevich's theorem states that the set of all Diophantine equations w...
Let R be a number field or a recursive subring of a number field and consider the polynomial ring R[...
Main theme of this thesis are diophantine equations and diophantine sets. In the first chapter we al...
Let L be a recursive algebraic extension of Q. Assume that, given alpha is an element of L, we can c...
Abstract. A class F of partial recursive functions is called recursively enumerable if there exists ...
You can’t always get what you want You can’t always get what you want You can’t always get what you ...
AbstractSets whose members are enumerated by some Turing machine are called recursively enumerable. ...
In 1900, the German mathematician David Hilbert proposed a list of 23 unsolved mathematical problems...
'We int¡oduce recursively invariant p-recursion theory as a new approach towards recursion theo...
4noThe Davis-Putnam-Robinson theorem showed that every partially computable m-ary function f(a_1, . ...
When attempting to generalize recursion theory to admissible ordinals, it may seem as if all classic...
Abstract. We introduce polynomial time enumeration reducibility (≤pe) and we retrace Selman’s analys...
Abstract. Pólya’s enumeration theorem states that the number of labelings of a finite set up to symm...
SETS, MODELS, AND PROOFS: TOPICS IN THE THEORY OF RECURSIVE FUNCTIONS David Roger Belanger, Ph.D. Co...
AbstractSyntactical properties of representations of integers in various number systems are well kno...
International audienceYuri Matiyasevich's theorem states that the set of all Diophantine equations w...
DOI
Add to ORKG