Pub Date : 2023-11-14DOI: 10.1007/s11225-023-10076-z
Fengkui Ju
{"title":"A Logical Theory for Conditional Weak Ontic Necessity in Branching Time","authors":"Fengkui Ju","doi":"10.1007/s11225-023-10076-z","DOIUrl":"https://doi.org/10.1007/s11225-023-10076-z","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"26 15","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134991801","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-10DOI: 10.1007/s11225-023-10074-1
Juan Manuel Cornejo, Hernn Javier San Martín, Valeria Sígal
{"title":"On a Class of Subreducts of the Variety of Integral srl-Monoids and Related Logics","authors":"Juan Manuel Cornejo, Hernn Javier San Martín, Valeria Sígal","doi":"10.1007/s11225-023-10074-1","DOIUrl":"https://doi.org/10.1007/s11225-023-10074-1","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"112 27","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135137806","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-11-10DOI: 10.1007/s11225-023-10078-x
Luis Estrada-González, Ricardo Arturo Nicolás-Francisco
Abstract Seen from the point of view of evaluation conditions, a usual way to obtain a connexive logic is to take a well-known negation, for example, Boolean negation or de Morgan negation, and then assign special properties to the conditional to validate Aristotle’s and Boethius’ Theses. Nonetheless, another theoretical possibility is to have the extensional or the material conditional and then assign special properties to the negation to validate the theses. In this paper we examine that possibility, not sufficiently explored in the connexive literature yet.We offer a characterization of connexive negation disentangled from the cancellation account of negation, a previous attempt to define connexivity on top of a distinctive negation. We also discuss an ancient view on connexive logics, according to which a valid implication is one where the negation of the consequent is incompatible with the antecedent, and discuss the role of our idea of connexive negation for this kind of view.
{"title":"Connexive Negation","authors":"Luis Estrada-González, Ricardo Arturo Nicolás-Francisco","doi":"10.1007/s11225-023-10078-x","DOIUrl":"https://doi.org/10.1007/s11225-023-10078-x","url":null,"abstract":"Abstract Seen from the point of view of evaluation conditions, a usual way to obtain a connexive logic is to take a well-known negation, for example, Boolean negation or de Morgan negation, and then assign special properties to the conditional to validate Aristotle’s and Boethius’ Theses. Nonetheless, another theoretical possibility is to have the extensional or the material conditional and then assign special properties to the negation to validate the theses. In this paper we examine that possibility, not sufficiently explored in the connexive literature yet.We offer a characterization of connexive negation disentangled from the cancellation account of negation, a previous attempt to define connexivity on top of a distinctive negation. We also discuss an ancient view on connexive logics, according to which a valid implication is one where the negation of the consequent is incompatible with the antecedent, and discuss the role of our idea of connexive negation for this kind of view.","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"102 24","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135137852","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-10DOI: 10.1007/s11225-023-10071-4
Hans Rott
Abstract Today there is a wealth of fascinating studies of connexive logical systems. But sometimes it looks as if connexive logic is still in search of a convincing interpretation that explains in intuitive terms why the connexive principles should be valid. In this paper I argue that difference-making conditionals as presented in Rott ( Review of Symbolic Logic 15, 2022) offer one principled way of interpreting connexive principles. From a philosophical point of view, the idea of difference-making demands full, unrestricted connexivity, because neither logical truths nor contradictions or other absurdities can ever ‘make a difference’ (i.e., be relevantly connected) to anything. However, difference-making conditionals have so far been only partially connexive. I show how the existing analysis of difference-making conditionals can be reshaped to obtain full connexivity. The classical AGM belief revision model is replaced by a conceivability-limited revision model that serves as the semantic base for the analysis. The key point of the latter is that the agent should never accept any absurdities.
摘要:目前，有大量关于关联逻辑系统的研究。但有时看起来，似乎连接逻辑仍在寻找一种令人信服的解释，以直观的方式解释为什么连接原则应该是有效的。在本文中，我认为Rott (Review of Symbolic Logic 15,2022)中提出的差异制造条件提供了解释连接原则的一种原则性方法。从哲学的角度来看，差异产生的想法要求充分的、不受限制的连接，因为逻辑真理、矛盾或其他荒谬都不能“产生差异”(即与任何事物相关)。然而，到目前为止，造成差异的条件句只是部分连接。我将展示如何对产生差异的条件的现有分析进行重塑，以获得完全的连接性。将经典的AGM信念修正模型替换为可想象限制修正模型，作为分析的语义基础。后者的关键是代理人不应该接受任何荒谬。
{"title":"Difference-Making Conditionals and Connexivity","authors":"Hans Rott","doi":"10.1007/s11225-023-10071-4","DOIUrl":"https://doi.org/10.1007/s11225-023-10071-4","url":null,"abstract":"Abstract Today there is a wealth of fascinating studies of connexive logical systems. But sometimes it looks as if connexive logic is still in search of a convincing interpretation that explains in intuitive terms why the connexive principles should be valid. In this paper I argue that difference-making conditionals as presented in Rott ( Review of Symbolic Logic 15, 2022) offer one principled way of interpreting connexive principles. From a philosophical point of view, the idea of difference-making demands full, unrestricted connexivity, because neither logical truths nor contradictions or other absurdities can ever ‘make a difference’ (i.e., be relevantly connected) to anything. However, difference-making conditionals have so far been only partially connexive. I show how the existing analysis of difference-making conditionals can be reshaped to obtain full connexivity. The classical AGM belief revision model is replaced by a conceivability-limited revision model that serves as the semantic base for the analysis. The key point of the latter is that the agent should never accept any absurdities.","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"145 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136294469","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-10-07DOI: 10.1007/s11225-023-10072-3
Hector Freytes, Giuseppe Sergioli
Abstract In the framework of algebras with infinitary operations, the equational theory of $$bigvee _{kappa }$$ ⋁κ -complete Heyting algebras or Heyting $$kappa $$ κ -frames is studied. A Hilbert style calculus algebraizable in this class is formulated. Based on the infinitary structure of Heyting $$kappa $$ κ -frames, an equational type completeness theorem related to the $$langle bigvee , wedge , rightarrow , 0 rangle $$ ⟨⋁,∧,→,0⟩ -structure of frames is also obtained.
{"title":"Heyting $$kappa $$-Frames","authors":"Hector Freytes, Giuseppe Sergioli","doi":"10.1007/s11225-023-10072-3","DOIUrl":"https://doi.org/10.1007/s11225-023-10072-3","url":null,"abstract":"Abstract In the framework of algebras with infinitary operations, the equational theory of $$bigvee _{kappa }$$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:msub> <mml:mo>⋁</mml:mo> <mml:mi>κ</mml:mi> </mml:msub> </mml:math> -complete Heyting algebras or Heyting $$kappa $$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>κ</mml:mi> </mml:math> -frames is studied. A Hilbert style calculus algebraizable in this class is formulated. Based on the infinitary structure of Heyting $$kappa $$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mi>κ</mml:mi> </mml:math> -frames, an equational type completeness theorem related to the $$langle bigvee , wedge , rightarrow , 0 rangle $$ <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"> <mml:mrow> <mml:mo>⟨</mml:mo> <mml:mo>⋁</mml:mo> <mml:mo>,</mml:mo> <mml:mo>∧</mml:mo> <mml:mo>,</mml:mo> <mml:mo>→</mml:mo> <mml:mo>,</mml:mo> <mml:mn>0</mml:mn> <mml:mo>⟩</mml:mo> </mml:mrow> </mml:math> -structure of frames is also obtained.","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135254004","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-28DOI: 10.1007/s11225-023-10073-2
Athanassios Tzouvaras
{"title":"Sets with Dependent Elements: A Formalization of Castoriadis’ Notion of Magma","authors":"Athanassios Tzouvaras","doi":"10.1007/s11225-023-10073-2","DOIUrl":"https://doi.org/10.1007/s11225-023-10073-2","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135387429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-20DOI: 10.1007/s11225-023-10070-5
Miguel Campercholi, Diego Vaggione
{"title":"Semisimplicity and Congruence 3-Permutabilty for Quasivarieties with Equationally Definable Principal Congruences","authors":"Miguel Campercholi, Diego Vaggione","doi":"10.1007/s11225-023-10070-5","DOIUrl":"https://doi.org/10.1007/s11225-023-10070-5","url":null,"abstract":"","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"60 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136308922","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pub Date : 2023-09-20DOI: 10.1007/s11225-023-10058-1
Mateusz Klonowski, Luis Estrada-González
Abstract We present here some Boolean connexive logics (BCLs) that are intended to be connexive counterparts of selected Epstein’s content relationship logics (CRLs). The main motivation for analyzing such logics is to explain the notion of connexivity by means of the notion of content relationship. The article consists of two parts. In the first one, we focus on the syntactic analysis by means of axiomatic systems. The starting point for our syntactic considerations will be the smallest BCL and the smallest CRL. In the first part, we also identify axioms of Epstein’s logics that, together with the connexive principles, lead to contradiction. Moreover, we present some principles that will be equivalent to the connexive theses, but not to the content connexive theses we will propose. In the second part, we focus on the semantic analysis provided by relating- and set-assignment models. We define sound and complete relating semantics for all tested systems. We also indicate alternative relating models for the smallest BCL, which are not alternative models of the connexive counterparts of the considered CRLs. We provide a set-assignment semantics for some BCLs, giving thus a natural formalization of the content relationship understood either as content sharing or as content inclusion.
{"title":"Boolean Connexive Logic and Content Relationship","authors":"Mateusz Klonowski, Luis Estrada-González","doi":"10.1007/s11225-023-10058-1","DOIUrl":"https://doi.org/10.1007/s11225-023-10058-1","url":null,"abstract":"Abstract We present here some Boolean connexive logics (BCLs) that are intended to be connexive counterparts of selected Epstein’s content relationship logics (CRLs). The main motivation for analyzing such logics is to explain the notion of connexivity by means of the notion of content relationship. The article consists of two parts. In the first one, we focus on the syntactic analysis by means of axiomatic systems. The starting point for our syntactic considerations will be the smallest BCL and the smallest CRL. In the first part, we also identify axioms of Epstein’s logics that, together with the connexive principles, lead to contradiction. Moreover, we present some principles that will be equivalent to the connexive theses, but not to the content connexive theses we will propose. In the second part, we focus on the semantic analysis provided by relating- and set-assignment models. We define sound and complete relating semantics for all tested systems. We also indicate alternative relating models for the smallest BCL, which are not alternative models of the connexive counterparts of the considered CRLs. We provide a set-assignment semantics for some BCLs, giving thus a natural formalization of the content relationship understood either as content sharing or as content inclusion.","PeriodicalId":48979,"journal":{"name":"Studia Logica","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136308935","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：