The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
This paper is a survey of results on finite variable logics in finite model theory. It focusses on the common underlying techniques that unite many such results.
A modified version of the classical µ-operator as well as the
first value operator and the operator of inverting unary
functions, applied in combination with the composition of
functions and starting from the primitive recursive functions,
generate all arithmetically representable functions. Moreover, the
nesting levels of these operators are closely related to the
stratification of the arithmetical hierarchy. The same is shown
for some further function operators known from computability and complexity
theory....
Currently displaying 1 –
3 of
3