GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.
On the positive calculus of relations with transitive closure
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.LO 2years
2025 2verdicts
UNVERDICTED 2representative citing papers
Kleene-Cartesian rig categories equip tape diagrams to handle imperative programs and program logic.
citing papers explorer
-
Guarded Negation Transitive Closure Logic
GNTC satisfiability is 2ExpTime-complete and model checking is P^NP[O(log² n)]-complete via polynomial and exponential reductions to UNTC and 2-way alternating parity tree automata.
-
A Diagrammatic Basis for Computer Programming
Kleene-Cartesian rig categories equip tape diagrams to handle imperative programs and program logic.