We show that the first order theories of the Medevdev lattice and the Muchnik lattice are both computably isomorphic to the third order theory of the natural numbers.
One of the major interests of finite model theory is to separate the expressive power of different logics or fragments of logics. In this paper, we define a variant of EhrenfeuchtF...
An intelligent agent will often be uncertain about various properties of its environment, and when acting in that environment it will frequently need to quantify its uncertainty. ...
The ordered conjecture states that least fixed-point logic LFP is strictly more expressive than first-order logic FO on every infinite class of ordered finite structures. It has b...