Algebraic semantics for modal logics II

1966 ◽  
Vol 31 (2) ◽  
pp. 191-218 ◽  
Author(s):  
E. J. Lemmon
Keyword(s):  
Modal Logic ◽  
Modal Logics ◽  
Algebraic Methods ◽  
Model Structure ◽  
Algebraic Semantics ◽  
The Relationship ◽  
Model Structures

This paper is a sequel to [7], and the terminology of [7] is largely presupposed here. In [7], the algebraic methods of McKinsey-Tarski were employed and extended to yield semantic results of a Kripke kind for a class of relatively weak modal logics, the strongest of which was the Feysvon Wright system T. Deontic versions of both T and E2, called T(D) and D2, and even weaker systems, were handled. The main aim of the present paper is to extend these results to stronger systems of modal logic. Thus the Lewis systems S2–S5, the Brouwersche system B of Kripke [4], the systems E3–E5 of [5], and Łukasiewicz's modal logic, as well as certain new systems, are considered.Certain modifications of the method of [7] have proved convenient. Thus in Section I, some further results concerning model structures are proved in order that the relationship between S2 and E2, S3 and E3, can be properly stated; in particular, the notions of a refined and connected model structure play a pervasive role throughout.

Liberated Brouwerian Modal Logic

Dialogue ◽  
1974 ◽  
Vol 13 (3) ◽  
pp. 505-514 ◽  
Author(s):  
Charles G. Morgan
Keyword(s):  
Modal Logic ◽  
Modal Logics ◽  
Possible World ◽  
Modal Systems ◽  
Relationship Of ◽  
The Relationship

In an attempt to “purify” logic of existential presuppositions, attention has recently focused on modal logics, where one usually assumes that at least one possible world exists. Systems very analogous to some of the standard modal systems have been developed which drop this presupposition. We will here treat the removal of the existential assumption from Brouwerian modal logic and discuss the relationship of the system so derived to other modal systems.

scholarly journals Recursive enumerability and elementary frame definability in predicate modal logic

2019 ◽  
Vol 30 (2) ◽  
pp. 549-560 ◽  
Author(s):  
Mikhail Rybakov ◽  
Dmitry Shkatov
Keyword(s):  
Modal Logic ◽  
Modal Logics ◽  
The Other ◽  
Kripke Semantics ◽  
First Order ◽  
Elementary Class ◽  
Recursive Enumerability ◽  
Kripke Frames ◽  
Recursively Enumerable ◽  
The Relationship

Abstract We investigate the relationship between recursive enumerability and elementary frame definability in first-order predicate modal logic. On one hand, it is well known that every first-order predicate modal logic complete with respect to an elementary class of Kripke frames, i.e. a class of frames definable by a classical first-order formula, is recursively enumerable. On the other, numerous examples are known of predicate modal logics, based on ‘natural’ propositional modal logics with essentially second-order Kripke semantics, that are either not recursively enumerable or Kripke incomplete. This raises the question of whether every Kripke complete, recursively enumerable predicate modal logic can be characterized by an elementary class of Kripke frames. We answer this question in the negative, by constructing a normal predicate modal logic which is Kripke complete, recursively enumerable, but not complete with respect to an elementary class of frames. We also present an example of a normal predicate modal logic that is recursively enumerable, Kripke complete, and not complete with respect to an elementary class of rooted frames, but is complete with respect to an elementary class of frames that are not rooted.

Algebraic semantics for modal logics I

1966 ◽  
Vol 31 (1) ◽  
pp. 46-65 ◽  
Author(s):  
E. J. Lemmon
Keyword(s):  
Modal Logic ◽  
General Framework ◽  
Ad Hoc ◽  
Axiomatic Approach ◽  
Present Series ◽  
Algebraic Methods ◽  
Future Research ◽  
Algebraic Semantics ◽  
Semantic Completeness ◽  
Modal Systems

Modal logic received its modern impetus from the work of Lewis and Langford [10]. In recent years, however, their axiomatic approach, aided by somewhat ad hoc matrices for distinguishing different modal systems, has been supplemented by other techniques. Two of the most profound of these were, first, the algebraic methods employed by McKinsey and Tarski (see [11] and [12]) and, second, the semantic method of Kripke (see [5] and [6]); and there have been others. The aim of the present series of papers is to afford a synthesis of these methods. Thus, though new results are given, the interest lies rather in revealing interconnexions between familiar results and in providing a general framework for future research. In general, we show that semantic completeness results of the Kripke kind can be deduced from the algebraic results by means of one central theorem (Theorem 21).

Analysis and design of suitable model structures for activated sludge tanks with circulating flow

1999 ◽  
Vol 39 (4) ◽  
pp. 55-60 ◽  
Author(s):  
J. Alex ◽  
R. Tschepetzki ◽  
U. Jumar ◽  
F. Obenaus ◽  
K.-H. Rosenwinkel
Keyword(s):  
Activated Sludge ◽  
Large Scale ◽  
Wastewater Treatment Plants ◽  
Treatment Plant ◽  
High Sensitivity ◽  
Suitable Model ◽  
Model Structure ◽  
Analysis And Design ◽  
Hydraulic Behaviour ◽  
Model Structures

Activated sludge models are widely used for planning and optimisation of wastewater treatment plants and on line applications are under development to support the operation of complex treatment plants. A proper model is crucial for all of these applications. The task of parameter calibration is focused in several papers and applications. An essential precondition for this task is an appropriately defined model structure, which is often given much less attention. Different model structures for a large scale treatment plant with circulation flow are discussed in this paper. A more systematic method to derive a suitable model structure is applied to this case. Results of a numerical hydraulic model are used for this purpose. The importance of these efforts are proven by a high sensitivity of the simulation results with respect to the selection of the model structure and the hydraulic conditions. Finally it is shown, that model calibration was possible only by adjusting to the hydraulic behaviour and without any changes of biological parameters.

scholarly journals More on Modal Aspects of Default Logic1

1992 ◽  
Vol 17 (1-2) ◽  
pp. 99-116
Author(s):  
V. Wiktor Marek ◽  
Miroslaw Truszczynski
Keyword(s):  
Modal Logic ◽  
Default Logic ◽  
Nonmonotonic Logic ◽  
Default Reasoning ◽  
Default Theory ◽  
Autoepistemic Logic ◽  
The Relationship ◽  
Natural Classes ◽  
Weak Extension

Investigations of default logic have been so far mostly concerned with the notion of an extension of a default theory. It turns out, however, that default logic is much richer. Namely, there are other natural classes of objects that might be associated with default reasoning. We study two such classes of objects with emphasis on their relations with modal nonmonotonic formalisms. First, we introduce the concept of a weak extension and study its properties. It has long been suspected that there are close connections between default and autoepistemic logics. The notion of weak extension allows us to precisely describe the relationship between these two formalisms. In particular, we show that default logic with weak extensions is essentially equivalent to autoepistemic logic, that is, nonmonotonic logic KD45. In the paper we also study the notion of a set of formulas closed under a default theory. These objects are shown to correspond to stable theories and to modal logic S5. In particular, we show that skeptical reasoning with sets closed under default theories is closely related with provability in S5. As an application of our results we determine the complexity of reasoning with weak extensions and sets closed under default theories.

scholarly journals MODEL STRUCTURES ON TRIANGULATED CATEGORIES

2014 ◽  
Vol 57 (2) ◽  
pp. 263-284 ◽  
Author(s):  
XIAOYAN YANG
Keyword(s):  
Proper Class ◽  
Triangulated Category ◽  
Triangulated Categories ◽  
General Study ◽  
Proper Class Of Triangles ◽  
Cotorsion Pairs ◽  
One To One ◽  
The Relationship ◽  
Model Structures

AbstractWe define model structures on a triangulated category with respect to some proper classes of triangles and give a general study of triangulated model structures. We look at the relationship between these model structures and cotorsion pairs with respect to a proper class of triangles on the triangulated category. In particular, we get Hovey's one-to-one correspondence between triangulated model structures and complete cotorsion pairs with respect to a proper class of triangles. Some applications are given.

A Modal Semantics of Negation in Logic Programming

1992 ◽  
Vol 16 (3-4) ◽  
pp. 231-262
Author(s):  
Philippe Balbiani
Keyword(s):  
Modal Logic ◽  
Logic Programming ◽  
Modal Logics ◽  
Kripke Models ◽  
Logic Programs ◽  
Modal Semantics ◽  
Soundness And Completeness ◽  
Modal Completion ◽  
Well Foundedness

The beauty of modal logics and their interest lie in their ability to represent such different intensional concepts as knowledge, time, obligation, provability in arithmetic, … according to the properties satisfied by the accessibility relations of their Kripke models (transitivity, reflexivity, symmetry, well-foundedness, …). The purpose of this paper is to study the ability of modal logics to represent the concepts of provability and unprovability in logic programming. The use of modal logic to study the semantics of logic programming with negation is defended with the help of a modal completion formula. This formula is a modal translation of Clack’s formula. It gives soundness and completeness proofs for the negation as failure rule. It offers a formal characterization of unprovability in logic programs. It characterizes as well its stratified semantics.

New model structures and projective (injective) cotorsion pairs

2021 ◽  
Author(s):  
Aimin Xu
Keyword(s):  
Positive Integer ◽  
Triangulated Categories ◽  
Model Structure ◽  
Cotorsion Pair ◽  
Flat Dimension ◽  
Gorenstein Projective Module ◽  
Chain Complexes ◽  
Cotorsion Pairs ◽  
Gorenstein Injective ◽  
Model Structures

Let [Formula: see text] be either the category of [Formula: see text]-modules or the category of chain complexes of [Formula: see text]-modules and [Formula: see text] a cofibrantly generated hereditary abelian model structure on [Formula: see text]. First, we get a new cofibrantly generated model structure on [Formula: see text] related to [Formula: see text] for any positive integer [Formula: see text], and hence, one can get new algebraic triangulated categories. Second, it is shown that any [Formula: see text]-strongly Gorenstein projective module gives rise to a projective cotorsion pair cogenerated by a set. Finally, let [Formula: see text] be an [Formula: see text]-module with finite flat dimension and [Formula: see text] a positive integer, if [Formula: see text] is an exact sequence of [Formula: see text]-modules with every [Formula: see text] Gorenstein injective, then [Formula: see text] is injective.

An abstract algebraic logic approach to tetravalent modal logics

2000 ◽  
Vol 65 (2) ◽  
pp. 481-518 ◽  
Author(s):  
Josep Maria Font ◽  
Miquel Rius
Keyword(s):  
Algebraic Logic ◽  
Modal Logics ◽  
The Other ◽  
Abstract Algebraic Logic ◽  
Algebraic Semantics ◽  
Modal Algebras ◽  
Logic Approach ◽  
Abstract Logics ◽  
Joint Study

AbstractThis paper contains a joint study of two sentential logics that combine a many-valued character, namely tetravalence, with a modal character; one of them is normal and the other one quasinormal. The method is to study their algebraic counterparts and their abstract models with the tools of Abstract Algebraic Logic, and particularly with those of Brown and Suszko's theory of abstract logics as recently developed by Font and Jansana in their “A General Algebraic Semantics for Sentential Logics”. The logics studied here arise from the algebraic and lattice-theoretical properties we review of Tetravalent Modal Algebras, a class of algebras studied mainly by Loureiro, and also by Figallo. Landini and Ziliani, at the suggestion of the late Antonio Monteiro.

scholarly journals Canonical formulas via locally finite reducts and generalized dualities

10.29007/hgbj ◽  
2018 ◽  
Author(s):  
Nick Bezhanishvili
Keyword(s):  
Modal Logic ◽  
Intuitionistic Logic ◽  
Algebraic Approach ◽  
Modal Logics ◽  
Substructural Logic ◽  
Locally Finite ◽  
Canonical Formulas

The method of canonical formulas is a powerful tool for investigating intuitionistic and modal logics. In this talk I will discuss an algebraic approach to this method. I will mostly concentrate on the case of intuitionistic logic. But I will also review the case of modal logic and possible generalizations to substructural logic.

Sign in / Sign up

Export Citation Format

Share Document