Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
In: Proceedings of the 33rd Annual ACM/IEEE Symposium on Logic in Computer Science , LICS ’18, Association for Comput- ing Machinery, New York, NY, USA, pp
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
verdicts
UNVERDICTED 3representative citing papers
Generalizes PDL to OPDL by distinguishing programs from traces via arbitrary operational semantics and proves cut-elimination for a non-wellfounded sequent calculus.
The qufinite ZXW calculus is complete for the category FHilb of finite-dimensional Hilbert spaces, as any diagram rewrites to a unique normal form.
citing papers explorer
-
Completeness for Probabilistic Boolean Tapes
Establishes a complete axiomatization for probabilistic Boolean circuits via Markov kernel semantics, using intermediate completeness theorems for partial Boolean circuits and probabilistic Boolean tapes in rig categories.
-
On Propositional Dynamic Logic and Concurrency
Generalizes PDL to OPDL by distinguishing programs from traces via arbitrary operational semantics and proves cut-elimination for a non-wellfounded sequent calculus.
-
Completeness of qufinite ZXW calculus, a graphical language for finite-dimensional quantum theory
The qufinite ZXW calculus is complete for the category FHilb of finite-dimensional Hilbert spaces, as any diagram rewrites to a unique normal form.