Re: Semantics of First-Order Languages

On 2008-04-02, in sci.logic, Thomas Käufl wrote:
please, would you be so kind and tell me what you mean
with "r.e.".

"Recursively enumerable", that is, enumerated by some recursive
function. A set A of naturals, or of objects we can in some suitable
way code as naturals, is recursively enumerable if it is empty or
there exists a computable ("recursive") function f such that A =
{f(0), f(1), f(2), ...}.

--
Aatu Koskensilta (aatu.koskensilta@xxxxxxxxx)

"Wovon man nicht sprechen kann, daruber muss man schweigen"
- Ludwig Wittgenstein, Tractatus Logico-Philosophicus
.