Logics

In this paper, we study three algorithmic problems involving computation trees: the optimization, solvability, and satisfiability problems. The solvability problem is concerned with recognizing computation trees that solve problems. The satisfiability problem is concerned with recognizing sentences that are true in at least one structure from a given set of structures. We study how the decidability of the optimization problem depends on the decidability of the solvability and satisfiability problems. We also consider various examples with both decidable and undecidable solvability and satisfiability problems. Full article

This article initiates the semantic study of distribution-free normal modal logic systems, laying the semantic foundations and anticipating further research in the area. The article explores roughly the same area, though taking a different approach, as a recent article by Bezhanishvili, de Groot, Dmitrieva and Morachini, who studied a distribution-free version of Dunn’s positive modal logic (PML). Unlike PML, we consider logics that may drop distribution and that are equipped with both an implication connective and modal operators. We adopt a uniform relational semantics approach, relying on recent results on representation and duality for normal lattice expansions. We prove canonicity and completeness in the relational semantics of the minimal distribution-free normal modal logic, assuming just the K-axiom, as well as those of its axiomatic extensions obtained by adding any of the D, T, B, S4 or S5 axioms. Adding distribution can be easily accommodated and, as a side result, we also obtain a new semantic treatment of intuitionistic modal logic. Full article

This article contributes to recent results in the model theory of distribution-free logics (which include a Goldblatt-Thomason theorem and a development of their Sahlqvist theory) by lifting van Benthem’s characterization result for modal logic to the more general setting of the logics of normal lattice expansions. Our proof approach makes use of a fully abstract translation of the language of the logics of interest into the language of sorted residuated modal logic, building on an analogous translation of substructural logics recently published by the author. The article is intended as a demonstration and application of a project of reduction of non-distributive logics to (sorted) residuated modal logics. The reduction makes the proof of a van Benthem characterization of non-distributive logics possible, by adapting, reusing and generalizing existing results. Full article

Homophily, which means similarity breeds association, is one of the most fundamental principles in social organization. However, in some cases, homophily is not significant, because actors’ perceptions of others differ from the real situation. In this article, we use the term “subjective homophily” to describe the homophily where the perceived similarity of objects is considered. In addition, we also consider social influence, which is closely related to homophily and represents the diffusion of some attributes through associations. In short, the dynamic temporal logic ${\mathrm{LoSH}}_{\mathrm{G},\mathrm{M}}^{\mathrm{SC}}$ we propose in this article is based on computation tree logic (CTL), which is used to describe the evolution of networks by subjective homophily, and dynamic logic (DL), which provides the dynamic update operator for representing active social influence. Furthermore, we prove that the model checking problem and the validity checking problem for ${\mathrm{LoSH}}_{\mathrm{G},\mathrm{M}}^{\mathrm{SC}}$ are both PSPACE-complete. Finally, we use an example, named false consensus, to illustrate how logic captures the subjective homophily evolution of networks and the impact of active social influence on evolution and structure. Full article

Non-Tarskian interpretations of many-valued logics have been widely explored in the logic literature. The development of non-tarskian conceptions of logical consequence set the theoretical foundations for rediscovering well-known (Tarskian) many-valued logics. One may find in distinct authors many novel interpretations of many-valued systems. They are produced through a type of procedure which consists in altering the semantic structure of Tarskian many-valued logics in order to output a non-Tarskian interpretation of these logics. Through this type of transformation the paper explores a uniform way of transforming finitely many-valued Tarskian logics into their non-Tarskian interpretation. Some general properties of carrying out this type of procedure are studied, namely the dualities between these logics and the conditions under which negation-explosive and negation-complete Tarskian logics become non-explosive. Full article

This paper considers a specification rewriting meachanism for a specific fragment of Linear Temporal Logic for Finite traces, DECLAREd, working through an equational logic and rewriting mechanism under customary practitioner assumptions from the Business Process Management literature. By rewriting the specification into an equivalent formula which might be easier to compute, we aim to streamline current state-of-the-art temporal artificial intelligence algorithms working on temporal logic. As this specification rewriting mechanism is ultimately also able to determine with the provided specification is a tautology (always true formula) or a formula containing a temporal contradiction, by detecting the necessity of a specific activity label to be both present and absent within a log, this implies that the proved mechanism is ultimately a SAT-solver for DECLAREd. We prove for the first time, to the best of our knowledge, that this fragment is a polytime fragment of LTL_f, while all the previously-investigated fragments or extensions of such a language were in polyspace. We test these considerations over formal synthesis (Lydia), SAT-Solvers (AALTAF) and formal verification (KnoBAB) algorithms, where formal verification can be also run on top of a relational database and can be therefore expressed in terms of relational query answering. We show that all these benefit from the aforementioned assumptions, as running their tasks over a rewritten equivalent specification will improve their running times, thus motivating the pressing need of this approach for practical temporal artificial intelligence scenarios. We validate such claims by testing such algorithms over a Cybersecurity dataset. Full article

The logico-pluralist LogiKEy knowledge engineering methodology and framework is applied to the modelling of a theory of legal balancing, in which legal knowledge (cases and laws) is encoded by utilising context-dependent value preferences. The theory obtained is then used to formalise, automatically evaluate, and reconstruct illustrative property law cases (involving the appropriation of wild animals) within the Isabelle/HOL proof assistant system, illustrating how LogiKEy can harness interactive and automated theorem-proving technology to provide a testbed for the development and formal verification of legal domain-specific languages and theories. Modelling value-oriented legal reasoning in that framework, we establish novel bridges between the latest research in knowledge representation and reasoning in non-classical logics, automated theorem proving, and applications in legal reasoning. Full article

Recently, historians have discussed the relevance of the nineteenth-century mathematical discipline of projective geometry for early modern classical logic in relation to possible solutions to semantic problems facing it. In this paper, I consider Hegel’s Science of Logic as an attempt to provide a projective geometrical alternative to the implicit Euclidean underpinnings of Aristotle’s syllogistic logic. While this proceeds via Hegel’s acceptance of the role of the three means of Pythagorean music theory in Plato’s cosmology, the relevance of this can be separated from any fanciful “music of the spheres” approach by the fact that common mathematical structures underpin both music theory and projective geometry, as suggested in the name of projective geometry’s principal invariant, the “harmonic cross-ratio”. Here, I demonstrate this common structure in terms of the phenomenon of “inverse foreshortening”. As with recent suggestions concerning the relevance of projective geometry for logic, Hegel’s modifications of Aristotle respond to semantic problems of his logic. Full article

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. Full article

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. Full article

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. Full article

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. Full article

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 $\mathcal{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 $\mathcal{L}(\mathbf{\Sigma })$. In ${\mathcal{L}}_1(\mathbf{\Sigma })$, we drop action repetition; in ${\mathcal{L}}_0(\mathbf{\Sigma })$, 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 ${\mathcal{L}}_0(\mathbf{\Sigma })$ and the weak completeness of one for ${\mathcal{L}}_1(\mathbf{\Sigma })$. We show the finite model property and, hence, decidability of ${\mathcal{L}}_1(\mathbf{\Sigma })$. We translate ${\mathcal{L}}_1(\mathbf{\Sigma })$ into PDL, obtaining a second proof of decidability. We prove results on expressive power, comparing ${\mathcal{L}}_1(\mathbf{\Sigma })$ 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. Full article

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. Full article

We give a proof-theoretic as well as a semantic characterization of a logic in the signature with conjunction, disjunction, negation, and the universal and existential quantifiers that we suggest has a certain fundamental status. We present a Fitch-style natural deduction system for the logic that contains only the introduction and elimination rules for the logical constants. From this starting point, if one adds the rule that Fitch called Reiteration, one obtains a proof system for intuitionistic logic in the given signature; if instead of adding Reiteration, one adds the rule of Reductio ad Absurdum, one obtains a proof system for orthologic; by adding both Reiteration and Reductio, one obtains a proof system for classical logic. Arguably neither Reiteration nor Reductio is as intimately related to the meaning of the connectives as the introduction and elimination rules are, so the base logic we identify serves as a more fundamental starting point and common ground between proponents of intuitionistic logic, orthologic, and classical logic. The algebraic semantics for the logic we motivate proof-theoretically is based on bounded lattices equipped with what has been called a weak pseudocomplementation. We show that such lattice expansions are representable using a set together with a reflexive binary relation satisfying a simple first-order condition, which yields an elegant relational semantics for the logic. This builds on our previous study of representations of lattices with negations, which we extend and specialize for several types of negation in addition to weak pseudocomplementation. Finally, we discuss ways of extending these representations to lattices with a conditional or implication operation. Full article

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. Full article