@article{46737431-890d-4515-8788-b622a2eaa8aa,
author = {Roberta  Bonacina, Daniel  Misselbeck-Wessel},
title = {A formal approach to Menger's theorem},
journal = {Reports on Mathematical Logic},
volume = {2022},
number = {Number 57},
year = {2022},
issn = {0137-2904},
pages = {45-51},keywords = {Disjoint paths; separating set; inductive definition; entailment},
abstract = {Menger's graph theorem equates the minimum size of a separating set for non-adjacent vertices a and b with the maximum number of disjoint paths between a and b. By capturing separating sets as models of an entailment relation, we take a formal approach to Menger's result. Upon showing that inconsistency is characterised by the existence of suficiently many disjoint paths, we recover Menger's theorem by way of completeness.},
doi = {10.4467/20842589RM.22.003.16660},
url = {https://ejournals.eu/en/journal/reports-on-mathematical-logic/article/a-formal-approach-to-mengers-theorem}
}