Computation over algebraic structures and a classification of undecidable problems

This model allows us to gain more insight into the reasons for unsolvability of algorithmic decision problems from different perspectives and investigates some classes of a hierarchy that is defined semantically by the authors' deterministic oracle machines and that can be syntactically characterized by formulas whose quantifiers range only over an enumerable set.