Fagin's theorem

Known as: Fagin theorem 
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)
Wikipedia

Topic mentions per year

Topic mentions per year

1996-2013
01219962013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
It follows from the famous Fagin’s theorem that all problems in NP are expressible in existential second-order logic (∃SO), and… (More)
  • figure 2.1
  • figure 3.2
  • figure 4.1
  • figure 6.1
  • figure 6.2
Is this relevant?
2013
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
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)
  • figure 2.1
  • figure 3.1
  • figure 4.1
  • figure 4.3
  • figure 4.4
Is this relevant?
2006
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
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
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)
  • figure 1
Is this relevant?
1996
1996
Fagink theorem characterizes NP as the set of decision problems that are expressible as second-order existential sentences, i.e… (More)
  • figure 1
  • figure 2
Is this relevant?