Fagin's theorem is a result in descriptive complexity theory that states that the set of all properties expressible in existential second-order logicâ€¦Â (More)

Semantic Scholar uses AI to extract papers important to this topic.

2014

2014

- Flavio Ferrarotti, Wei Ren, JosÃ© Maria Turull Torres
- Logic Journal of the IGPL
- 2014

It follows from the famous Faginâ€™s theorem that all problems in NP are expressible in existential second-order logic (âˆƒSO), andâ€¦Â (More)

Is this relevant?

2013

2013

- Shiguang Feng, Xishun Zhao
- Math. Log. Q.
- 2013

Descriptive complexity is one of the central issues in finite model theory. While computational complexity is concerned with theâ€¦Â (More)

Is this relevant?

2008

2008

After examining the P versus NP problem against the Kleene-Rosser paradox of the Î»-calculus [94], it was found that it representsâ€¦Â (More)

Is this relevant?

2007

2007

- Florent R. Madelaine, Iain A. Stewart
- SIAM J. Comput.
- 2007

In the early nineties, Feder and Vardi attempted to find a large sub-class of NP which exhibits a dichotomy; that is, where everyâ€¦Â (More)

Is this relevant?

2006

2006

- Annie Chateau, Malika More
- Math. Log. Q.
- 2006

The development of finite model theory is mainly due to the interest of the theoretical computer science community for thisâ€¦Â (More)

Is this relevant?

2005

2005

- Uffe Flarup Hansen, Klaus Meer
- MFCS
- 2005

We introduce and study certain classes of optimization problems over the real numbers. The classes are defined by logical meansâ€¦Â (More)

Is this relevant?

Review

2005

Review

2005

The raison dâ€™Ãªtre of descriptive complexity is the following The Computational Complexity of checking if an input has a propertyâ€¦Â (More)

Is this relevant?

2004

2004

- Georg Gottlob
- IJCAR
- 2004

This talk will report on the results achieved so far in the context of a research programme at the cutting point of logic, formalâ€¦Â (More)

Is this relevant?

2000

2000

Fagin's theorem, the first important result of descriptive complexity, asserts that a property of graphs is in NP if and only ifâ€¦Â (More)

Is this relevant?

1996

1996

- J. Antonio Medina, Neil Immerman
- LICS
- 1996

Fagink theorem characterizes NP as the set of decision problems that are expressible as second-order existential sentences, i.eâ€¦Â (More)

Is this relevant?