<--- Back to Details
First PageDocument Content
Computational complexity theory / Logic / Complexity classes / Mathematical logic / PSPACE / FO / Second-order logic / P versus NP problem / Constraint satisfaction problem / NP / P / Constraint satisfaction
Date: 2009-11-10 10:57:12
Computational complexity theory
Logic
Complexity classes
Mathematical logic
PSPACE
FO
Second-order logic
P versus NP problem
Constraint satisfaction problem
NP
P
Constraint satisfaction

Logic, Computation and Constraint Satisfaction Barnaby D. Martin University of Leicester

Add to Reading List

Source URL: www.bedewell.com

Download Document from Source Website

File Size: 942,69 KB

Share Document on Facebook

Similar Documents

SECOND-ORDER LOGIC, OR: HOW I LEARNED TO STOP WORRYING AND LOVE THE INCOMPLETENESS THEOREMS ETHAN JERZAK Abstract. First-order logic enjoys a nearly universal status as the language in which mathematics is done—or at l

DocID: 1uSZH - View Document

Symposium on Theoretical Aspects of Computer ScienceBordeaux), ppwww.stacs-conf.org COMPATIBILITY OF SHELAH AND STUPP’S AND MUCHNIK’S ITERATION WITH FRAGMENTS OF MONADIC SECOND ORDER LOGIC

DocID: 1uvLn - View Document

On the Parameterised Intractability of Monadic Second-Order Logic Stephan Kreutzer ⋆ Oxford University Computing Laboratory, Abstract. One of Courcelle’s celebrated results states that if C

DocID: 1ukbw - View Document

Prof. Dr. Mircea Dumitru Lucrări publicate și activitate științifică Prof. dr. Mircea Dumitru Cărţi 1.On Incompleteness in Modal Logic. An Account through Second-Order Logic, UMI, A

DocID: 1uhIL - View Document

Lower Bounds for the Complexity of Monadic Second-Order Logic Stephan Kreutzer University of Oxford Abstract—Courcelle’s famous theorem from 1990 states that

DocID: 1u3XX - View Document