Journal of Symbolic Logic

On polynomial time computation over unordered structures

Andreas Blass, Yuri Gurevich, and Saharon Shelah

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber. If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text

Abstract

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.

Article information

Source
J. Symbolic Logic, Volume 67, Issue 3 (2002), 1093-1125.

Dates
First available in Project Euclid: 18 September 2007

Permanent link to this document
https://projecteuclid.org/euclid.jsl/1190150152

Digital Object Identifier
doi:10.2178/jsl/1190150152

Mathematical Reviews number (MathSciNet)
MR1926601

Zentralblatt MATH identifier
1020.03038

Subjects
Primary: 68Q19: Descriptive complexity and finite models [See also 03C13]
Secondary: 03B70: Logic in computer science [See also 68-XX] 03C13: Finite structures [See also 68Q15, 68Q19] 03D15: Complexity of computation (including implicit computational complexity) [See also 68Q15, 68Q17]

Citation

Blass, Andreas; Gurevich, Yuri; Shelah, Saharon. On polynomial time computation over unordered structures. J. Symbolic Logic 67 (2002), no. 3, 1093--1125. doi:10.2178/jsl/1190150152. https://projecteuclid.org/euclid.jsl/1190150152


Export citation