{"title":"Pathologies in satisfaction classes","authors":"Athar Abdul-Quader , Mateusz Łełyk","doi":"10.1016/j.apal.2023.103387","DOIUrl":null,"url":null,"abstract":"<div><p>We study subsets of countable recursively saturated models of <span><math><mi>PA</mi></math></span> which can be defined using pathologies in satisfaction classes. More precisely, we characterize those subsets <em>X</em> such that there is a satisfaction class <em>S</em> where <em>S</em> behaves correctly on an idempotent disjunction of length <em>c</em> if and only if <span><math><mi>c</mi><mo>∈</mo><mi>X</mi></math></span>. We generalize this result to characterize several types of pathologies including double negations, blocks of extraneous quantifiers, and binary disjunctions and conjunctions. We find a surprising relationship between the cuts which can be defined in this way and arithmetic saturation: namely, a countable nonstandard model is arithmetically saturated if and only if every cut can be the “idempotent disjunctively correct cut” in some satisfaction class. We describe the relationship between types of pathologies and the closure properties of the cuts defined by these pathologies.</p></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"175 2","pages":"Article 103387"},"PeriodicalIF":0.6000,"publicationDate":"2023-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Pure and Applied Logic","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0168007223001446","RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0
Abstract
We study subsets of countable recursively saturated models of which can be defined using pathologies in satisfaction classes. More precisely, we characterize those subsets X such that there is a satisfaction class S where S behaves correctly on an idempotent disjunction of length c if and only if . We generalize this result to characterize several types of pathologies including double negations, blocks of extraneous quantifiers, and binary disjunctions and conjunctions. We find a surprising relationship between the cuts which can be defined in this way and arithmetic saturation: namely, a countable nonstandard model is arithmetically saturated if and only if every cut can be the “idempotent disjunctively correct cut” in some satisfaction class. We describe the relationship between types of pathologies and the closure properties of the cuts defined by these pathologies.
期刊介绍：
The journal Annals of Pure and Applied Logic publishes high quality papers in all areas of mathematical logic as well as applications of logic in mathematics, in theoretical computer science and in other related disciplines. All submissions to the journal should be mathematically correct, well written (preferably in English)and contain relevant new results that are of significant interest to a substantial number of logicians. The journal also considers submissions that are somewhat too long to be published by other journals while being too short to form a separate memoir provided that they are of particular outstanding quality and broad interest. In addition, Annals of Pure and Applied Logic occasionally publishes special issues of selected papers from well-chosen conferences in pure and applied logic.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
