Independence Results for Finite Set Theories in Well-Founded Locally Finite Graphs

Open Access
Authors
Publication date 10-2024
Journal Studia Logica
Volume | Issue number 112 | 5
Pages (from-to) 1181-1200
Number of pages 20
Organisations
  • Interfacultary Research - Institute for Logic, Language and Computation (ILLC)
Abstract Abstract We consider all combinatorially possible systems corresponding to subsets of finite set theory (i.e., Zermelo-Fraenkel set theory without the axiom of infinity) and for each of them either provide a well-founded locally finite graph that is a model of that theory or show that this is impossible. To that end, we develop the technique of axiom closure of graphs.
Document type Article
Language English
Published at https://doi.org/10.1007/s11225-023-10087-w
Downloads
s11225-023-10087-w (Final published version)
Permalink to this page
Back