Starting with Hoare Logic over 50 years ago, numerous program logics have been devised to reason about the different kinds of programs encountered in the real world. This includes reasoning about computational effects, particularly those effects that cause the program execution to branch into multiple paths due to, e.g., nondeterministic or probabilistic choice. Outcome Logic reimagines Hoare Logic with branching at its core, using an algebraic representation of choice to capture programs that branch into many outcomes. In this article, we give a comprehensive account of the Outcome Logic metatheory. This includes a relatively complete proof system for Outcome Logic with the ability to reason about general purpose looping. We also show that this proof system applies to programs with various types of branching, that it subsumes some well-known logics such as Hoare Logic, and that it facilitates the reuse of proof fragments across different kinds of specifications.

@article{paperbot3304,
  title = {Outcome Logic: A Unified Approach to the Metatheory of Program Logics with Branching Effects},
  author = {Noam Zilberstein},
  journal = {ACM Transactions on Programming Languages and Systems},
  volume = {47},
  number = {3},
  year = {2025},
  doi = {10.1145/3743131}
}