On a syntactic approximation to logics that capture complexity classes

13 years 4 months ago

Download www.mac.cie.uva.es

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

Argimiro Arratia, Carlos E. Ortiz

Real-time Traffic

Approximate Formulas | Built-in Order | ECCC 2006 | Logic |

claim paper

Related Content

» Capture Complexity by Partition

» Approximating the Expressive Power of Logics in Finite Models

» Boolean Algebra of Shape Analysis Constraints

» FixedPoint Definability and Polynomial Time

» The Quest for a Logic Capturing PTIME

» Universal Approximation of a Class of Interval Type2 Fuzzy Neural Networks Illustrated wit...

» FixedPoint Definability and Polynomial Time on Chordal Graphs and Line Graphs

» Randomisation and Derandomisation in Descriptive Complexity Theory

» The Complexity of PolynomialTime Approximation

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2006
Where	ECCC
Authors	Argimiro Arratia, Carlos E. Ortiz

Comments (0)

Sciweavers

On a syntactic approximation to logics that capture complexity classes

Approximate Formulas | Built-in Order | ECCC 2006 | Logic |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers