Results 61 to 70 of about 3,677,609 (156)

ISOMORPHISM OF LATTICES OF RECURSIVELY ENUMERABLE SETS

open access: yes, 2008
. Let ω = { 0, 1, 2,...}, and for A ⊆ ω, let E A be the lattice of subsets of ω which are recursively enumerable relative to the “oracle ” A. Let (E A) ∗ be E A /I, whereIis the ideal of finite subsets of ω.
Todd Hammond
core  

Naïve validity. [PDF]

open access: yesSynthese, 2021
Murzi J, Rossi L.
europepmc   +1 more source

On Sets Polynomially Enumerable by Iteration

open access: yes, 2012
Sets whose members are enumerated by some Turing machine are called recursively enumerable. We define a set to be polynomially enumerable by iteration if its members are efficiently enumerated by iterated application of some Turing machine.
Young, P.   +3 more
core  

A short arithmetical definition of a non-recursively enumerable set W⊆N whose genesis is in Number Theory

open access: yes
Let F(x,n) denote the formula ∃ab ∀i⩽n ∃swpq ∀jv ∃eg {(s+w)^2+3w+s=2i ∧ ⟨[j=w ∨ v=q] ∨ [j=3i ∧ v=p+q] ∨ [j=s ∧ (v=p ∨ (i=n ∧ v=q+x))] ∨ [j=3i+1 ∧ v=pq] ⇒ a=v+e+ejb ∧ v+g=b⟩} from J. P. Jones' article in vol. 43 of J. Symbolic Logic.
Apoloniusz Tyszka
core   +1 more source

On the Learnability of Recursively Enumerable Languages from Good Examples

open access: yes, 2008
The present paper investigates identification of indexed families L of recursively enumerable languages from good examples. We distinguish class preserving learning from good examples (the good examples have to be generated with respect to a hypothesis ...
Sanjay Jain A   +2 more
core  

A non-recursively enumerable subset of N which has a short definition in terms of arithmetic

open access: yes
Let F(x,n) denote the formula ∃ab ∀i⩽n ∃swpq ∀jv ∃eg {(s+w)^2+3w+s=2i ∧ ⟨[j=w ∨ v=q] ∨ [j=3i ∧ v=p+q] ∨ [j=s ∧ (v=p ∨ (i=n ∧ v=q+x))] ∨ [j=3i+1 ∧ v=pq] ⇒ a=v+e+ejb ∧ v+g=b⟩} from J. P. Jones' article in vol. 43 of J. Symbolic Logic.
Tyszka, Apoloniusz
core  

Effective λ-models versus recursively enumerable λ-theories

open access: yes, 2008
A longstanding open problem is whether there exists a non-syntactical model of the untyped λ-calculus whose theory is exactly the least λ-theory λβ. In this paper we investigate the more general question of whether the equational/order theory of a model ...
Giulio Manzonetto   +2 more
core  

Home - About - Disclaimer - Privacy