Summary: On a syntactic approximation to logics that capture
complexity classes
Argimiro Arratia
Dpto. de Matem´atica Aplicada
Facultad de Ciencias
Universidad de Valladolid
Valladolid 47005, Spain
arratia@mac.uva.es
Carlos E. Ortiz
Department of Mathematics
and Computer Science
Arcadia University
450 S. Easton Road,
Glenside, PA 19038-3295, U.S.A.
ortiz@arcadia.edu
Abstract
We formulate a formal syntax of approximate formulas for the logic with count-
ing quantifiers, SOLP, studied by us in [1], where we showed the following facts:
(i) In the presence of a built­in (linear) order, SOLP can describe NP­complete
problems and fragments of it capture classes like P and NL; (ii) weakening the or-

Source: Arratia, Argimiro A. - Departamento de Matemática Aplicada, Universidad de Valladolid

Collections: Mathematics