10 citations · 15 across the 6 of their papers we have counts for
Showing 2022Show all
2 papers · 1 filter
cs.LO2022
Witnessed Symmetric Choice and Interpretations in Fixed-Point Logic with Counting
Moritz Lichter
At the core of the quest for a logic for PTime is a mismatch between algorithms making arbitrary choices and isomorphism-invariant logics. One approach to overcome this problem is…
cs.LO2022
Choiceless Polynomial Time with Witnessed Symmetric Choice
Moritz Lichter, Pascal Schweitzer
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…