{"title":"Comparative plausibility in neighbourhood models: axiom systems and sequent calculi","authors":"Tiziano Dalmonte, Marianna Girlando","doi":"10.48550/arXiv.2210.10480","DOIUrl":"https://doi.org/10.48550/arXiv.2210.10480","url":null,"abstract":"We introduce a family of comparative plausibility logics over neighbourhood models, generalising Lewis' comparative plausibility operator over sphere models. We provide axiom systems for the logics, and prove their soundness and completeness with respect to the semantics. Then, we introduce two kinds of analytic proof systems for several logics in the family: a multi-premisses sequent calculus in the style of Lellmann and Pattinson, for which we prove cut admissibility, and a hypersequent calculus based on structured calculi for conditional logics by Girlando et al., tailored for countermodel construction over failed proof search. Our results constitute the first steps in the definition of a unified proof theoretical framework for logics equipped with a comparative plausibility operator.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125031081","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":"Wijesekera-style constructive modal logics","authors":"Tiziano Dalmonte","doi":"10.48550/arXiv.2210.09937","DOIUrl":"https://doi.org/10.48550/arXiv.2210.09937","url":null,"abstract":"We define a family of propositional constructive modal logics corresponding each to a different classical modal system. The logics are defined in the style of Wijesekera's constructive modal logic, and are both proof-theoretically and semantically motivated. On the one hand, they correspond to the single-succedent restriction of standard sequent calculi for classical modal logics. On the other hand, they are obtained by incorporating the hereditariness of intuitionistic Kripke models into the classical satisfaction clauses for modal formulas. We show that, for the considered classical logics, the proof-theoretical and the semantical approach return the same constructive systems.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"97 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116634684","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":"Algebraic semantics for one-variable lattice-valued logics","authors":"P. Cintula, G. Metcalfe, N. Tokuda","doi":"10.48550/arXiv.2209.08566","DOIUrl":"https://doi.org/10.48550/arXiv.2209.08566","url":null,"abstract":"The one-variable fragment of any first-order logic may be considered as a modal logic, where the universal and existential quantifiers are replaced by a box and diamond modality, respectively. In several cases, axiomatizations of algebraic semantics for these logics have been obtained: most notably, for the modal counterparts S5 and MIPC of the one-variable fragments of first-order classical logic and intuitionistic logic, respectively. Outside the setting of first-order intermediate logics, however, a general approach is lacking. This paper provides the basis for such an approach in the setting of first-order lattice-valued logics, where formulas are interpreted in algebraic structures with a lattice reduct. In particular, axiomatizations are obtained for modal counterparts of one-variable fragments of a broad family of these logics by generalizing a functional representation theorem of Bezhanishvili and Harding for monadic Heyting algebras. An alternative proof-theoretic proof is also provided for one-variable fragments of first-order substructural logics that have a cut-free sequent calculus and admit a certain bounded interpolation property.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125096989","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":"Uniform Lyndon interpolation for intuitionistic monotone modal logic","authors":"A. Tabatabai, Rosalie Iemhoff, Raheleh Jalali","doi":"10.48550/arXiv.2208.04607","DOIUrl":"https://doi.org/10.48550/arXiv.2208.04607","url":null,"abstract":"In this paper we show that the intuitionistic monotone modal logic $mathsf{iM}$ has the uniform Lyndon interpolation property (ULIP). The logic $mathsf{iM}$ is a non-normal modal logic on an intuitionistic basis, and the property ULIP is a strengthening of interpolation in which the interpolant depends only on the premise or the conclusion of an implication, respecting the polarities of the propositional variables. Our method to prove ULIP yields explicit uniform interpolants and makes use of a terminating sequent calculus for $mathsf{iM}$ that we have developed for this purpose. As far as we know, the results that $mathsf{iM}$ has ULIP and a terminating sequent calculus are the first of their kind for an intuitionistic non-normal modal logic. However, rather than proving these particular results, our aim is to show the flexibility of the constructive proof-theoretic method that we use for proving ULIP. It has been developed over the last few years and has been applied to substructural, intermediate, classical (non-)normal modal and intuitionistic normal modal logics. In light of these results, intuitionistic non-normal modal logics seem a natural next class to try to apply the method to, and we take the first step in that direction in this paper.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-08-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121513315","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":"EXPTIME-hardness of higher-dimensional Minkowski spacetime","authors":"R. Hirsch, Brett McLean","doi":"10.48550/arXiv.2206.06866","DOIUrl":"https://doi.org/10.48550/arXiv.2206.06866","url":null,"abstract":"We prove the EXPTIME-hardness of the validity problem for the basic temporal logic on Minkowski spacetime with more than one space dimension. We prove this result for both the lightspeed-or-slower and the slower-than-light accessibility relations (and for both the irreflexive and the reflexive versions of these relations). As an auxiliary result, we prove the EXPTIME-hardness of validity on any frame for which there exists an embedding of the infinite complete binary tree satisfying certain conditions. The proof is by a reduction from the two-player corridor-tiling game.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132677182","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":"Local Dependence and Guarding","authors":"J. V. Benthem, B. T. Cate, R. Koudijs","doi":"10.48550/arXiv.2206.06046","DOIUrl":"https://doi.org/10.48550/arXiv.2206.06046","url":null,"abstract":"We study LFD, a base logic of functional dependence introduced by Baltag and van Benthem (2021) and its connections with the guarded fragment GF of first-order logic. Like other logics of dependence, the semantics of LFD uses teams: sets of permissible variable assignments. What sets LFD apart is its ability to express local dependence between variables and local dependence of statements on variables. Known features of LFD include decidability, explicit axiomatization, finite model property, and a bisimulation characterization. Others, including the complexity of satisfiability, remained open so far. More generally, what has been lacking is a good understanding of what makes the LFD approach to dependence computationally well-behaved, and how it relates to other decidable logics. In particular, how do allowing variable dependencies and guarding quantifiers compare as logical devices? We provide a new compositional translation from GF into LFD, and conversely, we translate LFD into GF in an `almost compositional' manner. Using these two translations, we transfer known results about GF to LFD in a uniform manner, yielding, e.g., tight complexity bounds for LFD satisfiability, as well as Craig interpolation. Conversely, e.g., the finite model property of LFD transfers to GF. Thus, local dependence and guarding turn out to be intricately entangled notions.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"71 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114786869","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":"Relevant Reasoners in a Classical World","authors":"Igor Sedl'ar, Pietro Vigiani","doi":"10.48550/arXiv.2206.03109","DOIUrl":"https://doi.org/10.48550/arXiv.2206.03109","url":null,"abstract":"We develop a framework for epistemic logic that combines relevant modal logic with classical propositional logic. In our framework the agent is modeled as reasoning in accordance with a relevant modal logic while the propositional fragment of our logics is classical. In order to achieve this feature, we modify the relational semantics for relevant modal logics so that validity in a model is defined as satisfaction throughout a set of designated states that, as far as propositional connectives are concerned, behave like classical possible worlds. The main technical result of the paper is a modular completeness theorem parametrized by the relevant modal logic formalizing the agent's reasoning.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-06-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129285333","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":"Algorithmic correspondence and analytic rules","authors":"Andrea De Domenico, G. Greco","doi":"10.48550/arXiv.2203.14147","DOIUrl":"https://doi.org/10.48550/arXiv.2203.14147","url":null,"abstract":"We introduce the algorithm MASSA which takes classical modal formulas in input, and, when successful, effectively generates: (a) (analytic) geometric rules of the labelled calculus G3K, and (b) cut-free derivations (of a certain `canonical' shape) of each given input formula in the geometric labelled calculus obtained by adding the rule in output to G3K. We show that MASSA successfully terminates whenever its input formula is a (definite) analytic inductive formula, in which case, the geometric axiom corresponding to the output rule is, modulo logical equivalence, the first-order correspondent of the input formula.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116555165","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":"An Epistemic Interpretation of Tensor Disjunction","authors":"Hao Wang, Yanjing Wang, Yunsong Wang","doi":"10.48550/arXiv.2203.13970","DOIUrl":"https://doi.org/10.48550/arXiv.2203.13970","url":null,"abstract":"This paper aims to give an epistemic interpretation to the tensor disjunction in dependence logic, through a rather surprising connection to the so-called weak disjunction in Medvedev's early work on intermediate logic under the Brouwer-Heyting-Kolmogorov (BHK)-interpretation. We expose this connection in the setting of inquisitive logic with tensor disjunction discussed by Ciardelli and Barbero (2019}, but from an epistemic perspective. More specifically, we translate the propositional formulae of inquisitive logic with tensor into modal formulae in a powerful epistemic language of\"knowing how\"following the proposal by Wang (2021). We give a complete axiomatization of the logic of our full language based on Fine's axiomatization of S5 modal logic with propositional quantifiers. Finally, we generalize the tensor operator with parameters $k$ and $n$, which intuitively captures the epistemic situation that one knows $n$ potential answers to $n$ questions and is sure $k$ answers of them must be correct. The original tensor disjunction is the special case when $k=1$ and $n=2$. We show that the generalized tensor operators do not increase the expressive power of our logic, the inquisitive logic, and propositional dependence logic, though most of these generalized tensors are not uniformly definable in these logics, except in our dynamic epistemic logic of knowing how.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-03-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122319106","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":"Coherence in Modal Logic","authors":"T. Kowalski, G. Metcalfe","doi":"10.7892/BORIS.119774","DOIUrl":"https://doi.org/10.7892/BORIS.119774","url":null,"abstract":"A variety is said to be coherent if the finitely generated subalgebras of its finitely presented members are also finitely presented. In a recent paper by the authors it was shown that coherence forms a key ingredient of the uniform deductive interpolation property for equational consequence in a variety, and a general criterion was given for the failure of coherence (and hence uniform deductive interpolation) in varieties of algebras with a term-definable semilattice reduct. In this paper, a more general criterion is obtained and used to prove the failure of coherence and uniform deductive interpolation for a broad family of modal logics, including K, KT, K4, and S4.","PeriodicalId":129696,"journal":{"name":"Advances in Modal Logic","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2018-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116917907","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号
