In this note we consider the following decision problems. Let be a fixed first-order signature. (i) Given a first-order theory or ground theory T over of Turing degree , a program...
The study of Borel equivalence relations under Borel reducibility has developed into an important area of descriptive set theory. The dichotomies of Silver ([19]) and Harrington-K...
Ekaterina B. Fokina, Sy-David Friedman, Asger T&ou...
We show that the concepts of strong and uniform equivalence of logic programs eneralized to an abstract algebraic setting of operators on complete lattices. Our results imply char...
Recently, the stable model semantics was extended to the syntax of arbitrary propositional formulas, which are beyond the traditional rule form. Cabalar and Ferraris, as well as Ca...
This paper is devoted to the analysis of network approximation in the framework of approximation and regularization theory. It is shown that training neural networks and similar n...