Logics and admissible rules of constructive set theories. [PDF]
Iemhoff R, Passmann R.
europepmc +1 more source
A note on recursively enumerable classes of partial recursive functions
We prove that every recursively enumerable class of partial recursive functions with infinite domains must have a recursive witness array. The result gives a powerful method for proving properties of recursively enumerable classes.
Sub Algemeen Artificial Intelligence +2 more
core
Modern perspectives in Proof Theory. [PDF]
Aguilera JP, Pakhomov F, Weiermann A.
europepmc +1 more source
On the jumps of degrees below an recursively enumerable degree [PDF]
We consider the set of jumps below a Turing degree, given by JB(a) = {x(1) : x
Richard A. Shore +3 more
core +1 more source
Recursively enumerable languages and van Wijngaarden grammars
AbstractWe show that each re language can be generated by a minimal deterministic linear contextfree based strict normal VW-grammar. We also prove that each re language can be generated by a strict normal VW-grammar with at most one metanotion denoting a non-regular contextfree language.
openaire +2 more sources
On the degree of scattered context-sensitivity
In this paper, we prove that every recursively enumerable language can be generated by a scattered context grammar with no more than two context-sensitive ...
Meduna, Alexander, Fernau, Henning
core +1 more source
A short definition of a non-recursively enumerable set W⊆N, where N\W is recursively enumerable and the genesis of W is in number theory [PDF]
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 +1 more source
On characterization of recursively enumerable languages in terms of linear languages and VW-grammars
AbstractIt is proved that for any alphabet Σ there exist a homomorphism h, a deterministic minimal linear language L1 and a linear language L2 such that every recursively enumerable language R over Σ is of the form L = h(L1 ∩ L2 ∪ RL) for some regular language RL depending on L. Some other homomorphic characterizations are also presented.
openaire +2 more sources
Visualizing Quantum Circuit Probability: Estimating Quantum State Complexity for Quantum Program Synthesis. [PDF]
Bach BG, Kundu A, Acharya T, Sarkar A.
europepmc +1 more source
Ordered rings over which output sets are recursively enumerable sets
In a recent paper [BSS], L. Blum, M. Shub, and S. Smale developed a theory of computation over the reals and over commutative ordered rings; in § 9 \S 9 of [BSS] they showed that over the reals (and over any real ...
Christian Michaux
core +1 more source

