Insignificant Choice Polynomial Time

by   Klaus-Dieter Schewe, et al.

In the late 1980s Gurevich conjectured that there is no logic capturing PTIME, where logic has to be understood in a very general way comprising computation models over structures. In this article we first refute Gurevich's conjecture. For this we extend the seminal research of Blass, Gurevich and Shelah on choiceless polynomial time (CPT), which exploits deterministic Abstract State Machines (ASMs) supporting unbounded parallelism to capture the choiceless fragment of PTIME. CPT is strictly included in PTIME. We observe that choice is unavoidable, but that a restricted version suffices, which guarantees that the final result is independent from the choice. Such a version of polynomially bounded ASMs, which we call insignificant choice polynomial time (ICPT) will indeed capture PTIME. Even more, insignificant choice can be captured by ASMs with choice restricted to atoms such that a local insignificance condition is satisfied. As this condition can be expressed in the logic of non-deterministic ASMs, we obtain a logic capturing PTIME. Furthermore, using inflationary fixed-points we can capture problems in PTIME by fixed-point formulae in a fragment of the logic of non-deterministic ASMs plus inflationary fixed-points. We use this result for our second contribution showing that PTIME differs from NP. For the proof we build again on the research on CPT first establishing a limitation on permutation classes of the sets that can be activated by an ICPT computation. We then prove an equivalence theorem, which characterises structures that cannot be distinguished by the logic. In particular, this implies that SAT cannot be decided by an ICPT computation.


page 1

page 2

page 3

page 4


Choiceless Polynomial Time with Witnessed Symmetric Choice

We extend Choiceless Polynomial Time (CPT), the currently only remaining...

Separating Rank Logic from Polynomial Time

In the search for a logic capturing polynomial time the most promising c...

Deep Weisfeiler Leman

We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL),...

Complexity Thresholds in Inclusion Logic

Logics with team semantics provide alternative means for logical charact...

Limitations of the Invertible-Map Equivalences

This note draws conclusions that arise by combining two recent papers, b...

Probabilistic Complexity Classes through Semantics

In a recent paper, the author has shown how Interaction Graphs models fo...

Towards Capturing PTIME with no Counting Construct (but with a Choice Operator)

The central open question in Descriptive Complexity is whether there is ...

Please sign up or login with your details

Forgot password? Click here to reset