首页 > 最新文献

The Review of Symbolic Logic最新文献

英文 中文
ANSELM’S ONTOLOGICAL ARGUMENT AND GRADES OF BEING 安瑟伦的本体论论证和存在等级
Pub Date : 2024-09-13 DOI: 10.1017/s1755020324000133
CHARLES McCARTY

Anselm described god as “something than which nothing greater can be thought” [1, p. 93], and Descartes viewed him as “a supreme being” [7, p. 122]. I first capture those characterizations formally in a simple language for monadic predicate logic. Next, I construct a model class inspired by Stoic and medieval doctrines of grades of being [8, 20]. Third, I prove the models sufficient for recovering, as internal mathematics, the famous ontological argument of Anselm, and show that argument to be, on this formalization, valid. Fourth, I extend the models to incorporate a modality fit for proving that any item than which necessarily no greater can be thought is also necessarily real. Lastly, with the present approach, I blunt the sharp edges of notable objections to ontological arguments by Gaunilo and by Grant. A trigger warning: every page of this writing flouts the old saw “Existence is not a predicate” and flagrantly.

安瑟伦把神描述为 "没有比它更伟大的东西了"[1,第 93 页],而笛卡尔则把神视为 "至高无上的存在"[7,第 122 页]。我首先用一元谓词逻辑的简单语言正式捕捉这些特征。接下来,我受斯多葛派和中世纪存在等级学说的启发,构建了一个模型类[8, 20]。第三,我证明这些模型足以作为内部数学恢复安瑟伦著名的本体论论证,并证明该论证在这种形式化上是有效的。第四,我对模型进行了扩展,以纳入一种适合于证明任何必然不能被认为比之更大的东西也必然是实在的模态。最后,通过本方法,我钝化了高尼洛和格兰特对本体论论证的著名反对意见的锋芒。一个触发式警告:这篇文章的每一页都在公然藐视 "存在不是谓词 "这个老掉牙的说法。
{"title":"ANSELM’S ONTOLOGICAL ARGUMENT AND GRADES OF BEING","authors":"CHARLES McCARTY","doi":"10.1017/s1755020324000133","DOIUrl":"https://doi.org/10.1017/s1755020324000133","url":null,"abstract":"<p>Anselm described god as “something than which nothing greater can be thought” [1, p. 93], and Descartes viewed him as “a supreme being” [7, p. 122]. I first capture those characterizations formally in a simple language for monadic predicate logic. Next, I construct a model class inspired by Stoic and medieval doctrines of <span>grades of being</span> [8, 20]. Third, I prove the models sufficient for recovering, as internal mathematics, the famous ontological argument of Anselm, and show that argument to be, on this formalization, valid. Fourth, I extend the models to incorporate a modality fit for proving that any item than which necessarily no greater can be thought is also necessarily real. Lastly, with the present approach, I blunt the sharp edges of notable objections to ontological arguments by Gaunilo and by Grant. A trigger warning: every page of this writing flouts the old saw “Existence is not a predicate” and flagrantly.</p>","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"59 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142204716","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}
引用次数: 0
WHEN NO PRICE IS RIGHT 无价之宝
Pub Date : 2024-05-14 DOI: 10.1017/s1755020324000017
MARK J. SCHERVISH, TEDDY SEIDENFELD, JOSEPH B. KADANE, RUOBIN GONG, RAFAEL B. STERN

In this paper, we show how to represent a non-Archimedean preference over a set of random quantities by a nonstandard utility function. Non-Archimedean preferences arise when some random quantities have no fair price. Two common situations give rise to non-Archimedean preferences: random quantities whose values must be greater than every real number, and strict preferences between random quantities that are deemed closer in value than every positive real number. We also show how to extend a non-Archimedean preference to a larger set of random quantities. The random quantities that we consider include real-valued random variables, horse lotteries, and acts in the theory of Savage. In addition, we weaken the state-independent utility assumptions made by the existing theories and give conditions under which the utility that represents preference is the expected value of a state-dependent utility with respect to a probability over states.

在本文中,我们展示了如何用非标准效用函数来表示对一组随机数量的非阿基米德偏好。当某些随机量没有公平价格时,就会出现非阿基米德偏好。产生非阿基米德偏好的两种常见情况是:随机量的值必须大于每一个实数,以及随机量之间的严格偏好,这些随机量的值被认为比每一个正实数更接近。我们还展示了如何将非阿基米德偏好扩展到更大的随机量集合。我们考虑的随机量包括实值随机变量、马彩票和萨维奇理论中的行为。此外,我们还弱化了现有理论中与状态无关的效用假设,并给出了代表偏好的效用是与状态有关的效用的期望值的条件。
{"title":"WHEN NO PRICE IS RIGHT","authors":"MARK J. SCHERVISH, TEDDY SEIDENFELD, JOSEPH B. KADANE, RUOBIN GONG, RAFAEL B. STERN","doi":"10.1017/s1755020324000017","DOIUrl":"https://doi.org/10.1017/s1755020324000017","url":null,"abstract":"<p>In this paper, we show how to represent a non-Archimedean preference over a set of random quantities by a nonstandard utility function. Non-Archimedean preferences arise when some random quantities have no fair price. Two common situations give rise to non-Archimedean preferences: random quantities whose values must be greater than every real number, and strict preferences between random quantities that are deemed closer in value than every positive real number. We also show how to extend a non-Archimedean preference to a larger set of random quantities. The random quantities that we consider include real-valued random variables, horse lotteries, and acts in the theory of Savage. In addition, we weaken the state-independent utility assumptions made by the existing theories and give conditions under which the utility that represents preference is the expected value of a state-dependent utility with respect to a probability over states.</p>","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"182 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140931346","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}
引用次数: 0
ON THE STRUCTURE OF BOCHVAR ALGEBRAS 关于布尔代数结构的研究
Pub Date : 2024-05-09 DOI: 10.1017/s175502032400008x
STEFANO BONZIO, MICHELE PRA BALDI

Bochvar algebras consist of the quasivariety $mathsf {BCA}$ playing the role of equivalent algebraic semantics for Bochvar (external) logic, a logical formalism introduced by Bochvar [4] in the realm of (weak) Kleene logics. In this paper, we provide an algebraic investigation of the structure of Bochvar algebras. In particular, we prove a representation theorem based on Płonka sums and investigate the lattice of subquasivarieties, showing that Bochvar (external) logic has only one proper extension (apart from classical logic), algebraized by the subquasivariety $mathsf {NBCA}$ of $mathsf {BCA}$. Furthermore, we address the problem of (passive) structural completeness ((P)SC) for each of them, showing that $mathsf {NBCA}$ is SC, while $mathsf {BCA}$ is not even PSC. Finally, we prove that both $mathsf {BCA}$ and $mathsf {NBCA}$ enjoy the amalgamation property (AP).

波赫瓦尔(外)逻辑是波赫瓦尔[4]在(弱)克莱因逻辑领域提出的一种逻辑形式主义,由扮演波赫瓦尔(外)逻辑等价代数语义角色的准变量 $mathsf {BCA}$ 组成。在本文中,我们用代数方法研究了波赫瓦尔代数的结构。特别是,我们证明了一个基于普隆卡和的表示定理,并研究了子类群的晶格,表明波赫瓦尔(外部)逻辑只有一个适当的扩展(古典逻辑除外),即由 $mathsf {BCA}$ 的子类群 $mathsf {NBCA}$ 代数化。此外,我们还讨论了它们各自的(被动)结构完备性((P)SC)问题,证明了 $mathsf {NBCA}$ 是 SC,而 $mathsf {BCA}$ 甚至不是 PSC。最后,我们证明 $mathsf {BCA}$ 和 $mathsf {NBCA}$ 都享有合并属性 (AP)。
{"title":"ON THE STRUCTURE OF BOCHVAR ALGEBRAS","authors":"STEFANO BONZIO, MICHELE PRA BALDI","doi":"10.1017/s175502032400008x","DOIUrl":"https://doi.org/10.1017/s175502032400008x","url":null,"abstract":"<p>Bochvar algebras consist of the quasivariety <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240530141428462-0247:S175502032400008X:S175502032400008X_inline1.png\"><span data-mathjax-type=\"texmath\"><span>$mathsf {BCA}$</span></span></img></span></span> playing the role of equivalent algebraic semantics for Bochvar (external) logic, a logical formalism introduced by Bochvar [4] in the realm of (weak) Kleene logics. In this paper, we provide an algebraic investigation of the structure of Bochvar algebras. In particular, we prove a representation theorem based on Płonka sums and investigate the lattice of subquasivarieties, showing that Bochvar (external) logic has only one proper extension (apart from classical logic), algebraized by the subquasivariety <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240530141428462-0247:S175502032400008X:S175502032400008X_inline2.png\"><span data-mathjax-type=\"texmath\"><span>$mathsf {NBCA}$</span></span></img></span></span> of <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240530141428462-0247:S175502032400008X:S175502032400008X_inline3.png\"><span data-mathjax-type=\"texmath\"><span>$mathsf {BCA}$</span></span></img></span></span>. Furthermore, we address the problem of (passive) structural completeness ((P)SC) for each of them, showing that <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240530141428462-0247:S175502032400008X:S175502032400008X_inline4.png\"><span data-mathjax-type=\"texmath\"><span>$mathsf {NBCA}$</span></span></img></span></span> is SC, while <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240530141428462-0247:S175502032400008X:S175502032400008X_inline5.png\"><span data-mathjax-type=\"texmath\"><span>$mathsf {BCA}$</span></span></img></span></span> is not even PSC. Finally, we prove that both <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240530141428462-0247:S175502032400008X:S175502032400008X_inline6.png\"><span data-mathjax-type=\"texmath\"><span>$mathsf {BCA}$</span></span></img></span></span> and <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240530141428462-0247:S175502032400008X:S175502032400008X_inline7.png\"><span data-mathjax-type=\"texmath\"><span>$mathsf {NBCA}$</span></span></img></span></span> enjoy the amalgamation property (AP).</p>","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"31 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141191277","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}
引用次数: 0
THE TEMPORAL CONTINUUM 时间连续性
Pub Date : 2024-04-12 DOI: 10.1017/s1755020324000078
MOHAMMAD ARDESHIR, RASOUL RAMEZANIAN

The continuum has been one of the most controversial topics in mathematics since the time of the Greeks. Some mathematicians, such as Euclid and Cantor, held the position that a line is composed of points, while others, like Aristotle, Weyl, and Brouwer, argued that a line is not composed of points but rather a matrix of a continued insertion of points. In spite of this disagreement on the structure of the continuum, they did distinguish the temporal line from the spatial line. In this paper, we argue that there is indeed a difference between the intuition of the spatial continuum and the intuition of the temporal continuum. The main primary aspect of the temporal continuum, in contrast with the spatial continuum, is the notion of orientation.

The continuum has usually been mathematically modeled by Cauchy sequences and the Dedekind cuts. While in the first model, each point can be approximated by rational numbers, in the second one, that is not possible constructively. We argue that points on the temporal continuum cannot be approximated by rationals as a temporal point is a flow that sinks to the past. In our model, the continuum is a collection of constructive Dedekind cuts, and we define two topologies for temporal continuum: 1. oriented topology and 2. the ordinary topology. We prove that every total function from the oriented topological space to the ordinary one is continuous.

自古希腊时代以来,连续统一直是数学界最具争议的话题之一。一些数学家,如欧几里得和康托尔,认为线是由点组成的,而另一些数学家,如亚里士多德、韦尔和布劳威尔,则认为线不是由点组成的,而是点不断插入的矩阵。尽管在连续体的结构上存在分歧,但他们确实区分了时间线和空间线。在本文中,我们认为空间连续体的直觉与时间连续体的直觉确实存在差异。与空间连续体相比,时间连续体的主要方面是方位概念。在前一种模型中,每个点都可以用有理数来近似,而在后一种模型中,这在构造上是不可能的。我们认为,时间连续体上的点不能用有理数来逼近,因为时间点是汇入过去的流。在我们的模型中,时间连续体是构造性戴德金切分的集合,我们为时间连续体定义了两种拓扑:1.定向拓扑和 2.普通拓扑。我们证明,从定向拓扑空间到普通拓扑空间的每个总函数都是连续的。
{"title":"THE TEMPORAL CONTINUUM","authors":"MOHAMMAD ARDESHIR, RASOUL RAMEZANIAN","doi":"10.1017/s1755020324000078","DOIUrl":"https://doi.org/10.1017/s1755020324000078","url":null,"abstract":"<p>The continuum has been one of the most controversial topics in mathematics since the time of the Greeks. Some mathematicians, such as Euclid and Cantor, held the position that a line is composed of points, while others, like Aristotle, Weyl, and Brouwer, argued that a line is not composed of points but rather a matrix of a continued insertion of points. In spite of this disagreement on the structure of the continuum, they did distinguish the <span>temporal line</span> from the <span>spatial line</span>. In this paper, we argue that there is indeed a difference between the intuition of the spatial continuum and the intuition of the temporal continuum. The main primary aspect of the temporal continuum, in contrast with the spatial continuum, is the notion of <span>orientation</span>.</p><p>The continuum has usually been mathematically modeled by <span>Cauchy</span> sequences and the <span>Dedekind</span> cuts. While in the first model, each point can be approximated by rational numbers, in the second one, that is not possible constructively. We argue that points on the temporal continuum cannot be approximated by rationals as a temporal point is a <span>flow</span> that sinks to the past. In our model, the continuum is a collection of constructive <span>Dedekind</span> cuts, and we define two topologies for temporal continuum: 1. <span>oriented</span> topology and 2. the <span>ordinary</span> topology. We prove that every total function from the <span>oriented</span> topological space to the <span>ordinary</span> one is continuous.</p>","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"10 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-04-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140931138","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}
引用次数: 0
ARROW’S THEOREM, ULTRAFILTERS, AND REVERSE MATHEMATICS 箭矢定理、超滤波器和逆向数学
Pub Date : 2024-02-29 DOI: 10.1017/s1755020324000054
BENEDICT EASTAUGH

This paper initiates the reverse mathematics of social choice theory, studying Arrow’s impossibility theorem and related results including Fishburn’s possibility theorem and the Kirman–Sondermann theorem within the framework of reverse mathematics. We formalise fundamental notions of social choice theory in second-order arithmetic, yielding a definition of countable society which is tractable in ${mathsf {RCA}}_0$. We then show that the Kirman–Sondermann analysis of social welfare functions can be carried out in ${mathsf {RCA}}_0$. This approach yields a proof of Arrow’s theorem in ${mathsf {RCA}}_0$, and thus in $mathrm {PRA}$, since Arrow’s theorem can be formalised as a $Pi ^0_1$ sentence. Finally we show that Fishburn’s possibility theorem for countable societies is equivalent to ${mathsf {ACA}}_0$ over ${mathsf {RCA}}_0$.

本文开创了社会选择理论的逆向数学,在逆向数学的框架内研究了阿罗的不可能性定理和相关结果,包括菲什伯恩的可能性定理和基尔曼-桑德曼定理。我们用二阶算术形式化了社会选择理论的基本概念,得出了可数社会的定义,这个定义在 ${mathsf {RCA}}_0$ 中是可行的。然后,我们证明社会福利函数的基尔曼-桑德曼分析可以在 ${mathsf {RCA}}_0$ 中进行。这种方法可以在 ${mathsf {RCA}}_0$ 中证明阿罗定理,从而在 $mathrm {PRA}$ 中证明阿罗定理,因为阿罗定理可以形式化为一个 $Pi ^0_1$ 句子。最后,我们证明菲什伯恩的可数社会可能性定理等价于 ${mathsf {ACA}}_0$ over ${mathsf {RCA}}_0$。
{"title":"ARROW’S THEOREM, ULTRAFILTERS, AND REVERSE MATHEMATICS","authors":"BENEDICT EASTAUGH","doi":"10.1017/s1755020324000054","DOIUrl":"https://doi.org/10.1017/s1755020324000054","url":null,"abstract":"<p>This paper initiates the reverse mathematics of social choice theory, studying Arrow’s impossibility theorem and related results including Fishburn’s possibility theorem and the Kirman–Sondermann theorem within the framework of reverse mathematics. We formalise fundamental notions of social choice theory in second-order arithmetic, yielding a definition of countable society which is tractable in <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240405151338335-0717:S1755020324000054:S1755020324000054_inline1.png\"><span data-mathjax-type=\"texmath\"><span>${mathsf {RCA}}_0$</span></span></img></span></span>. We then show that the Kirman–Sondermann analysis of social welfare functions can be carried out in <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240405151338335-0717:S1755020324000054:S1755020324000054_inline2.png\"><span data-mathjax-type=\"texmath\"><span>${mathsf {RCA}}_0$</span></span></img></span></span>. This approach yields a proof of Arrow’s theorem in <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240405151338335-0717:S1755020324000054:S1755020324000054_inline3.png\"><span data-mathjax-type=\"texmath\"><span>${mathsf {RCA}}_0$</span></span></img></span></span>, and thus in <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240405151338335-0717:S1755020324000054:S1755020324000054_inline4.png\"><span data-mathjax-type=\"texmath\"><span>$mathrm {PRA}$</span></span></img></span></span>, since Arrow’s theorem can be formalised as a <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240405151338335-0717:S1755020324000054:S1755020324000054_inline5.png\"><span data-mathjax-type=\"texmath\"><span>$Pi ^0_1$</span></span></img></span></span> sentence. Finally we show that Fishburn’s possibility theorem for countable societies is equivalent to <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240405151338335-0717:S1755020324000054:S1755020324000054_inline6.png\"><span data-mathjax-type=\"texmath\"><span>${mathsf {ACA}}_0$</span></span></img></span></span> over <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240405151338335-0717:S1755020324000054:S1755020324000054_inline7.png\"><span data-mathjax-type=\"texmath\"><span>${mathsf {RCA}}_0$</span></span></img></span></span>.</p>","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"227 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140574667","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}
引用次数: 0
CONCEPTUAL DISTANCE AND ALGEBRAS OF CONCEPTS 概念距离和概念库
Pub Date : 2024-02-22 DOI: 10.1017/s1755020324000029
MOHAMED KHALED, GERGELY SZÉKELY

We show that the conceptual distance between any two theories of first-order logic is the same as the generator distance between their Lindenbaum–Tarski algebras of concepts. As a consequence of this, we show that, for any two arbitrary mathematical structures, the generator distance between their meaning algebras (also known as cylindric set algebras) is the same as the conceptual distance between their first-order logic theories. As applications, we give a complete description for the distances between meaning algebras corresponding to structures having at most three elements and show that this small network represents all the possible conceptual distances between complete theories. As a corollary of this, we will see that there are only two non-trivial structures definable on three-element sets up to conceptual equivalence (i.e., up to elementary plus definitional equivalence).

我们证明,任何两个一阶逻辑理论之间的概念距离,都与它们的林登鲍姆-塔尔斯基(Lindenbaum-Tarski)概念代数之间的生成器距离相同。因此,我们证明,对于任意两个数学结构,它们的意义代数(也称为圆柱集合代数)之间的生成器距离与它们的一阶逻辑理论之间的概念距离相同。作为应用,我们给出了与最多有三个元素的结构相对应的意义层之间距离的完整描述,并证明这个小网络代表了完整理论之间所有可能的概念距离。作为其推论,我们将看到在三元素集合上只有两种非三维结构可以定义,直到概念等价(即直到基本等价加上定义等价)。
{"title":"CONCEPTUAL DISTANCE AND ALGEBRAS OF CONCEPTS","authors":"MOHAMED KHALED, GERGELY SZÉKELY","doi":"10.1017/s1755020324000029","DOIUrl":"https://doi.org/10.1017/s1755020324000029","url":null,"abstract":"<p>We show that the conceptual distance between any two theories of first-order logic is the same as the generator distance between their Lindenbaum–Tarski algebras of concepts. As a consequence of this, we show that, for any two arbitrary mathematical structures, the generator distance between their meaning algebras (also known as cylindric set algebras) is the same as the conceptual distance between their first-order logic theories. As applications, we give a complete description for the distances between meaning algebras corresponding to structures having at most three elements and show that this small network represents all the possible conceptual distances between complete theories. As a corollary of this, we will see that there are only two non-trivial structures definable on three-element sets up to conceptual equivalence (i.e., up to elementary plus definitional equivalence).</p>","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"66 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140054049","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}
引用次数: 0
BEYOND LINGUISTIC INTERPRETATION IN THEORY COMPARISON 在理论比较中超越语言解释
Pub Date : 2023-12-21 DOI: 10.1017/s1755020323000321
TOBY MEADOWS

This paper assembles a unifying framework encompassing a wide variety of mathematical instruments used to compare different theories. The main theme will be the idea that theory comparison techniques are most easily grasped and organized through the lens of category theory. The paper develops a table of different equivalence relations between theories and then answers many of the questions about how those equivalence relations are themselves related to each other. We show that Morita equivalence fits into this framework and provide answers to questions left open in Barrett and Halvorson [4]. We conclude by setting up a diagram of known relationships and leave open some questions for future work.

本文将建立一个统一的框架,涵盖用于比较不同理论的各种数学工具。本文的主题是,理论比较技术最容易通过范畴论的视角来把握和组织。本文列出了不同理论之间的等价关系表,然后回答了许多关于这些等价关系如何相互关联的问题。我们展示了莫里塔等价关系与这一框架的契合,并为巴雷特和哈尔沃森[4]提出的问题提供了答案。最后,我们建立了一个已知关系图,并为今后的工作提出了一些问题。
{"title":"BEYOND LINGUISTIC INTERPRETATION IN THEORY COMPARISON","authors":"TOBY MEADOWS","doi":"10.1017/s1755020323000321","DOIUrl":"https://doi.org/10.1017/s1755020323000321","url":null,"abstract":"<p>This paper assembles a unifying framework encompassing a wide variety of mathematical instruments used to compare different theories. The main theme will be the idea that theory comparison techniques are most easily grasped and organized through the lens of category theory. The paper develops a table of different equivalence relations between theories and then answers many of the questions about how those equivalence relations are themselves related to each other. We show that Morita equivalence fits into this framework and provide answers to questions left open in Barrett and Halvorson [4]. We conclude by setting up a diagram of known relationships and leave open some questions for future work.</p>","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138825468","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}
引用次数: 0
PARACONSISTENT AND PARACOMPLETE ZERMELO–FRAENKEL SET THEORY 准一致和准完全泽梅洛-弗兰克尔集合论
Pub Date : 2023-12-13 DOI: 10.1017/s1755020323000382
YURII KHOMSKII, HRAFN VALTÝR ODDSSON

We present a novel treatment of set theory in a four-valued paraconsistent and paracomplete logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from previous research in paraconsistent set theory, which has almost exclusively been motivated by a desire to avoid Russell’s paradox and fulfil naive comprehension. Instead, we prioritise setting up a system with a clear ontology of non-classical sets, which can be used to reason informally about incomplete and inconsistent phenomena, and is sufficiently similar to ${mathrm {ZFC}}$ to enable the development of interesting mathematics.

We propose an axiomatic system ${mathrm {BZFC}}$, obtained by analysing the ${mathrm {ZFC}}$-axioms and translating them to a four-valued setting in a careful manner, avoiding many of the obstacles encountered by other attempted formalizations. We introduce the anti-classicality axiom postulating the existence of non-classical sets, and prove a surprising results stating that the existence of a single non-classical set is sufficient to produce any other type of non-classical set.

Our theory is naturally bi-interpretable with ${mathrm {ZFC}}$, and provides a philosophically satisfying view in which non-classical sets can be seen as a natural extension of classical ones, in a similar way to the non-well-founded sets of Peter Aczel [1].

Finally, we provide an interesting application concerning Tarski semantics, showing that the classical definition of the satisfaction relation yields a logic precisely reflecting the non-classicality in the meta-theory.

我们提出了一种在四值准一致和准完备逻辑中处理集合论的新方法,即命题既可以为真也可以为假,既可以非真也可以非假的逻辑。我们的研究方法与以往的准一致集合论研究大相径庭,以往的研究几乎都是为了避免罗素悖论和实现天真的理解。相反,我们优先考虑建立一个具有清晰的非经典集合本体的系统,它可以用来对不完整和不一致的现象进行非正式推理,并且与 ${mathrm {ZFC}}$ 足够相似,从而能够发展出有趣的数学。我们提出了一个公理系统 ${mathrm {BZFC}}$ ,它是通过分析 ${mathrm {ZFC}}$ 的公理,并以一种谨慎的方式将其转换为四值环境而得到的,避免了许多其他形式化尝试所遇到的障碍。我们引入了反经典性公理,假设非经典集合的存在,并证明了一个惊人的结果,即单个非经典集合的存在足以产生任何其他类型的非经典集合。我们的理论与 ${mathrm {ZFC}}$ 具有天然的双向可解释性,并提供了一种哲学上令人满意的观点,即非经典集合可以被视为经典集合的自然延伸,这与彼得-阿克泽尔(Peter Aczel)的非有根据集合[1]有异曲同工之妙。最后,我们提供了一个关于塔尔斯基语义学的有趣应用,证明了满足关系的经典定义产生了一种逻辑,恰好反映了元理论中的非经典性。
{"title":"PARACONSISTENT AND PARACOMPLETE ZERMELO–FRAENKEL SET THEORY","authors":"YURII KHOMSKII, HRAFN VALTÝR ODDSSON","doi":"10.1017/s1755020323000382","DOIUrl":"https://doi.org/10.1017/s1755020323000382","url":null,"abstract":"<p>We present a novel treatment of set theory in a four-valued <span>paraconsistent</span> and <span>paracomplete</span> logic, i.e., a logic in which propositions can be both true and false, and neither true nor false. Our approach is a significant departure from previous research in paraconsistent set theory, which has almost exclusively been motivated by a desire to avoid Russell’s paradox and fulfil naive comprehension. Instead, we prioritise setting up a system with a clear ontology of non-classical sets, which can be used to reason informally about incomplete and inconsistent phenomena, and is sufficiently similar to <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240222115540260-0904:S1755020323000382:S1755020323000382_inline1.png\"><span data-mathjax-type=\"texmath\"><span>${mathrm {ZFC}}$</span></span></img></span></span> to enable the development of interesting mathematics.</p><p>We propose an axiomatic system <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240222115540260-0904:S1755020323000382:S1755020323000382_inline2.png\"><span data-mathjax-type=\"texmath\"><span>${mathrm {BZFC}}$</span></span></img></span></span>, obtained by analysing the <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240222115540260-0904:S1755020323000382:S1755020323000382_inline3.png\"><span data-mathjax-type=\"texmath\"><span>${mathrm {ZFC}}$</span></span></img></span></span>-axioms and translating them to a four-valued setting in a careful manner, avoiding many of the obstacles encountered by other attempted formalizations. We introduce the <span>anti-classicality axiom</span> postulating the existence of non-classical sets, and prove a surprising results stating that the existence of a single non-classical set is sufficient to produce any other type of non-classical set.</p><p>Our theory is naturally bi-interpretable with <span><span><img data-mimesubtype=\"png\" data-type=\"\" src=\"https://static.cambridge.org/binary/version/id/urn:cambridge.org:id:binary:20240222115540260-0904:S1755020323000382:S1755020323000382_inline4.png\"><span data-mathjax-type=\"texmath\"><span>${mathrm {ZFC}}$</span></span></img></span></span>, and provides a philosophically satisfying view in which non-classical sets can be seen as a natural extension of classical ones, in a similar way to the non-well-founded sets of Peter Aczel [1].</p><p>Finally, we provide an interesting application concerning Tarski semantics, showing that the classical definition of the satisfaction relation yields a logic precisely reflecting the non-classicality in the meta-theory.</p>","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"219 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-12-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139919451","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}
引用次数: 0
RSL volume 16 issue 4 Cover and Back matter RSL 第 16 卷第 4 期封面和封底
Pub Date : 2023-12-01 DOI: 10.1017/s1755020323000370
{"title":"RSL volume 16 issue 4 Cover and Back matter","authors":"","doi":"10.1017/s1755020323000370","DOIUrl":"https://doi.org/10.1017/s1755020323000370","url":null,"abstract":"","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"152 ","pages":"b1 - b2"},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"138987124","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}
引用次数: 0
RSL volume 16 issue 4 Cover and Front matter RSL 第 16 卷第 4 期封面和封底
Pub Date : 2023-12-01 DOI: 10.1017/s1755020323000369
{"title":"RSL volume 16 issue 4 Cover and Front matter","authors":"","doi":"10.1017/s1755020323000369","DOIUrl":"https://doi.org/10.1017/s1755020323000369","url":null,"abstract":"","PeriodicalId":501566,"journal":{"name":"The Review of Symbolic Logic","volume":"145 ","pages":"f1 - f4"},"PeriodicalIF":0.0,"publicationDate":"2023-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139016828","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}
引用次数: 0
期刊
The Review of Symbolic Logic
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1