Elementary submodels in infinite combinatorics - Mathematics > LogicReportar como inadecuado




Elementary submodels in infinite combinatorics - Mathematics > Logic - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Abstract: The usage of elementary submodels is a simple but powerful method to provetheorems, or to simplify proofs in infinite combinatorics. First we introduceall the necessary concepts of logic, then we prove classical theorems usingelementary submodels. We also present a new proof of Nash-Williams-s theorem oncycle-decomposition of graphs, and finally we improve a decomposition theoremof Laviolette concerning bond-faithful decompositions of graphs.



Autor: Lajos Soukup

Fuente: https://arxiv.org/







Documentos relacionados