有据局部有限图中有限集理论的独立性结果

IF 0.6 3区数学 Q2 LOGIC

Studia Logica Pub Date : 2024-02-16 DOI:10.1007/s11225-023-10087-w

{"title":"有据局部有限图中有限集理论的独立性结果","authors":"","doi":"10.1007/s11225-023-10087-w","DOIUrl":null,"url":null,"abstract":"<h3>Abstract</h3> <p>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 <em>axiom closure of graphs</em>.</p>","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"26 1","pages":""},"PeriodicalIF":0.6000,"publicationDate":"2024-02-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Independence Results for Finite Set Theories in Well-Founded Locally Finite Graphs\",\"authors\":\"\",\"doi\":\"10.1007/s11225-023-10087-w\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<h3>Abstract</h3> <p>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 <em>axiom closure of graphs</em>.</p>\",\"PeriodicalId\":48979,\"journal\":{\"name\":\"Studia Logica\",\"volume\":\"26 1\",\"pages\":\"\"},\"PeriodicalIF\":0.6000,\"publicationDate\":\"2024-02-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Studia Logica\",\"FirstCategoryId\":\"100\",\"ListUrlMain\":\"https://doi.org/10.1007/s11225-023-10087-w\",\"RegionNum\":3,\"RegionCategory\":\"数学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"LOGIC\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Studia Logica","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1007/s11225-023-10087-w","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}

引用次数: 0

摘要

摘要我们考虑了与有限集合论（即不含无穷公理的 Zermelo-Fraenkel 集合论）子集相对应的所有组合上可能的系统，并为其中的每一个系统提供了一个作为该理论模型的基础良好的局部有限图，或者证明这是不可能的。为此，我们开发了图的公理闭包技术。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Studia Logica MATHEMATICS-LOGIC

CiteScore

1.70

自引率

14.30%

发文量

审稿时长

6-12 weeks

期刊介绍： The leading idea of Lvov-Warsaw School of Logic, Philosophy and Mathematics was to investigate philosophical problems by means of rigorous methods of mathematics. Evidence of the great success the School experienced is the fact that it has become generally recognized as Polish Style Logic. Today Polish Style Logic is no longer exclusively a Polish speciality. It is represented by numerous logicians, mathematicians and philosophers from research centers all over the world.