Fuzzy events and fuzzy logics in classical information systems

Classical information systems are introduced in the framework of measure and integration theory. The measurable characteristic functions are identified with the exact events while the fuzzy events are the real measurable functions whose range is contained in the unit interval. Two orthogonality relations are introduced on fuzzy events, the first linked to the fuzzy logic and the second to the fuzzy structure of partial a Baer¹-ring. The fuzzy logic is then compared with the “empirical” fuzzy logic induced by the classical information system. In this context, quantum logics could be considered as those empirical fuzzy logics in which it is not possible to have preparation procedures which provide physical systems whose “microstate” is always exactly defined.     

Barwise's Information Frames and Modal Logics

The article studies Barwise's information frames and settles the problem of Barwise dealing in finding axiomatizations for the modal logics generated by information frames. We find axiomatic systems for: (i) the modal logic of all complete information frames; (ii) the logic of all sound and complete information frames; (iii) the logic of all hereditary and complete information frames; (iv) the logic of all complete, sound, and hereditary information frames; (v) the logic of all consistent and complete information frames. The notion of weak modal logics is also proposed, and it is shown that the weak modal logics generated by all information frames and by all hereditary information frames are K and K4, respectively. Toward a general theory, we prove that any Kripke complete modal logic is a modal logic of a certain class of information frames, and that every modal logic generated by any given class of complete, rarefied, and fully classified information frames is Kripke complete.     

Formal systems of fuzzy logic and their fragments

Formal systems of fuzzy logic (including the well-known Łukasiewicz and Gödel–Dummett infinite-valued logics) are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research in any class of non-classical logics. Here we study the fragments of nine prominent fuzzy logics to all sublanguages containing implication. However, the results achieved in the paper for those nine logics are usually corollaries of theorems with much wider scope of applicability. In particular, we show how many of these fragments are really distinct and we find axiomatic systems for most of them. In fact, we construct strongly separable axiomatic systems for eight of our nine logics. We also fully answer the question for which of the studied fragments the corresponding class of algebras forms a variety. Finally, we solve the problem how to axiomatize predicate versions of logics without the lattice disjunction (an essential connective in the usual axiomatic system of fuzzy predicate logics).     

Admissibility and refutation: some characterisations of intermediate logics

Refutation systems are formal systems for inferring the falsity of formulae. These systems can, in particular, be used to syntactically characterise logics. In this paper, we explore the close connection between refutation systems and admissible rules. We develop technical machinery to construct refutation systems, employing techniques from the study of admissible rules. Concretely, we provide a refutation system for the intermediate logics of bounded branching, known as the Gabbay–de Jongh logics. We show that this gives a characterisation of these logics in terms of their admissible rules. To illustrate the technique, we also provide a refutation system for Medvedev’s logic.     

A normal form which preserves tautologies and contradictions in a class of fuzzy logics

Most of the normal forms for fuzzy logics are versions of conjunctive and disjunctive classical normal forms. Unfortunately, they do not always preserve tautologies and contradictions which is important, for example, for automated theorem provers based on refutation methods.De Morgan implicative systems are triples like the De Morgan systems, which consider fuzzy implications instead of t-conorms. These systems can be used to evaluate the formulas of a propositional language based on the logical connectives of negation, conjunction and implication. Therefore, they determine different fuzzy logics, called implicative De Morgan fuzzy logics.In this paper, we will introduce a normal form for implicative De Morgan systems and we will show that for implicative De Morgan fuzzy logics whose t-norms are strict, this normal form preserves contradictions as well as tautologies.     

The Pursuit of an Implication for the Logics L3A and L3B

The authors of Beziau and Franceschetto (New directions in paraconsistent logic, vol 152, Springer, New Delhi, 2015) work with logics that have the property of not satisfying any of the formulations of the principle of non contradiction, Béziau and Franceschetto also analyze, among the three-valued logics, which of these logics satisfy this property. They prove that there exist only four of such logics, but only two of them are worthwhile to study. The language of these logics does not consider implication as a connective. However, the enrichment of a language with an implication connective leads us to more interesting systems, therefore we look for one implication for these logics and we study further properties that the logics obtain when this connective is added to these systems.     

A Routley–Meyer Semantics for Gödel 3-Valued Logic and Its Paraconsistent Counterpart

Routley–Meyer semantics (RM-semantics) is defined for Gödel 3-valued logic G3 and some logics related to it among which a paraconsistent one differing only from G3 in the interpretation of negation is to be remarked. The logics are defined in the Hilbert-style way and also by means of proof-theoretical and semantical consequence relations. The RM-semantics is defined upon the models for Routley and Meyer’s basic positive logic B₊, the weakest positive RM-semantics. In this way, it is to be expected that the models defined can be adapted to other related many-valued logics.     

Two Semantical Approaches to Paraconsistent Modalities

In this paper we extend the anodic systems introduced in Bueno-Soler (J Appl Non Class Logics 19(3):291–310, 2009) by adding certain paraconsistent axioms based on the so called logics of formal inconsistency, introduced in Carnielli et al. (Handbook of philosophical logic, Springer, Amsterdam, 2007), and define the classes of systems that we call cathodic. These classes consist of modal paraconsistent systems, an approach which permits us to treat with certain kinds of conflicting situations. Our interest in this paper is to show that such systems can be semantically characterized in two different ways: by Kripke-style semantics and by modal possible-translations semantics. Such results are inspired in some universal constructions in logic, in the sense that cathodic systems can be seen as a kind of fusion (a particular case of fibring) between modal logics and non-modal logics, as discussed in Carnielli et al. (Analysis and synthesis of logics, Springer, Amsterdam, 2007). The outcome is inherently within the spirit of universal logic, as our systems semantically intermingles modal logics, paraconsistent logics and many-valued logics, defining new blends of logics whose relevance we intend to show.     

Logics with disjunction and proof by cases

This paper is a contribution to the general study of consequence relations which contain (definable) connective of “disjunction”. Our work is centered around the “proof by cases property”, we present several of its equivalent definitions, and show some interesting applications, namely in constructing axiomatic systems for intersections of logics and recognizing weakly implicative fuzzy logics among the weakly implicative ones. The work of the first author was supported by the National Foundation of Natural Sciences of China (Grant no. 60663002) and by the Grant Project of science and technology of The Education Department of Jiangxi Province under Grant no. 200618. The work of the second author was supported by grant A100300503 of the Grant Agency of the Academy of Sciences of the Czech Republic and by Institutional Research Plan AVOZ10300504.     

Barwise's information frames and modal logics

 The paper studies Barwise's information frames and answers the John Barwise question: to find axiomatizations for the modal logics generated by information frames. We find axiomatic systems for (i) the modal logic of all complete information frames, (ii) the logic of all sound and complete information frames, (iii) the logic of all hereditary and complete information frames, (iv) the logic of all complete, sound and hereditary information frames, and (v) the logic of all consistent and complete information frames. The notion of weak modal logics is also proposed, and it is shown that the weak modal logics generated by all information frames and by all hereditary information frames are K and K4 respectively. To develop general theory, we prove that (i) any Kripke complete modal logic is the modal logic of a certain class of information frames and that (ii) the modal logic generated by any given class of complete, rarefied and fully classified information frames is Kripke complete. This paper is dedicated to the memory of talented mathematician John Barwise. Received: 7 May 2000 Published online: 10 October 2002 Key words or phrases: Knowledge presentation – Information – Information flow – Information frames – Modal logic-Kripke model     

Propositional union closed team logics

In this paper, we study several propositional team logics that are closed under unions, including propositional inclusion logic. We show that all these logics are expressively complete, and we introduce sound and complete systems of natural deduction for these logics. We also discuss the locality property and its connection with interpolation in these logics.     

Clausal resolution for normal modal logics

We present a clausal resolution-based method for normal modal logics. Differently from other approaches, where inference rules are based on the syntax of a particular set of axioms, we focus on the restrictions imposed on the binary accessibility relation for each particular normal logic. We provide soundness and completeness results for all fifteen families of multi-modal normal logics whose accessibility relations have the property of being non-restricted, reflexive, serial, transitive, Euclidean, or symmetric.     

Branching Time Logics with Multiagent Temporal Accessibility Relations

Siberian Mathematical Journal - Under study are the branching time temporal logics with temporal accessibility relations for the agents different in length and content. We find...     

Algebraizable logics with a strong conjunction and their semi-lattice based companions

The best known algebraizable logics with a conjunction and an implication have the property that the conjunction defines a meet semi-lattice in the algebras of their algebraic counterpart. This property makes it possible to associate with them a semi-lattice based deductive system as a companion. Moreover, the order of the semi-lattice is also definable using the implication. This makes that the connection between the properties of the logic and the properties of its semi-lattice based companion is strong. We introduce a class of algebraizable deductive systems that includes those systems, and study some of their properties and of their semi-lattice based companions. We also study conditions which, when satisfied by a deductive system in the class, imply that it is strongly algebraizable. This brings some information on the open area of research of Abstract Algebraic Logic which consists in finding interesting characterizations of classes of algebraizable logics that are strongly algebraizable.     

Sequent Calculi with Analytic Cut for Logics of Time and Knowledge with Perfect Recall

In this paper, we consider two logics of time and knowledge. These logics involve the discrete time linear temporal logic operators ``next' and ``until'. In addition, they contain an indexed set of unary epistemic modalities ``agent $i$ knows'. In these logics, the temporal and epistemic dimensions may interact. The particular interactions we consider capture perfect recall. We consider perfect recall in synchronously distributed systems and in systems without any assumptions. For these logics, we present sequent calculi with an analytic cut rule. Thus, we get proof systems where proof-search becomes decidable. The soundness and completeness of these calculi are proved.     

基于吴方法的多值模型检验

大型复杂系统的开发过程中不可避免的涉及到非确定或不一致信息的处理,而多值模型检验作为经典模型检验的一种扩展,是处理和分析包含此类信息模型的一种有效手段.提出了一种系统化的多值逻辑(涵盖经典逻辑)的代数表示方法,使用吴方法的基本思想和框架实现复杂系统形式验证中基于多值逻辑的模型检验的代数化,建立了通过吴方法实现多值模型检验技术的整体框架.这种代数化的多值模型检验方法可以作为现有方法的有力补充.     

The Beth property and interpolation in lattice-based algebras and logics

We deal with logics based on lattices with an additional unary operation. Interrelations of different versions of interpolation, the Beth property, and amalgamation, as they bear on modal logics and varieties of modal algebras, superintuitionistic logics and varieties of Heyting algebras, positive logics and varieties of implicative lattices, have been studied in many works. Sometimes these relations can and sometimes cannot be extended to the logics without implication considered in the paper. Supported by INTAS (grant No. 04-77-7080) and by RFBR (grant No. 06-01-00358). Supported by INTAS grant No. 04-77-7080. __________ Translated from Algebra i Logika, Vol. 47, No. 3, pp. 307–334, May–June, 2008.     

Sequent Systems for Negative Modalities

Non-classical negations may fail to be contradictory-forming operators in more than one way, and they often fail also to respect fundamental meta-logical properties such as the replacement property. Such drawbacks are witnessed by intricate semantics and proof systems, whose philosophical interpretations and computational properties are found wanting. In this paper we investigate congruential non-classical negations that live inside very natural systems of normal modal logics over complete distributive lattices; these logics are further enriched by adjustment connectives that may be used for handling reasoning under uncertainty caused by inconsistency or undeterminedness. Using such straightforward semantics, we study the classes of frames characterized by seriality, reflexivity, functionality, symmetry, transitivity, and some combinations thereof, and discuss what they reveal about sub-classical properties of negation. To the logics thereby characterized we apply a general mechanism that allows one to endow them with analytic ordinary sequent systems, most of which are even cut-free. We also investigate the exact circumstances that allow for classical negation to be explicitly defined inside our logics.     

Some Multi-Conclusion Modal Paralogics

I give a systematic presentation of a fairly large family of multiple-conclusion modal logics that are paraconsistent and/or paracomplete. After providing motivation for studying such systems, I present semantics and tableau-style proof theories for them. The proof theories are shown to be sound and complete with respect to the semantics. I then show how the “standard” systems of classical, single-conclusion modal logics fit into the framework constructed.     

Nontransitive temporal multiagent logic,information and knowledge,deciding algorithms

Multiagent and temporal logics are active domains in Information Sciences, CS, and AI. Attention has predominantly focused on the logics based on transitive relational models, with particular emphasis on transitive time. But this does not seem rather reliable assumption. Nontransitivity of passing information may be demonstrated with relative ease through persuasive examples. Therefore, we introduce and study multiagent temporal logics that are based on nontransitive linear time. Another innovative step is consideration of incomplete information: the information/knowledge with lacunas,—the linear time with forgettable intervals of time in the past. Technically, the most important problems are problems of satisfiability and decidability of suggested logics. The main results are the algorithms that compute satisfiability and solve decidability (and so provide solutions to these problems). The paper concludes by posing a series of open problems.