Journal of Symbolic Logic 67 (3):1093-1125 (2002)
This paper is motivated by the question whether there exists a logic capturing polynomial time computation over unordered structures. We consider several algorithmic problems near the border of the known, logically defined complexity classes contained in polynomial time. We show that fixpoint logic plus counting is stronger than might be expected, in that it can express the existence of a complete matching in a bipartite graph. We revisit the known examples that separate polynomial time from fixpoint plus counting. We show that the examples in a paper of Cai, Fürer, and Immerman, when suitably padded, are in choiceless polynomial time yet not in fixpoint plus counting. Without padding, they remain in polynomial time but appear not to be in choiceless polynomial time plus counting. Similar results hold for the multipede examples of Gurevich and Shelah, except that their final version of multipedes is, in a sense, already suitably padded. Finally, we describe another possible candidate, involving determinants, for the task of separating polynomial time from choiceless polynomial time plus counting
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
References found in this work BETA
Choiceless Polynomial Time.Andreas Blass, Yuri Gurevich & Saharon Shelah - 1999 - Annals of Pure and Applied Logic 100 (1-3):141-187.
Citations of this work BETA
Choiceless Polynomial Time, Counting and the Cai–Fürer–Immerman Graphs.Anuj Dawar, David Richerby & Benjamin Rossman - 2008 - Annals of Pure and Applied Logic 152 (1):31-50.
Symbioses Between Mathematical Logic and Computer Science.Andreas Blass - 2016 - Annals of Pure and Applied Logic 167 (10):868-878.
2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium'05.Stan S. Wainer - 2006 - Bulletin of Symbolic Logic 12 (2):310-361.
Similar books and articles
Proving Theorems of the Second Order Lambek Calculus in Polynomial Time.Erik Aarts - 1994 - Studia Logica 53 (3):373 - 387.
Time Polynomial in Input or Output.Yuri Gurevich & Saharon Shelah - 1989 - Journal of Symbolic Logic 54 (3):1083-1088.
The Expressive Power of Fixed-Point Logic with Counting.Martin Otto - 1996 - Journal of Symbolic Logic 61 (1):147-176.
Complexity, Decidability and Completeness.Douglas Cenzer & Jeffrey B. Remmel - 2006 - Journal of Symbolic Logic 71 (2):399 - 424.
Le Problème Des granDes Puissances Et Celui Des granDes Racines.Natacha Portier - 2000 - Journal of Symbolic Logic 65 (4):1675-1685.
Polynomial Time Operations in Explicit Mathematics.Thomas Strahm - 1997 - Journal of Symbolic Logic 62 (2):575-594.
Every Polynomial-Time 1-Degree Collapses If and Only If P = Pspace.Stephen A. Fenner, Stuart A. Kurtz & James S. Royer - 2004 - Journal of Symbolic Logic 69 (3):713-741.
Strong Extension Axioms and Shelah's Zero-One Law for Choiceless Polynomial Time.Andreas Blass & Yuri Gurevich - 2003 - Journal of Symbolic Logic 68 (1):65-131.
Added to index2009-01-28
Total downloads202 ( #20,071 of 2,164,579 )
Recent downloads (6 months)1 ( #347,995 of 2,164,579 )
How can I increase my downloads?