{"title":"MENAS’S CONJECTURE REVISITED","authors":"P. Matet","doi":"10.1017/bsl.2023.15","DOIUrl":"https://doi.org/10.1017/bsl.2023.15","url":null,"abstract":"Abstract In an article published in 1974, Menas conjectured that any stationary subset of can be split in many pairwise disjoint stationary subsets. Even though the conjecture was shown long ago by Baumgartner and Taylor to be consistently false, it is still haunting papers on . In which situations does it hold? How much of it can be proven in ZFC? We start with an abridged history of the conjecture, then we formulate a new version of it, and finally we keep weakening this new assertion until, building on the work of Usuba, we hit something we can prove.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91482215","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"A CLASSICAL MODAL THEORY OF LAWLESS SEQUENCES","authors":"Ethan Brauer","doi":"10.1017/bsl.2023.12","DOIUrl":"https://doi.org/10.1017/bsl.2023.12","url":null,"abstract":"Abstract Free choice sequences play a key role in the intuitionistic theory of the continuum and especially in the theorems of intuitionistic analysis that conflict with classical analysis, leading many classical mathematicians to reject the concept of a free choice sequence. By treating free choice sequences as potentially infinite objects, however, they can be comfortably situated alongside classical analysis, allowing a rapprochement of these two mathematical traditions. Building on recent work on the modal analysis of potential infinity, I formulate a modal theory of the free choice sequences known as lawless sequences. Intrinsically well-motivated axioms for lawless sequences are added to a background theory of classical second-order arithmetic, leading to a theory I call \u0000$MC_{LS}$\u0000 . This theory interprets the standard intuitionistic theory of lawless sequences and is conservative over the classical background theory.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86582130","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
G. Bezhanishvili, Salma Kuhlmann, K. Bimbó, Øystein Linnebo, P. Dybjer, A. Muscholl, A. Enayat, A. Pauly, Albert Atserias, Antonio Montalbán, M. Atten, V. D. Paiva, Clinton Conley, Christian Retoré, D. Macpherson, Nam Trang, Sandra Müller
{"title":"BSL volume 29 issue 1 Cover and Front matter","authors":"G. Bezhanishvili, Salma Kuhlmann, K. Bimbó, Øystein Linnebo, P. Dybjer, A. Muscholl, A. Enayat, A. Pauly, Albert Atserias, Antonio Montalbán, M. Atten, V. D. Paiva, Clinton Conley, Christian Retoré, D. Macpherson, Nam Trang, Sandra Müller","doi":"10.1017/bsl.2023.9","DOIUrl":"https://doi.org/10.1017/bsl.2023.9","url":null,"abstract":"The BULLETIN encourages submissions of Articles and Communications in all areas of logic, including mathematical or philosophical logic, logic in computer science or linguistics, the history or philosophy of logic","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88925645","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"BSL volume 29 issue 1 Cover and Back matter","authors":"","doi":"10.1017/bsl.2023.10","DOIUrl":"https://doi.org/10.1017/bsl.2023.10","url":null,"abstract":"","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84658339","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"TREE THEORY: Interpretability Between Weak First-Order Theories of Trees","authors":"Zlatan Damnjanovic","doi":"10.1017/bsl.2023.5","DOIUrl":"https://doi.org/10.1017/bsl.2023.5","url":null,"abstract":"","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-02-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74610936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"CONSTRUCTING NONSTANDARD HULLS AND LOEB MEASURES IN INTERNAL SET THEORIES","authors":"K. Hrbacek, M. Katz","doi":"10.1017/bsl.2022.43","DOIUrl":"https://doi.org/10.1017/bsl.2022.43","url":null,"abstract":"Abstract Currently the two popular ways to practice Robinson’s nonstandard analysis are the model-theoretic approach and the axiomatic/syntactic approach. It is sometimes claimed that the internal axiomatic approach is unable to handle constructions relying on external sets. We show that internal frameworks provide successful accounts of nonstandard hulls and Loeb measures. The basic fact this work relies on is that the ultrapower of the standard universe by a standard ultrafilter is naturally isomorphic to a subuniverse of the internal universe.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85394478","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Something Valid This Way Comes: A Study of Neologicism and Proof-Theoretic Validity","authors":"W. Stafford","doi":"10.1017/bsl.2022.16","DOIUrl":"https://doi.org/10.1017/bsl.2022.16","url":null,"abstract":"Abstract The interplay of philosophical ambitions and technical reality have given birth to rich and interesting approaches to explain the oft-claimed special character of mathematical and logical knowledge. Two projects stand out both for their audacity and their innovativeness. These are logicism and proof-theoretic semantics. This dissertation contains three chapters exploring the limits of these two projects. In both cases I find the formal results offer a mixed blessing to the philosophical projects. Chapter 1. Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. I re-explore this idea and discover that in the setting of the potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. I conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. Chapter 2. There have been several recent results bringing into focus the super-intuitionistic nature of most notions of proof-theoretic validity. But there has been very little work evaluating the consequences of these results. In this chapter, I explore the question of whether these results undermine the claim that proof-theoretic validity shows us which inferences follow from the meaning of the connectives when defined by their introduction rules. It is argued that the super-intuitionistic inferences are valid due to the correspondence between the treatment of the atomic formulas and more complex formulas. And so the goals of proof-theoretic validity are not undermined. Chapter 3. Prawitz (1971) conjectured that proof-theoretic validity offers a semantics for intuitionistic logic. This conjecture has recently been proven false by Piecha and Schroeder-Heister (2019). This chapter resolves one of the questions left open by this recent result by showing the extensional alignment of proof-theoretic validity and general inquisitive logic. General inquisitive logic is a generalisation of inquisitive semantics, a uniform semantics for questions and assertions. The chapter further defines a notion of quasi-proof-theoretic validity by restricting proof-theoretic validity to allow double negation elimination for atomic formulas and proves the extensional alignment of quasi-proof-theoretic validity and inquisitive logic. Abstract prepared by Will Stafford extracted partially from the dissertation. E-mail: stafford@flu.cas.cz URL: https://escholarship.org/uc/item/33c6h00c","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"72699610","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Boolean-Valued Models and Their Applications","authors":"Xinhe Wu","doi":"10.1017/bsl.2022.34","DOIUrl":"https://doi.org/10.1017/bsl.2022.34","url":null,"abstract":"Abstract Boolean-valued models generalize classical two-valued models by allowing arbitrary complete Boolean algebras as value ranges. The goal of my dissertation is to study Boolean-valued models and explore their philosophical and mathematical applications. In Chapter 1, I build a robust theory of first-order Boolean-valued models that parallels the existing theory of two-valued models. I develop essential model-theoretic notions like “Boolean-valuation,” “diagram,” and “elementary diagram,” and prove a series of theorems on Boolean-valued models, including the (strengthened) Soundness and Completeness Theorem, the Löwenheim–Skolem Theorems, the Elementary Chain Theorem, and many more. Chapter 2 gives an example of a philosophical application of Boolean-valued models. I apply Boolean-valued models to the language of mereology to model indeterminacy in the parthood relation. I argue that Boolean-valued semantics is the best degree-theoretic semantics for the language of mereology. In particular, it trumps the well-known alternative—fuzzy-valued semantics. I also show that, contrary to what many have argued, indeterminacy in parthood entails neither indeterminacy in existence nor indeterminacy in identity, though being compatible with both. Chapter 3 (joint work with Bokai Yao) gives an example of a mathematical application of Boolean-valued models. Scott and Solovay famously used Boolean-valued models on set theory to obtain relative consistency results. In Chapter 3, I investigate two ways of extending the Scott–Solovay construction to set theory with urelements. I argue that the standard way of extending the construction faces a serious problem, and offer a new way that is free from the problem. Abstract prepared by Xinhe Wu. E-mail: xinhewu@mit.edu","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91311533","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Independence Relations in Abstract Elementary Categories","authors":"M. Kamsma","doi":"10.1017/bsl.2022.27","DOIUrl":"https://doi.org/10.1017/bsl.2022.27","url":null,"abstract":"Abstract In model theory, a branch of mathematical logic, we can classify mathematical structures based on their logical complexity. This yields the so-called stability hierarchy. Independence relations play an important role in this stability hierarchy. An independence relation tells us which subsets of a structure contain information about each other, for example, linear independence in vector spaces yields such a relation. Some important classes in the stability hierarchy are stable, simple, and NSOP \u0000$_1$\u0000 , each being contained in the next. For each of these classes there exists a so-called Kim-Pillay style theorem. Such a theorem describes the interaction between independence relations and the stability hierarchy. For example, simplicity is equivalent to admitting a certain independence relation, which must then be unique. All of the above classically takes place in full first-order logic. Parts of it have already been generalised to other frameworks, such as continuous logic, positive logic, and even a very general category-theoretic framework. In this thesis we continue this work. We introduce the framework of AECats, which are a specific kind of accessible category. We prove that there can be at most one stable, simple, or NSOP \u0000$_1$\u0000 -like independence relation in an AECat. We thus recover (part of) the original stability hierarchy. For this we introduce the notions of long dividing, isi-dividing, and long Kim-dividing, which are based on the classical notions of dividing and Kim-dividing but are such that they work well without compactness. Switching frameworks, we generalise Kim-dividing in NSOP \u0000$_1$\u0000 theories to positive logic. We prove that Kim-dividing over existentially closed models has all the nice properties that it is known to have in full first-order logic. We also provide a full Kim-Pillay style theorem: a positive theory is NSOP \u0000$_1$\u0000 if and only if there is a nice enough independence relation, which then must be given by Kim-dividing. Abstract prepared by Mark Kamsma. E-mail: mark@markkamsma.nl. URL: https://markkamsma.nl/phd-thesis.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87825498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
