Sémantique algébrique ďun système logique basé sur un ensemble ordonné fini

In order to modelize the reasoning of an intelligent agent represented by a poset T, H. Rasiowa introduced logic systems called “Approximation Logics”. In these systems a set of constants constitutes a fundamental tool. In this papers, we consider logic systems called L′_T without this kind of constants but limited to the case where T is a finite poset. We prove a weak deduction theorem. We introduce also an algebraic semantics using Hey ting algebra with operators. To prove the completeness theorem of the L′_T system with respect to the algebraic semantics, we use the method of H. Rasiowa and R. Sikorski for first order logic. In the propositional case, a corollary allows us to assert that it is decidable to know “if a propositional formula is valid”. We study also certain relations between the L′_T logic and the intuitionistic and classical logics.     

An Extension Principle for Fuzzy Logics

Let S be a set, P(S) the class of all subsets of S and F(S) the class of all fuzzy subsets of S. In this paper an “extension principle” for closure operators and, in particular, for deduction systems is proposed and examined. Namely we propose a way to extend any closure operator J defined in P(S) into a fuzzy closure operator J* defined in F(S). This enables us to give the notion of canonical extension of a deduction system and to give interesting examples of fuzzy logics. In particular, the canonical extension of the classical propositional calculus is defined and it is showed its connection with possibility and necessity measures. Also, the canonical extension of first order logic enables us to extend some basic notions of programming logic, namely to define the fuzzy Herbrand models of a fuzzy program. Finally, we show that the extension principle enables us to obtain fuzzy logics related to fuzzy subalgebra theory and graded consequence relation theory. Mathematics Subject Classification : 03B52.     

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.     

The trapezoidal fuzzy soft set and its application in MCDM

Soft set theory is a newly emerging mathematical tool to deal with uncertain problems. Since the trapezoidal fuzzy number, as a vital concept of fuzzy set, can express linguistic assessments by transforming them into numerical variables objectively, this paper aims to extend classical soft sets to trapezoidal fuzzy soft sets based on trapezoidal fuzzy numbers. Then, some operations on a trapezoidal fuzzy soft set are defined, such as complement operation, “AND” operation, and “OR” operation. Finally, a Multiple Criterion Decision-Making (MCDM) problem under a fuzzy environment is analyzed by trapezoidal fuzzy soft sets with the demonstration of a numerical example. This paper also uses traditional fuzzy soft sets to deal with the MCDM problem. The result shows that the method provided by this paper outperforms the traditional one.     

<Emphasis Type="Italic">p</Emphasis>-Adic probability logics

This paper represents an comprehensive overview of the results from three papers where we developed several propositional logics for reasoning about p-adic valued probability.Each of these logics is a sound, complete and decidable extension of classical propositional logic.     

Modal Extensions of Sub-classical Logics for Recovering Classical Logic

In this paper we introduce non-normal modal extensions of the sub-classical logics CLoN, CluN and CLaN, in the same way that S0.5 ⁰ extends classical logic. The first modal system is both paraconsistent and paracomplete, while the second one is paraconsistent and the third is paracomplete. Despite being non-normal, these systems are sound and complete for a suitable Kripke semantics. We also show that these systems are appropriate for interpreting □ as “is provable in classical logic”. This allows us to recover the theorems of propositional classical logic within three sub-classical modal systems.     

Additive fuzzy measures and integrals I

A point of view concerning “fuzzy measures” is explained. To this end, a new concept of “disjointness” for fuzzy is introduced and studied. Also, a concept of an “additive class of fuzzy sets” is defined to be a class of fuzzy sets closed under some “additive operations.” The fuzzy measures are defined to be sum-preserving real functions over such additive classes. Some basic properties of the fuzzy measures are derived. In contrast with other homonymous concepts studied in literature, our fuzzy measures lead to an additive fuzzy integral (see the part II of the paper).     

Algorithms for generating arguments and counterarguments in propositional logic

A common assumption for logic-based argumentation is that an argument is a pair 〈Φ,α〉 where Φ is minimal subset of the knowledgebase such that Φ is consistent and Φ entails the claim α. Different logics provide different definitions for consistency and entailment and hence give us different options for formalising arguments and counterarguments. The expressivity of classical propositional logic allows for complicated knowledge to be represented but its computational cost is an issue. In previous work we have proposed addressing this problem using connection graphs and resolution in order to generate arguments for claims that are literals. Here we propose a development of this work to generate arguments for claims that are disjunctive clauses of more than one disjunct, and also to generate counteraguments in the form of canonical undercuts (i.e. arguments that with a claim that is the negation of the conjunction of the support of the argument being undercut).     

Algebras of Recursively Enumerable Sets and Their Applications to Fuzzy Logic

Algebras of operations defined on recursively enumerable sets of different kinds are considered. Every such algebra is specified by a list of operations involved and a list of basic elements. An element of an algebra is said to be representable in this algebra if it can be obtained from given basic elements by operations of the algebra. Two kinds of recursively enumerable sets are considered: recursively enumerable sets in the usual sense and fuzzy recursively enumerable sets. On binary, i.e., two-dimensional recursively enumerable sets of these kinds, algebras of operations are introduced. An algebra θ is constructed in which all binary recursively enumerable sets are representable. A subalgebra θ⁰ of θ is constructed in which all binary recursively enumerable sets are representable if and only if they are described by formulas of Presburger’s arithmetic system. An algebra Ω is constructed in which all binary recursively enumerable fuzzy sets are representable. A subalgebra Ω⁰ of the algebra Ω is constructed such that fuzzy recursively enumerable sets representable in Ω⁰ can be treated as fuzzy counterparts of sets representable by formulas of Presburger’s system. Bibliography: 16 titles.__________Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 304, 2003, pp. 75–98.     

Fuzzy propositional logics

Fuzzy logic $\text{L}$_∞9 considered in connection with fuzzy sets theory, is a special theory, is a special many valued logic with truth-value sets [0, 1], which has been studied already by Lukasiewicz. We consider also his versions $\text{L}$_m for m ? 2 with finite truth-value sets. In all cases we add two further propositional connectives, one conjunction and one disjunction. For these logics we give a list of tautologies, consider relations between their sets of tautologies, prove their compactness, and mention some further results.     

A Shared Framework for Consequence Operations and Abstract Model Theory

In this paper we develop an abstract theory of adequacy. In the same way as the theory of consequence operations is a general theory of logic, this theory of adequacy is a general theory of the interactions and connections between consequence operations and its sound and complete semantics. Addition of axioms for the connectives of propositional logic to the basic axioms of consequence operations yields a unifying framework for different systems of classical propositional logic. We present an abstract model-theoretical semantics based on model mappings and theory mappings. Between the classes of models and theories, i.e., the set of sentences verified by a model, it obtains a connection that is well-known within algebra as Galois correspondence. Many basic semantical properties can be derived from this observation. A sentence A is a semantical consequence of T if every model of T is also a model of A. A model mapping is adequate for a consequence operation if its semantical inference operation is identical with the consequence operation. We study how properties of an adequate model mapping reflect the properties of the consequence operation and vice versa. In particular, we show how every concept of the theory of consequence operations can be formulated semantically.     

Fuzzy probability measures

In [4] Höhle has defined fuzzy measures on G-fuzzy sets [2] where G stands for a regular Boolean algebra. Consequently, since the unit interval is not complemented, fuzzy sets in the sense of Zadeh [8] do not fit in this framework in a straightforward manner. It is the purpose of this paper to continue the work started in [5] which deals with [0,1]-fuzzy sets and to give a natural definition of a fuzzy probability measure on a fuzzy measurable space [5]. We give necessary and sufficient conditions for such a measure to be a classical integral as in [9] in the case the space is generated. A counterexample in the general case is also presented. Finally it is shown that a fuzzy probability measure is always an integral (if the space is generated) if we replace the operations ∧ and ∨ by the t-norm T_o and its dual S₀ (see [6]).     

POWERSET OPERATOR BASED FOUNDATION FORPOINT-SET LATTICE-THEORETIC (POSLAT) FUZZY SET THEORIES and TOPOLOGIES

Abstract

This paper sets forth in detail point-set lattice-theoretic or poslat foundations of all mathematical and fuzzy set disciplines in which the operations of taking the image and pre-image of (fuzzy) subsets play a fundamental role; such disciplines include algebra, measure and probability theory, and topology. In particular, those aspects of fuzzy sets, hinging around (crisp) powersets of fuzzy subsets and around powerset operators between such powersets lifted from ordinary functions between the underlying base sets, are examined and characterized using point-set and lattice-theoretic methods. The basic goal is to uniquely derive the powerset operators and not simply stipulate them, and in doing this we explicitly distinguish between the “fixed-basis” case (where the underlying lattice of membership values is fixed for the sets in question) and the “variable-basis” case (where the underlying lattice of membership values is allowed to change). Applications to fuzzy sets/logic include: development and justification/characterization of the Zadeh Extension Principle [36], with applications for fuzzy topology and measure theory; characterizations of ground category isomorphisms; rigorous foundation for fuzzy topology in the poslat sense; and characterization of those fuzzy associative memories in the sense of Kosko [18] which are powerset operators. Some results appeared without proof in [31], some with partial proofs in [32], and some in the fixed-basis case in Johnstone [13] and Manes [22].     

PROPOSITIONAL LOGIC,FRAMES, AND FUZZY ALGEBRA

Abstract

This paper offers a new look at such things as the fuzzy subalgebras and congruences of an algebra, the fuzzy ideals of a ring or a lattice, and similar entities, by exhibiting them as the models, in the chosen frame T of truth values, of naturally corresponding propositional theories. This provides a systematic approach to the study of the partially ordered sets formed by these various entities, and we demonstrate its usefulness by employing it to derive a number of results, some old and some new, concerning these partially ordered sets. In particular, we prove they are complete lattices, algebraic or continuous, depending on whether T is algebraic or continuous, respectively (Proposition 3); they satisfy the same lattice identities for arbitrary T that hold in the case T = 2 (Corollary of Proposition 4); and they are coherent frames for any coherent T whenever this is the case for T = 2 (Proposition 6). In addition we show, generalizing a result by Makamba and Murali [10], that the familiar classical situations where the congruences of an algebra correspond to certain other entities, such as the normal subgroups of a group or the ideals of a ring, extend to the fuzzy case by proving that the corresponding propositional theories are equivalent (Proposition 2). Further, we obtain the result of Gupta and Kantroo [5] that the fuzzy radical ideals of a commutative ring with unit are the meets of fuzzy prime ideals for arbitrary continuous T in place of the unit interval, using basic facts concerning continuous frames (Proposition 7).     

Images and preimages of subobjects under the morphisms in a new category of fuzzy sets-I

This paper is the third in a sequence of papers on categories by the same authors. In one of the papers, a new category of fuzzy sets was defined and a few results were established pertaining to that special category of fuzzy sets S. Here, the concept of a fuzzy subset of a fuzzy set is defined under the category S. Besides, the notions of images and preimages of fuzzy sets are also defined under morphisms in the category of fuzzy sets and how smoothly these images and preimages behave under the action of these morphisms is analyzed. Finally, results have been proved on algebra of morphisms of this category S.     

Bilattice logic of epistemic actions and knowledge

Baltag, Moss, and Solecki proposed an expansion of classical modal logic, called logic of epistemic actions and knowledge (EAK), in which one can reason about knowledge and change of knowledge. Kurz and Palmigiano showed how duality theory provides a flexible framework for modeling such epistemic changes, allowing one to develop dynamic epistemic logics on a weaker propositional basis than classical logic (for example an intuitionistic basis). In this paper we show how the techniques of Kurz and Palmigiano can be further extended to define and axiomatize a bilattice logic of epistemic actions and knowledge (BEAK). Our propositional basis is a modal expansion of the well-known four-valued logic of Belnap and Dunn, which is a system designed for handling inconsistent as well as potentially conflicting information. These features, we believe, make our framework particularly promising from a computer science perspective.     

Fuzzy Modal Logics

In the paper we introduce formal calculi which are a generalization of propositional modal logics. These calculi are called fuzzy modal logics. We introduce the concept of a fuzzy Kripke model and consider a semantics of these calculi in the class of fuzzy Kripke models. The main result of the paper is the completeness theorem of a minimal fuzzy modal logic in the class of fuzzy Kripke models.__________Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 9, No. 1, pp. 201–230, 2003.     

An epistemic model of an agent who does not reflect on reasoning processes

This paper introduces an epistemic model of a boundedly rational agent under the two assumptions that (i) the agent’s reasoning process is in accordance with the model but (ii) the agent does not reflect on these reasoning processes. For such a concept of bounded rationality a semantic interpretation by the possible world semantics of the Kripke (1963) type is no longer available because the definition of knowledge in these possible world semantics implies that the agent knows all valid statements of the model. The key to my alternative semantic approach is the extension of the method of truth tables, first introduced for the propositional logic by Wittgenstein (1922), to an epistemic logic so that I can determine the truth value of epistemic statements for all relevant truth conditions. In my syntactic approach I define an epistemic logic–consisting of the classical calculus of propositional logic plus two knowledge axioms–that does not include the inference rule of necessitation, which claims that an agent knows all theorems of the logic. As my main formal result I derive a determination theorem linking my semantic with my syntactic approach. The difference between my approach and existing knowledge models is illustrated in a game-theoretic application concerning the epistemic justification of iterative solution concepts.     

The fuzzy tychonoff theorem

Much of topology can be done in a setting where open sets have “fuzzy boundaries.” To render this precise, the paper first describes cl_∞-monoids, which are used to measure the degree of membership of points in sets. Then L- or “fuzzy” sets are defined, and suitable collections of these are called L-topological spaces. A number of examples and results for such spaces are given. Perhaps most interesting is a version of the Tychonoff theorem which gives necessary and sufficient conditions on L for all collections with given cardinality of compact L-spaces to have compact product.     

Leibniz’s Logic and the “Cube of Opposition”

After giving a short summary of the traditional theory of the syllogism, it is shown how the square of opposition reappears in the much more powerful concept logic of Leibniz (1646–1716). Within Leibniz’s algebra of concepts (which may be regarded as an “intensional” counterpart of the extensional Boolean algebra of sets), the categorical forms are formalized straightforwardly by means of the relation of concept-containment plus the operator of concept-negation as ‘S contains P’ and ‘S contains Not-P’, ‘S doesn’t contain P’ and ‘S doesn’t contain Not-P’, respectively. Next we consider Leibniz’s version of the so-called Quantification of the Predicate which consists in the introduction of four additional forms ‘Every S is every P’, ‘Some S is every P’, ‘Every S isn’t some P’, and ‘Some S isn’t some P’. Given the logical interpretation suggested by Leibniz, these unorthodox propositions also form a Square of Opposition which, when added to the traditional Square, yields a “Cube of Opposition”. Finally it is shown that besides the categorical forms, also the non-categorical forms can be formalized within an extension of Leibniz’s logic where “indefinite concepts” X, Y, Z\({\ldots}\) function as quantifiers and where individual concepts are introduced as maximally consistent concepts.