MFMC_Countable

MaRDI QIDQ53714swMATHFDO

Authors Andreas Lochbihler

Publication date 9 May 2016

Official website https://www.isa-afp.org/entries/MFMC_Countable.html

Cites work

• A formalized hierarchy of probabilistic system types. Proof pearl
• Funktionen auf Produkträumen mit vorgegebenen Marginal-Funktionen
• Menger's theorem for graphs containing no infinite paths
• The Max-Flow Min-Cut theorem for countable networks

Cited in

(5)

• A mechanized proof of the max-flow min-cut theorem for countable networks with applications to probability theory
• CryptHOL: game-based proofs in higher-order logic
• Zoo Probabilistic Systems
• Probabilistic_While
• Game_Based_Crypto

This page was built for software: MFMC_Countable