Results 31 to 40 of about 3,677,609 (156)
A decidable fragment of the elementary theory of the lattice of recursively enumerable sets
A natural class of sentences about the lattice of recursively enumerable sets modulo finite sets is shown to be decidable. This class properly contains the class of sentences previously shown to be decidable by Lachlan.
M. Lerman, R. I. Soare
core +1 more source
A method of encoding the computation histories of a wide class of machines is introduced and used to derive several representation theorems for the class of recursively enumerable languages. In particular it is demonstrated that any recursively enumerable language K ⊂ Σ* can be represented as K = ΦΣ(R ∩ D1 ⋮ D2), where D1 and D2 are fixed semi-Dyck ...
David Haussler, H. Paul Zeiger
openaire +1 more source
Recursively enumerable sets and well-ordering of their enumerations [PDF]
We will introduce the special kind of the order relations into recursively enumerable sets and prove that they can be used to distinguish (albeit in a non-constructive way) between recursive and non-recursive ...
Mycka, Jerzy
core
Implementation of Recursively Enumerable Languages in Universal Turing Machine
This paper presents the design and working of a Universal Turing Machine (UTM) for the JFLAP platform. Automata play a major role in compiler design and parsing. The class of formal languages that work for the most complex problems belong to the set of Recursively Enumerable Languages (REL).
Sumitha C. H, Krupa Ophelia Geddam
openaire +1 more source
The first order formulas preserved under ultrafilter extensions are not recursively enumerable [PDF]
In this short note, we prove that the first-order formulas preserved under ultrafilter extensions are not recursively ...
ten Cate, Balder
core
On pairs of recursively enumerable degrees
Lachlan and Yates proved that some, but not all, pairs of incomparable recursively enumerable (r.e.) degrees have an infimum. We answer some questions which arose from this situation. We show that not every nonzero incomplete r.e.
Klaus Ambos-Spies
core +1 more source
Some results on recursively enumerable degrees of weak reducibilities
Fischer P. Some results on recursively enumerable degrees of weak reducibilities.
Fischer, Paul
core
Difference Splittings of Recursively Enumerable Sets
We study here the degree-theoretic structure of set-theoretical splittings of recursively enumerable (r.e.) sets into differences of r.e. sets. As a corollary we deduce that the ordering of wtt-degrees of unsolvability of differences of r.e.
Arslanov, A
core +1 more source
Generating Sets for the Recursively Enumerable Turing Degrees
We give an example of a subset of the recursively enumerable Turing degrees which generates the recursively enumerable degrees using meet and join but does not generate them using join alone.
Theodore A. Slaman, Klaus Ambos-spies
core
Characterizing language identification by standardizing operations
Notions from formal language learning theory are characterized in terms of standardizing operations on classes of recursively enumerable languages. Algorithmic identification in the limit of grammars from text presentation of recursively enumerable ...
Sanjay Jain +3 more
core +1 more source

