Expressive power of digraph solvability

@article{Bezem2012ExpressivePO,
  title={Expressive power of digraph solvability},
  author={Marc Bezem and Clemens Grabmayer and Michal Walicki},
  journal={Ann. Pure Appl. Logic},
  year={2012},
  volume={163},
  pages={200-213}
}
A kernel of a directed graph is a set of vertices without edges between them, such that every other vertex has a directed edge to a vertex in the kernel. A digraph possessing a kernel is called solvable. Solvability of digraphs is equivalent to satisfiability of theories of propositional logic. Based on a new normal form for such theories, this equivalence relates finitely branching digraphs to propositional logic, and arbitrary digraphs to infinitary propositional logic. While the… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 16 references

Kernel tower theory, I

Harvey Friedman
FOM 407 (email list); http: //cs.nyu.edu/pipermail/fom/2010-March/014507.html, • 2010
View 2 Excerpts
Highly Influenced

Subsystems of Second Order Arithmetic. Perspectives in Logic

Stephen G. Simpson
2009
View 1 Excerpt

Patterns of paradox

J. Symb. Log. • 2004
View 1 Excerpt

Consequences of the axiom of choice

Paul Howard, Jean E. Rubin
American Mathematical Society, • 1998
View 2 Excerpts

Similar Papers

Loading similar papers…