Choiceless Polynomial Time with Witnessed Symmetric Choice

05/27/2022
by   Moritz Lichter, et al.
0

We extend Choiceless Polynomial Time (CPT), the currently only remaining promising candidate in the quest for a logic capturing PTime, so that this extended logic has the following property: for every class of structures for which isomorphism is definable, the logic automatically captures PTime. For the construction of this logic we extend CPT by a witnessed symmetric choice operator. This operator allows for choices from definable orbits. But, to ensure polynomial time evaluation, automorphisms have to be provided to certify that the choice set is indeed an orbit. We argue that, in this logic, definable isomorphism implies definable canonization. Thereby, our construction removes the non-trivial step of extending isomorphism definability results to canonization. This step was a part of proofs that show that CPT or other logics capture PTime on a particular class of structures. The step typically required substantial extra effort.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/27/2021

Separating Rank Logic from Polynomial Time

In the search for a logic capturing polynomial time the most promising c...
research
05/10/2020

Insignificant Choice Polynomial Time

In the late 1980s Gurevich conjectured that there is no logic capturing ...
research
03/24/2020

Deep Weisfeiler Leman

We introduce the framework of Deep Weisfeiler Leman algorithms (DeepWL),...
research
10/14/2022

Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting

At the core of the quest for a logic for PTime is a mismatch between alg...
research
01/22/2020

AMSNP: a tame fragment of existential second-order logic

Amalgamation monotone SNP (AMSNP) is a fragment of existential second-or...
research
11/15/2021

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

The central open question in Descriptive Complexity is whether there is ...
research
09/15/2021

Limitations of the Invertible-Map Equivalences

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

Please sign up or login with your details

Forgot password? Click here to reset