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.
Title resolution pending
3 Pith papers cite this work, alongside 9 external citations. Polarity classification is still indexing.
3
Pith papers citing it
9
external citations · OpenAlex
verdicts
UNVERDICTED 3representative citing papers
Applies Halpern-Pearl actual causality to fault trees, providing a complete classification of causality notions via graph and logical structure and linking them to minimal cut sets.
Kleene-Cartesian rig categories equip tape diagrams to handle imperative programs and program logic.
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.
-
Actual causality in fault trees
Applies Halpern-Pearl actual causality to fault trees, providing a complete classification of causality notions via graph and logical structure and linking them to minimal cut sets.
-
A Diagrammatic Basis for Computer Programming
Kleene-Cartesian rig categories equip tape diagrams to handle imperative programs and program logic.