首页 > 最新文献

Bulletin of the Section of Logic最新文献

英文 中文
Structural Rules in Natural Deduction with Alternatives 带选择的自然演绎中的结构规则
Q2 Arts and Humanities Pub Date : 2023-07-18 DOI: 10.18778/0138-0680.2023.6
Greg Restall
Natural deduction with alternatives extends Gentzen–Prawitz-style natural deduction with a single structural addition: negatively signed assumptions, called alternatives. It is a mildly bilateralist, single-conclusion natural deduction proof system in which the connective rules are unmodified from the usual Prawitz introduction and elimination rules—the extension is purely structural. This framework is general: it can be used for (1) classical logic, (2) relevant logic without distribution, (3) affine logic, and (4) linear logic, keeping the connective rules fixed, and varying purely structural rules.The key result of this paper is that the two principles that introduce kinds of irrelevance to natural deduction proofs: (a) the rule of explosion (from a contradiction, anything follows); and (b) the structural rule of vacuous discharge; are shown to be two sides of a single coin, in the same way that they correspond to the structural rule of weakening in the sequent calculus. The paper also includes a discussion of assumption classes, and how they can play a role in treating additive connectives in substructural natural deduction.
带选择的自然演绎扩展了根岑-普拉维茨风格的自然演绎,添加了一个结构:负符号假设,称为选择。它是一个温和的双边主义的,单结论的自然演绎证明系统,其中的连接规则与通常的Prawitz引入和消去规则没有修改-扩展是纯粹结构性的。这个框架是通用的:它可以用于(1)经典逻辑,(2)无分布的相关逻辑,(3)仿射逻辑,(4)线性逻辑,保持连接规则固定,变化纯结构规则。本文的主要结果是引入了与自然演绎证明无关的两种原理:(a)爆炸规则(从一个矛盾出发,任何事情都可以发生);(b)真空放电的结构规律;被证明是一枚硬币的两面,以同样的方式,它们对应于序列演算中弱化的结构规则。本文还讨论了假设类,以及它们如何在处理子结构自然演绎中的加性连接词方面发挥作用。
{"title":"Structural Rules in Natural Deduction with Alternatives","authors":"Greg Restall","doi":"10.18778/0138-0680.2023.6","DOIUrl":"https://doi.org/10.18778/0138-0680.2023.6","url":null,"abstract":"Natural deduction with alternatives extends Gentzen–Prawitz-style natural deduction with a single structural addition: negatively signed assumptions, called alternatives. It is a mildly bilateralist, single-conclusion natural deduction proof system in which the connective rules are unmodified from the usual Prawitz introduction and elimination rules—the extension is purely structural. This framework is general: it can be used for (1) classical logic, (2) relevant logic without distribution, (3) affine logic, and (4) linear logic, keeping the connective rules fixed, and varying purely structural rules.The key result of this paper is that the two principles that introduce kinds of irrelevance to natural deduction proofs: (a) the rule of explosion (from a contradiction, anything follows); and (b) the structural rule of vacuous discharge; are shown to be two sides of a single coin, in the same way that they correspond to the structural rule of weakening in the sequent calculus. The paper also includes a discussion of assumption classes, and how they can play a role in treating additive connectives in substructural natural deduction.","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45193349","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}
引用次数: 1
Introduction: Bilateralism and Proof-Theoretic Semantics (Part I) 导论:双边主义与证明语义学(上)
Q2 Arts and Humanities Pub Date : 2023-06-30 DOI: 10.18778/0138-0680.2023.12
Sara Ayhan
{"title":"Introduction: Bilateralism and Proof-Theoretic Semantics (Part I)","authors":"Sara Ayhan","doi":"10.18778/0138-0680.2023.12","DOIUrl":"https://doi.org/10.18778/0138-0680.2023.12","url":null,"abstract":"","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136367886","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 Theory of an Arbitrary Higher (lambda)-Model 一个任意更高的理论(lambda) -模型
Q2 Arts and Humanities Pub Date : 2023-04-25 DOI: 10.18778/0138-0680.2023.11
Daniel Martinez, R. D. de Queiroz
One takes advantage of some basic properties of every homotopic (lambda)-model (e.g. extensional Kan complex) to explore the higher (betaeta)-conversions, which would correspond to proofs of equality between terms of a theory of equality of any extensional Kan complex. Besides, Identity types based on computational paths are adapted to a type-free theory with higher (lambda)-terms, whose equality rules would be contained in the theory of any $lambda$-homotopic model.
利用每一个同位(λ)-模型的一些基本性质(例如外延Kan复形)来探索更高的(βη)-转换,这将对应于任何外延Kan复合物的等式理论的项之间的等式的证明。此外,基于计算路径的恒等式适用于具有更高(lambda)项的无类型理论,其等式规则将包含在任何$lambda$-同宗模型的理论中。
{"title":"The Theory of an Arbitrary Higher (lambda)-Model","authors":"Daniel Martinez, R. D. de Queiroz","doi":"10.18778/0138-0680.2023.11","DOIUrl":"https://doi.org/10.18778/0138-0680.2023.11","url":null,"abstract":"One takes advantage of some basic properties of every homotopic (lambda)-model (e.g. extensional Kan complex) to explore the higher (betaeta)-conversions, which would correspond to proofs of equality between terms of a theory of equality of any extensional Kan complex. Besides, Identity types based on computational paths are adapted to a type-free theory with higher (lambda)-terms, whose equality rules would be contained in the theory of any $lambda$-homotopic model.","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44217962","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}
引用次数: 2
The weak variable sharing property 弱变量共享性质
Q2 Arts and Humanities Pub Date : 2023-04-21 DOI: 10.18778/0138-0680.2023.05
Tore Fjetland Øgaard
An algebraic type of structure is shown forth which is such that if it is a characteristic matrix for a logic, then that logic satisfies Meyer's weak variable sharing property. As a corollary, it is shown that RM and all its odd-valued extensions (mathbf{RM}_{2nmathord{-}1}) satisfy the weak variable sharing property. It is also shown that a proof to the effect that the "fuzzy" version of the relevant logic R satisfies the property is incorrect.
给出了一个代数类型的结构,如果它是一个逻辑的特征矩阵,那么该逻辑满足Meyer的弱变量共享性质。作为推论,证明了RM及其所有奇值扩展(mathbf{RM}_{2nmathord{-}1})满足弱变量共享性质。还证明了有关逻辑R的“模糊”版本满足该性质的证明是不正确的。
{"title":"The weak variable sharing property","authors":"Tore Fjetland Øgaard","doi":"10.18778/0138-0680.2023.05","DOIUrl":"https://doi.org/10.18778/0138-0680.2023.05","url":null,"abstract":"\u0000\u0000\u0000An algebraic type of structure is shown forth which is such that if it is a characteristic matrix for a logic, then that logic satisfies Meyer's weak variable sharing property. As a corollary, it is shown that RM and all its odd-valued extensions (mathbf{RM}_{2nmathord{-}1}) satisfy the weak variable sharing property. It is also shown that a proof to the effect that the \"fuzzy\" version of the relevant logic R satisfies the property is incorrect.\u0000\u0000\u0000","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45141430","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 Modelwise Interpolation Property of Semantic Logics 语义逻辑的模型插值特性
Q2 Arts and Humanities Pub Date : 2023-04-21 DOI: 10.18778/0138-0680.2023.09
Z. Gyenis, Zalán Molnár, Övge Öztürk
In this paper we introduce the modelwise interpolation property of a logic that states that whenever (modelsphitopsi) holds for two formulas (phi) and (psi), then for every model (mathfrak{M}) there is an interpolant formula (chi$ formulated in the intersectionof the vocabularies of (phi$ and (psi), such that (mathfrak{M}models phitochi) and (mathfrak{M}modelschitopsi), that is, the interpolant formula in Craig interpolation may vary from model to model. We discuss examples and show that while the (n)-variable fragment of first order logic and difference logic have no Craig interpolation, they both have the modelwise interpolation property. As an application we connect the modelwise interpolation property with the local Beth definability, and we prove that the modelwise interpolation property of an algebraizable logic can be characterized by a weak form of the superamalgamation property of the class of algebras corresponding to the models of the logic. In particular, the class of finite dimensional cylindric set algebras enjoys this weak form of superamalgamation.
在本文中,我们引入了一个逻辑的逐模型插值性质,该性质指出,每当(modelsphitopsi)对两个公式(phi)和(psi,使得(mathfrak{M}modelsphitochi)和(math frak{M}modelschitopsi),即Craig插值中的插值公式可能因模型而异。我们讨论了例子,并证明了一阶逻辑和差分逻辑的(n)-变量片段没有Craig插值,但它们都具有逐模型插值性质。作为一个应用,我们将模型插值性质与局部Beth可定义性联系起来,并证明了代数逻辑的模型插值性质可以用对应于逻辑模型的代数类的超游戏性质的弱形式来表征。特别地,有限维圆柱集代数类享有这种弱形式的超等距。
{"title":"The Modelwise Interpolation Property of Semantic Logics","authors":"Z. Gyenis, Zalán Molnár, Övge Öztürk","doi":"10.18778/0138-0680.2023.09","DOIUrl":"https://doi.org/10.18778/0138-0680.2023.09","url":null,"abstract":"In this paper we introduce the modelwise interpolation property of a logic that states that whenever (modelsphitopsi) holds for two formulas (phi) and (psi), then for every model (mathfrak{M}) there is an interpolant formula (chi$ formulated in the intersectionof the vocabularies of (phi$ and (psi), such that (mathfrak{M}models phitochi) and (mathfrak{M}modelschitopsi), that is, the interpolant formula in Craig interpolation may vary from model to model. We discuss examples and show that while the (n)-variable fragment of first order logic and difference logic have no Craig interpolation, they both have the modelwise interpolation property. As an application we connect the modelwise interpolation property with the local Beth definability, and we prove that the modelwise interpolation property of an algebraizable logic can be characterized by a weak form of the superamalgamation property of the class of algebras corresponding to the models of the logic. In particular, the class of finite dimensional cylindric set algebras enjoys this weak form of superamalgamation.","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"41295599","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 Homomorphism and Cartesian Product of Intuitionistic Fuzzy PMS-Subalgebras of a PMS-Algebra 关于PMS代数直觉模糊PMS子代数的同态性和笛卡尔积
Q2 Arts and Humanities Pub Date : 2023-04-21 DOI: 10.18778/0138-0680.2023.08
Beza Lamesgin Derseh, Berhanu Assaye Alaba, Y. G. Wondifraw
In this paper, we introduce the notion of intuitionistic fuzzy PMS-subalgebras under homomorphism and Cartesian product and investigate several properties. We study the homomorphic image and inverse image of the intuitionistic fuzzy PMS-subalgebras of a PMS-algebra, which are also intuitionistic fuzzy PMS-subalgebras of a PMS-algebra, and find some other interesting results. Furthermore, we also prove that the Cartesian product of intuitionistic fuzzy PMS- subalgebras is again an intuitionistic fuzzy PMS-subalgebra and characterize it in terms of its level sets. Finally, we consider the strongest intuitionistic fuzzy PMS-relations on an intuitionistic fuzzy set in a PMS-algebra and demonstrate that an intuitionistic fuzzy PMS-relation on an intuitionistic fuzzy set in a PMS-algebra is an intuitionistic fuzzy PMS-subalgebra if and only if the corresponding intuitionistic fuzzy set in a PMS-algebra is an intuitionistic fuzzy PMS-subalgebra of a PMS-algebra.
本文引入了直觉模糊PMS子代数在同态和笛卡尔积下的概念,并研究了几个性质。我们研究了PMS代数的直觉模糊PMS子代数的同态映象和逆映象,它们也是PMS代数的直观模糊PMS子子代数,并发现了一些其他有趣的结果。此外,我们还证明了直觉模糊PMS-子代数的笛卡尔积又是一个直觉模糊PMM-子代数,并用它的水平集来刻画它。最后我们考虑了PMS代数中直觉模糊集上最强的直觉模糊PMS关系,并证明了PMS代数上直觉模糊集的直觉模糊-PMS关系是直觉模糊-PSM子代数当且仅当PMS代数中对应的直觉模糊集是PMS代数的直觉模糊PMS-子代数。
{"title":"On Homomorphism and Cartesian Product of Intuitionistic Fuzzy PMS-Subalgebras of a PMS-Algebra","authors":"Beza Lamesgin Derseh, Berhanu Assaye Alaba, Y. G. Wondifraw","doi":"10.18778/0138-0680.2023.08","DOIUrl":"https://doi.org/10.18778/0138-0680.2023.08","url":null,"abstract":"In this paper, we introduce the notion of intuitionistic fuzzy PMS-subalgebras under homomorphism and Cartesian product and investigate several properties. We study the homomorphic image and inverse image of the intuitionistic fuzzy PMS-subalgebras of a PMS-algebra, which are also intuitionistic fuzzy PMS-subalgebras of a PMS-algebra, and find some other interesting results. Furthermore, we also prove that the Cartesian product of intuitionistic fuzzy PMS- subalgebras is again an intuitionistic fuzzy PMS-subalgebra and characterize it in terms of its level sets. Finally, we consider the strongest intuitionistic fuzzy PMS-relations on an intuitionistic fuzzy set in a PMS-algebra and demonstrate that an intuitionistic fuzzy PMS-relation on an intuitionistic fuzzy set in a PMS-algebra is an intuitionistic fuzzy PMS-subalgebra if and only if the corresponding intuitionistic fuzzy set in a PMS-algebra is an intuitionistic fuzzy PMS-subalgebra of a PMS-algebra.","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"49659834","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
Roughness of filters in equality algebras 等式代数中滤波器的粗糙度
Q2 Arts and Humanities Pub Date : 2023-01-25 DOI: 10.18778/0138-0680.2023.01
G. Rezaei, R. Borzooei, M. Aaly Kologani, Y. Jun
Rough is an excellent mathematical tool for the analysis of a vague description of actions in decision problems. Now, in this paper by considering the notion of an equality algebra, the notion of the lower and the upper approximations are introduced and some properties of them are given. Moreover, it is proved that the lower and the upper approximations are an interior operator and a closure operator, respectively. Also, using D-lower and D-upper approximation, conditions for a nonempty subset to be definable are provided and investigated that under which condition D-lower and D-upper approximation can be filter.
Rough是一个很好的数学工具,用于分析决策问题中行为的模糊描述。本文通过考虑等式代数的概念,引入了上下近似的概念,并给出了它们的一些性质。并且证明了下近似和上近似分别是一个内算子和闭包算子。同时,利用D-lower和D-upper逼近,给出了非空子集可定义的条件,并研究了在该条件下D-lower和D-upper逼近可以被过滤。
{"title":"Roughness of filters in equality algebras","authors":"G. Rezaei, R. Borzooei, M. Aaly Kologani, Y. Jun","doi":"10.18778/0138-0680.2023.01","DOIUrl":"https://doi.org/10.18778/0138-0680.2023.01","url":null,"abstract":"Rough is an excellent mathematical tool for the analysis of a vague description of actions in decision problems. Now, in this paper by considering the notion of an equality algebra, the notion of the lower and the upper approximations are introduced and some properties of them are given. Moreover, it is proved that the lower and the upper approximations are an interior operator and a closure operator, respectively. Also, using D-lower and D-upper approximation, conditions for a nonempty subset to be definable are provided and investigated that under which condition D-lower and D-upper approximation can be filter.","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-01-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"45411244","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
Basic Four-Valued Systems of Cyclic Negations 循环否定的基本四值系统
Q2 Arts and Humanities Pub Date : 2022-10-25 DOI: 10.18778/0138-0680.2022.21
Oleg M. Grigoriev, D. Zaitsev
We consider an example of four valued semantics partially inspired by quantum computations and negation-like operations occurred therein. In particular we consider a representation of so called square root of negation within this four valued semantics as an operation which acts like a cycling negation. We define two variants of logical matrices performing different orders over the set of truth values. Purely formal logical result of our study consists in axiomatizing the logics of defined matrices as the systems of binary consequence relation and proving correctness and completeness theorems for these deductive systems.
我们考虑一个四值语义的例子,部分灵感来自量子计算和其中发生的类否定运算。特别地,我们认为在这个四值语义中所谓的否定平方根的表示是一个类似于循环否定的运算。我们定义了在真值集上执行不同顺序的逻辑矩阵的两个变体。我们研究的纯形式逻辑结果包括将定义矩阵的逻辑公理化为二元结果关系系统,并证明这些演绎系统的正确性和完备性定理。
{"title":"Basic Four-Valued Systems of Cyclic Negations","authors":"Oleg M. Grigoriev, D. Zaitsev","doi":"10.18778/0138-0680.2022.21","DOIUrl":"https://doi.org/10.18778/0138-0680.2022.21","url":null,"abstract":"We consider an example of four valued semantics partially inspired by quantum computations and negation-like operations occurred therein. In particular we consider a representation of so called square root of negation within this four valued semantics as an operation which acts like a cycling negation. We define two variants of logical matrices performing different orders over the set of truth values. Purely formal logical result of our study consists in axiomatizing the logics of defined matrices as the systems of binary consequence relation and proving correctness and completeness theorems for these deductive systems.","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47490943","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}
引用次数: 1
Equivalential algebras with conjunction on dense elements 稠密元素上具有连的等价代数
Q2 Arts and Humanities Pub Date : 2022-10-25 DOI: 10.18778/0138-0680.2022.22
Slawomir Przybylo, K. Słomczyńska
We study the variety generated by the three-element equivalential algebra with conjunction on the dense elements. We prove the representation theorem which let us construct the free algebras in this variety.
我们研究了在稠密元素上具有联合的三元等价代数所产生的变化。我们证明了表示定理,该定理使我们能够构造这个变种中的自由代数。
{"title":"Equivalential algebras with conjunction on dense elements","authors":"Slawomir Przybylo, K. Słomczyńska","doi":"10.18778/0138-0680.2022.22","DOIUrl":"https://doi.org/10.18778/0138-0680.2022.22","url":null,"abstract":"We study the variety generated by the three-element equivalential algebra with conjunction on the dense elements. We prove the representation theorem which let us construct the free algebras in this variety.","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43777670","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
A 2 Set-Up Binary Routley Semantics for Gödelian 3-Valued Logic G3 and Its Paraconsistent Counterpart G3(_text{Ł}^leq) Gödelian 3值逻辑G3及其副一致逻辑G3的2设置二进制Routley语义(_text{Ł}^leq)
Q2 Arts and Humanities Pub Date : 2022-10-14 DOI: 10.18778/0138-0680.2022.20
G. Robles, J. Méndez
G3 is Gödelian 3-valued logic, G3(_text{Ł}^leq) is its paraconsistent counterpart and G3(_text{Ł}^1) is a strong extension of G3(_text{Ł}^leq). The aim of this paper is to endow each one of the logics just mentioned with a 2 set-up binary Routley semantics.
G3是Gödelian三值逻辑,G3 (_text{Ł}^leq)是它的副一致对应,G3 (_text{Ł}^1)是G3 (_text{Ł}^leq)的强扩展。本文的目的是赋予刚刚提到的每一个逻辑一个2设置二进制劳特利语义。
{"title":"A 2 Set-Up Binary Routley Semantics for Gödelian 3-Valued Logic G3 and Its Paraconsistent Counterpart G3(_text{Ł}^leq)","authors":"G. Robles, J. Méndez","doi":"10.18778/0138-0680.2022.20","DOIUrl":"https://doi.org/10.18778/0138-0680.2022.20","url":null,"abstract":"G3 is Gödelian 3-valued logic, G3(_text{Ł}^leq) is its paraconsistent counterpart and G3(_text{Ł}^1) is a strong extension of G3(_text{Ł}^leq). The aim of this paper is to endow each one of the logics just mentioned with a 2 set-up binary Routley semantics.","PeriodicalId":38667,"journal":{"name":"Bulletin of the Section of Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2022-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"46727794","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
期刊
Bulletin of the Section of 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