On a syntactic approximation to logics that capture complexity classes

We formulate a formal syntax of approximate formulas for the logic with counting quantifiers, SOLP, studied by us in [1], where we showed the following facts: (i) In the presence of a built

• Type: Journal
• Year: 2006
• Where: ECCC
• Authors: Argimiro Arratia, Carlos E. Ortiz
• Keywords: Approximate Formulas, Built-in Order, ECCC 2006, Logic