Results 51 to 60 of about 3,677,609 (156)

Splitting an š›¼-recursively enumerable set

open access: yes, 1975
We extend the priority method in α \alpha -recursion theory to certain arguments with no a priori bound on the required preservations by proving the splitting theorem for all admissible α \alpha .
Richard A. Shore
core   +1 more source

Lattice Embeddings below a Nonlow Recursively Enumerable Degree

open access: yes, 1996
We introduce techniques that allow us to embed below an arbitary nonlow 2 recursively enumerable degree any lattice currently known to be embedable into the recursively enumerable degrees.
Rod Downey, Richard A. Shore
core  

Ordered subrings of the reals in which output sets are recursively enumerable

open access: yes, 1993
In On a theory of computation and complexity over the real numbers ..., Bull. Amer. Math. Soc. 21 (1989), 1-46, Blum, Shub, and Smale investigated computability over the reals and over ordered rings in general.
Robert E. Byerly
core   +1 more source

Isomorphism Theorem for BSS Recursively Enumerable Sets over Real Closed Fields

open access: yes, 1998
The main result of this paper lies in the framework of BSS computability : it shows roughly that any recursively enumerable set S in R N 6 1, where R is a real closed field, is isomorphic to R dimS by a bijection ' which is decidable over S.
Christian Michaux, Christophe Troestler
core  

Most General First Order Theorems are not Recursively Enumerable

open access: yes, 1994
: An #-substitution is a uniform replacement of n-ary predicates Q n by n-ary 'complex' predicates, that is, by formulas containing all the name form variables of Q n .
Edited Gerhard   +2 more
core  

On the Recursive Enumerability of Fixed-Point Combinators [PDF]

open access: yes, 2004
We show that the set of fixed-point combinators forms a recursively-enumerable subset of a larger set of terms that is (A) not recursively enumerable, and (B) the terms of which are observationally equivalent to fixed-point combinators in any computable ...
Goldberg, Mayer
core  

Generalization of the Ginsburg-Rice Schützenberger fixed-point theorem for context-sensitive and recursive-enumerable languages

open access: yesTheoretical Computer Science, 1982
AbstractThe paper generalizes the Ginsburg-Rice Schützenberger ALGOL-like fixed-point theorem showing that every Ī»-free context-sensitive (recursive-enumerable) language is a component of the least fixed-point of a system of equations in the form X = F(X), where X = (X1,…,Xt), F = (F1,…,Ft),t⩾1 and for all i, 1⩽i⩽t, Fi are regular expre ssions over the
openaire   +1 more source

Extension of embeddings in the recursively enumerable degrees

open access: yes, 2007
The extension of embeddings problem for the recursively enumerable degrees R = (R;!; 0; 0 0) asks for given finite partially ordered sets P ` Q with least and greatest elements, whether every embedding of P into R can be extended to an embedding of Q ...
Theodore A. Slaman, Robert I. Soare
core  

Post's Program and incomplete recursively enumerable sets

open access: yes, 1991
: A set A of nonnegative integers is recursively enumerable (r.e.) if A can be computably listed. It is shown that there is a first order property, Q(X), definable in E, the lattice of r.e. sets under inclusion, such that: (1) if A is any r.e.
Leo Harrington, Robert I. Soare
core  

Home - About - Disclaimer - Privacy