A second-order system for polytime reasoning based on Grädel's theorem

A second-order system for polytime reasoning based on Grädel's theorem (2001)

Cached

Download Links

Other Repositories/Bibliography

DBLP

by Stephen Cook , Antonina Kolokolova

Citations:

15 - 6 self

BibTeX

@MISC{Cook01asecond-order,
    author = {Stephen Cook and Antonina Kolokolova},
    title = {A second-order system for polytime reasoning based on Grädel's theorem },
    year = {2001}
}

Years of Citing Articles

Bookmark

OpenURL

Abstract

Citations

485	The Complexity of Relational Query Languages - Vardi - 1982
242	Generalized first-order spectra and polynomial-time recognizable sets - Fagin - 1974
236	The polynomial-time hierarchy - Stockmeyer - 1977
232	Descriptive complexity - Immerman - 1998
190	Bounded arithmetic, propositional logic, and complexity theory - Krajíček - 1995
126	On uniformity within NC - Barrington, Immerman, et al. - 1990
110	Feasibly constructive proofs and the propositional calculus - Cook - 1975
106	Bounded Arithmetic. Bibliopolis - Buss - 1986
79	Functional interpretations of feasibly constructive arithmetic - Cook, Urquhart - 1993
56	Notes on polynomially bounded arithmetic - Zambella - 1996
36	Capturing complexity classes by fragments of second-order logic - Gradel - 1992
35	Limits of Parallel Computation - Greenlaw, Hoover, et al. - 1995
27	Relating the bounded arithmetic and the polynomial time hierarchies - Buss - 1995
27	Descriptive characterizations of computational complexity - Leivant - 1989
27	RSUV isomorphism - Takeuti - 1993
25	Axiomatizations and conservation results for fragments of bounded arithmetic - Buss - 1990
18	On uniformity within - Barrington, Immerman, et al. - 1990
12	Generalized spectra and polynomial-time recognizable sets - Fagin - 1974
10	Gems of Theoretical Computer Science - Schoning, Pruim - 1998
7	CSC 2429S: Proof Complexity and Bounded Arithmetic. Course notes, URL: "http://www.cs.toronto.edu/,sacook/csc2429h - Cook - 1998
7	Relational queries computable in polytime - Immerman - 1986
6	Relating the provable collapse of P to NC and the power of logical theories - Cook - 1998
6	The expressive power of second order Horn logic - Grädel - 1991
4	Characterization of complexity classes in higher-order logic - Leivant - 1987
3	Bounded arithmetic and the polynomial time hierarchy - Krajicek, Pudl'ak, et al. - 1991
2	Axiomatizations and conservation results for fragments of bounded arithmetic. Contemporary Mathematics - Bibliopolis, Naples - 1986
1	An equivalence between second-order bounded domain bounded arithmetic and first-order bounded arithmetic - Razborov - 1993
1	Spring 1998a. CSC 2429S: Proof Complexity and Bounded Arithmetic, course notes, URL: "http://www.cs.toronto.edu/sacook/csc2429h - Cook
1	Relating the provable collapse of P to N C and the power of logical theories. DIMACS series in Discrete mathematics and theoretical computer science - Cook - 1998
1	Relational queries computable in polytime. Information and Control, 68:86 -104 - Immerman - 1986