{"title":"Graph Algebras and Derived Graph Operations","authors":"Uwe Wolter, Tam Truong","doi":"10.3390/logics1040010","DOIUrl":"https://doi.org/10.3390/logics1040010","url":null,"abstract":"We revise our former definition of graph operations and correspondingly adapt the construction of graph term algebras. As a first contribution to a prospective research field, Universal Graph Algebra, we generalize some basic concepts and results from algebras to graph algebras. To tackle this generalization task, we revise and reformulate traditional set-theoretic definitions, constructions and proofs in Universal Algebra by means of more category-theoretic concepts and constructions. In particular, we generalize the concept of generated subalgebra and prove that all monomorphic homomorphisms between graph algebras are regular. Derived graph operations are the other main topic. After an in-depth analysis of terms as representations of derived operations in traditional algebras, we identify three basic mechanisms to construct new graph operations out of given ones: parallel composition, instantiation, and sequential composition. As a counterpart of terms, we introduce graph operation expressions with a structure as close as possible to the structure of terms. We show that the three mechanisms allow us to construct, for any graph operation expression, a corresponding derived graph operation in any graph algebra.","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-10-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135994838","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":"Carnap’s Problem for Intuitionistic Propositional Logic","authors":"Haotian Tong, Dag Westerståhl","doi":"10.3390/logics1040009","DOIUrl":"https://doi.org/10.3390/logics1040009","url":null,"abstract":"We show that intuitionistic propositional logic is Carnap categorical: the only interpretation of the connectives consistent with the intuitionistic consequence relation is the standard interpretation. This holds with respect to the most well-known semantics relative to which intuitionistic logic is sound and complete; among them Kripke semantics, Beth semantics, Dragalin semantics, topological semantics, and algebraic semantics. These facts turn out to be consequences of an observation about interpretations in Heyting algebras.","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"118 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-09-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136096683","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":"Bilateral Connexive Logic","authors":"N. Francez","doi":"10.3390/logics1030008","DOIUrl":"https://doi.org/10.3390/logics1030008","url":null,"abstract":"This paper proposes a bilateral analysis of connexivity, presenting a bilateral natural deduction system for a weak connexive logic. The proposed logic deviates from other connexive logics and other bilateral logics in the following respects: (1) The logic induces a difference in meaning between inner and outer occurrences of negation in the connexive axioms. (2) The logic allows incoherence—assertion and denial of the same formula—while still being non-trivial.","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"12 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-08-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88264812","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":"Why Logics?","authors":"J. Béziau","doi":"10.3390/logics1030007","DOIUrl":"https://doi.org/10.3390/logics1030007","url":null,"abstract":"In this paper we explain the different meanings of the word “logic” and the circumstances in which it makes sense to use its singular or plural form. We discuss the multiplicity of logical systems and the possibility of developing a unifying theory about them, not itself a logical system. We undertake some comparisons with other sciences, such as biology, physics, mathematics, and linguistics. We conclude by delineating the origin, scope, and future of the journal Logics.","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74604711","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}
Alexandru Baltag, Lawrence S. Moss, Sławomir Solecki
{"title":"Logics for Epistemic Actions: Completeness, Decidability, Expressivity","authors":"Alexandru Baltag, Lawrence S. Moss, Sławomir Solecki","doi":"10.3390/logics1020006","DOIUrl":"https://doi.org/10.3390/logics1020006","url":null,"abstract":"We build and study dynamic versions of epistemic logic. We study languages parameterized by an action signature that allows one to express epistemic actions such as (truthful) public announcements, completely private announcements to groups of agents, and more. The language L(Σ) is modeled on dynamic logic. Its sentence-building operations include modalities for the execution of programs, and for knowledge and common knowledge. Its program-building operations include action execution, composition, repetition, and choice. We consider two fragments of L(Σ). In L1(Σ), we drop action repetition; in L0(Σ), we also drop common knowledge. We present the syntax and semantics of these languages and sound proof systems for the validities in them. We prove the strong completeness of a logical system for L0(Σ) and the weak completeness of one for L1(Σ). We show the finite model property and, hence, decidability of L1(Σ). We translate L1(Σ) into PDL, obtaining a second proof of decidability. We prove results on expressive power, comparing L1(Σ) with modal logic together with transitive closure operators. We prove that a logical language with operators for private announcements is more expressive than one for public announcements.","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2023-06-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"136309818","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":"Concepts of Interpolation in Stratified Institutions","authors":"R. Diaconescu","doi":"10.3390/logics1020005","DOIUrl":"https://doi.org/10.3390/logics1020005","url":null,"abstract":"The extension of the (ordinary) institution theory of Goguen and Burstall, known as the theory of stratified institutions, is a general axiomatic approach to model theories where the satisfaction is parameterized by states of models. Stratified institutions cover a uniformly wide range of applications from various Kripke semantics to various automata theories and even model theories with partial signature morphisms. In this paper, we introduce two natural concepts of logical interpolation at the abstract level of stratified institutions and we provide some sufficient technical conditions in order to establish a causality relationship between them. In essence, these conditions amount to the existence of nominals structures, which are considered fully and abstractly.","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"66 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-04-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"90640748","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":"Logics for Strategic Reasoning of Socially Interacting Rational Agents: An Overview and Perspectives","authors":"V. Goranko","doi":"10.3390/logics1010003","DOIUrl":"https://doi.org/10.3390/logics1010003","url":null,"abstract":"This paper is an overview of some recent and ongoing developments of formal logical systems designed for reasoning about systems of rational agents who act in pursuit of their individual and collective goals, explicitly specified in the language as arguments of the strategic operators, in a socially interactive context of collective objectives and attitudes which guide and constrain the agents’ behavior.","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"59 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2023-02-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80525141","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":"From the Venerable History of Logic to the Flourishing Future of Logics","authors":"V. Goranko","doi":"10.3390/logics1010002","DOIUrl":"https://doi.org/10.3390/logics1010002","url":null,"abstract":"Reasoning is one of the most important and distinguished human activities [...]","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"7 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2022-04-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78426375","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":"Publisher’s Note: Logics—A New Open Access Journal","authors":"Constanze Schelhorn","doi":"10.3390/logics1010001","DOIUrl":"https://doi.org/10.3390/logics1010001","url":null,"abstract":"Logic (from ancient Greek “λογικὴ τέχνη (logiké téchnē)”—“thinking art”, “procedure”) is a multidisciplinary field of research studying the formal principles of reasoning [...]","PeriodicalId":52270,"journal":{"name":"Journal of Applied Logics","volume":"2 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2021-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"74977346","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号
