Very and more or less in non-commutative fuzzy logic

In this paper we consider fuzzy subsets of a universe as L-fuzzy subsets instead of [ 0, 1 ]-valued, where L is a complete lattice. We enrich the lattice L by adding some suitable operations to make it into a pseudo-BL algebra. Since BL algebras are main frameworks of fuzzy logic, we propose to consider the non-commutative BL-algebras which are more natural for modeling the fuzzy notions. Based on reasoning with in non-commutative fuzzy logic we model the linguistic modifiers such as very and more or less and give an appropriate membership function for each one by taking into account the context of the given fuzzy notion by means of resemblance L-fuzzy relations.     

Extremal states on bounded residuated \ell-monoids with general comparability

Bounded residuated lattice ordered monoids (RlR\ell-monoids) are a common generalization of pseudo-BLBL-algebras and Heyting algebras, i.e. algebras of the non-commutative basic fuzzy logic (and consequently of the basic fuzzy logic, the Łukasiewicz logic and the non-commutative Łukasiewicz logic) and the intuitionistic logic, respectively. We investigate bounded RlR\ell-monoids satisfying the general comparability condition in connection with their states (analogues of probability measures). It is shown that if an extremal state on Boolean elements fulfils a simple condition, then it can be uniquely extended to an extremal state on the RlR\ell-monoid, and that if every extremal state satisfies this condition, then the RlR\ell-monoid is a pseudo-BLBL-algebra.     

Observations on non-commutative fuzzy logic

The paper presents some results on the logic psBL (pseudo-basic fuzzy logic, the generalization of BL not assuming commutativity of conjunction) and on the analogous logic psMTL – a non-commutative version of the monoidal t-norm logic MTL of Esteva and Godo.Partial support of the project No LN00A056 (ITI) of the Ministry of Education (MMT) of the Czech Republic is acknowledged. Thanks are due to F. Esteva and the anonymous referee for their comments on a draft of this paper.     

Interval valued (\in,\in\!\vee\,q) -fuzzy filters of pseudo BL-algebras

We introduce the concept of quasi-coincidence of a fuzzy interval value with an interval valued fuzzy set. By using this new idea, we introduce the notions of interval valued -fuzzy filters of pseudo BL-algebras and investigate some of their related properties. Some characterization theorems of these generalized interval valued fuzzy filters are derived. The relationship among these generalized interval valued fuzzy filters of pseudo BL-algebras is considered. Finally, we consider the concept of implication-based interval valued fuzzy implicative filters of pseudo BL-algebras, in particular, the implication operators in Lukasiewicz system of continuous-valued logic are discussed.     

n-Fold obstinate filters in BL-algebras

In this paper, we introduced the notion of n-fold obstinate filter in BL-algebras and we stated and proved some theorems, which determine the relationship between this notion and other types of n-fold filters in a BL-algebra. We proved that if F is a 1-fold obstinate filter, then A/F is a Boolean algebra. Several characterizations of n-fold fantastic filters are given, and we show that A is a n-fold fantastic BL-algebra if A is a MV-algebra (n ≥ 1) and A is a 1-fold positive implicative BL-algebra if A is a Boolean algebra. Finally, we construct some algorithms for studying the structure of the finite BL-algebras and n-fold filters in finite BL-algebras.     

Finiteness based results in BL-algebras

BL-algebras were introduced by P. Hájek as algebraic structures of Basic Logic. The aim of this paper is to survey known results about the structure of finite BL-algebras and natural dualities for varieties of BL-algebras. Extending the notion of ordinal sum of BL-algebras , we characterize a class of finite BL-algebras, actually BL-comets, which can be seen as a generalization of finite BL-chains. Then, just using BL-comets, we can represent any finite BL-algebra A as a direct product of BL-comets. This result can be seen as a generalization of the representation of finite MV-algebras as a direct product of MV-chains. Then we consider the varieties generated by one finite non-trivial totally ordered BL-algebra. For each of these varieties, we show the existence of a strong duality. As an application of the dualities, the injective and the weak injective members of these classes are described.     

The Variety Generated by Perfect BL-Algebras: an Algebraic Approach in a Fuzzy Logic Setting

BL-algebras are the Lindenbaum algebras of the propositional calculus coming from the continuous triangular norms and their residua in the real unit interval. Any BL-algebra is a subdirect product of local (linear) BL-algebras. A local BL-algebra is either locally finite (and hence an MV-algebra) or perfect or peculiar. Here we study extensively perfect BL-algebras characterizing, with a finite scheme of equations, the generated variety. We first establish some results for general BL-algebras, afterwards the variety is studied in detail. All the results are parallel to those ones already existing in the theory of perfect MV-algebras, but these results must be reformulated and reproved in a different way, because the axioms of BL-algebras are obviously weaker than those for MV-algebras.     

Some types of filters in BL algebras

In this paper we introduce some types of filters in a BL algebra A, and we state and prove some theorems which determine the relationship between these notions and other filters of a BL algebra, and by some examples we show that these notions are different. Also we consider some relations between these filters and quotient algebras that are constructed via these filters.     

A Generalization of Local Fuzzy Structures

The class of bounded residuated lattice ordered monoids Rl-monoids) contains as proper subclasses the class of pseudo BL-algebras (and consequently those of pseudo MV-algebras, BL-algebras and MV-algebras) and of Heyting algebras. In the paper we introduce and investigate local bounded Rl-monoids which generalize local algebras from the above mentioned classes of fuzzy structures. Moreover, we study and characterize perfect bounded Rl-monoids.     

On very true operators on pocrims

Hájek introduced the logic enriching the logic BL by a unary connective vt which is a formalization of Zadeh’s fuzzy truth value “very true”. algebras, i.e., BL-algebras with unary operations, called vt-operators, which are among others subdiagonal, are an algebraic counterpart of Partially ordered commutative integral residuated monoids (pocrims) are common generalizations of both BL-algebras and Heyting algebras. The aim of our paper is to introduce and study algebraic properties of pocrims endowed by “very-true” and “very-false”-like operators. Research is supported by the Research and Development Council of Czech Government via project MSN 6198959214.     

An Until Hierarchy and Other Applications of an Ehrenfeucht–Fraïssé Game for Temporal Logic

We prove there is a strict hierarchy of expressive power according to the Until depth of linear temporal logic (LTL) formulas: for each k, there is a natural property, based on quantitative fairness, that is not expressible with k nestings of Until operators, regardless of the number of applications of other operators, but is expressible by a formula with Until depth k+1. Our proof uses a new Ehrenfeucht–Fraïssé (EF) game designed specifically for LTL. These properties can all be expressed in first-order logic with quantifier depth and size (log k), and we use them to observe some interesting relationships between LTL and first-order expressibility. We note that our Until hierarchy proof for LTL carries over to the branching time logics, CTL and CTL*. We then use the EF game in a novel way to effectively characterize (1) the LTL properties expressible without Until, as well as (2) those expressible without both Until and Next. By playing the game “on finite automata,” we prove that the automata recognizing languages expressible in each of the two fragments have distinctive structural properties. The characterization for the first fragment was originally proved by Cohen, Perrin, and Pin using sophisticated semigroup-theoretic techniques. They asked whether such a characterization exists for the second fragment. The technique we develop is general and can potentially be applied in other contexts.     

<Emphasis Type="Italic">FC</Emphasis>-normal and extended stratified logic program

This paper investigates the consistency property ofFC-normal logic program and presents an equivalent deciding condition whether a logic programP is anFC-normal program. The deciding condition describes the characterizations ofFC-normal program. By the Petri-net presentation of a logic program, the characterizations of stratification ofFC-normal program are investigated. The stratification ofFC-normal program motivates us to introduce a new kind of stratification, extended stratification, over logic program. It is shown that an extended (locally) stratified logic program is anFC-normal program. Thus, an extended (locally) stratified logic program has at least one stable model. Finally, we have presented algorithms about computation of consistency property and a few equivalent deciding methods of the finiteFC-normal program.     

Basic fuzzy logic and BL-algebras

 The many-valued propositional logic BL (basic fuzzy logic) is investigated. It is known to be complete for tautologies over BL-algebras (particular residuated lattices). Each continuous t-norm on [0,1] determines a BL-algebra; such algebras are called t-algebras. Two additional axioms B1, B2 are found such that BL+(B1,B2) is complete for tautologies over t-algebras. It remains open whether B1, B2 are provable in BL.     

Separation axioms in (semi)topological quotient BL-algebras

In this paper, we study the relationship between separation axioms and (semi)topological quotient BL-algebras. We bring some conditions under which a (semi)topological quotient BL-algebra becomes a T ₁-space or Hausdorff or regular or normal. Also, we use maximum condition to get a Hausdorff or regular or normal (semi)topological quotien BL-algebra.     

Consistency Property of Finite FC-Normal Logic Programs

Marek＇s forward-chaining construction is one of the important techniques for investigating the non-monotonic reasoning. By introduction of consistency property over a logic program, they proposed a class of logic programs, FC-normal programs, each of which has at least one stable model. However, it is not clear how to choose one appropriate consistency property for deciding whether or not a logic program is FC-normal. In this paper, we firstly discover that, for any finite logic programⅡ, there exists the least consistency property LCon（Ⅱ） overⅡ, which just depends onⅡitself, such that, Ⅱ is FC-normal if and only ifⅡ is FC-normal with respect to （w.r.t.） LCon（Ⅱ）. Actually, in order to determine the FC-normality of a logic program, it is sufficient to check the monotonic closed sets in LCon（Ⅱ） for all non-monotonic rules, that is LFC（Ⅱ）. Secondly, we present an algorithm for computing LFC（Ⅱ）. Finally, we reveal that the brave reasoning task and cautious reasoning task for FC-normal logic programs are of the same difficulty as that of normal logic programs.     

The Specification Logic νZ

This paper introduces a wide-spectrum specification logic νZ. The minimal core logic is extended to a more expressive specification logic which includes a schema calculus similar (but not equivalent) to Z, some new additional schema operators and extensions to a programming and program development logic.     

A Restricted Second Order Logic for Finite Structures

We introduce a restricted version of second order logic SO^ωin which the second order quantifiers range over relations that are closed under the equivalence relation ≡^kofkvariable equivalence, for somek. This restricted second order logic is an effective fragment of the infinitary logicL^ω_∞ω, but it differs from other such fragments in that it is not based on a fixed point logic. We explore the relationship of SO^ωwith fixed point logics, showing that its inclusion relations with these logics are equivalent to problems in complexity theory. We also look at the expressibility of NP-complete problems in this logic.     

Minimal prime state filters and state radicals on state pseudo $${ }$$-algebras

The aim of this paper is the study of some classes of state filters of a state pseudo BL-algebra. The concepts of minimal prime state filter and of state hyperarchimedean pseudo BL-algebra are introduced and a characterization of a state hyperarchimedean pseudo BL-algebra is presented. Also, we define the notion of a state radical of a state filter of a state pseudo BL-algebra, we present a characterization of a state radical and some of its properties. The algebra of state radicals of a state pseudo BL-algebra is studied.     

Limitations of the Program Memory and the Expressive Power of Dynamic Logics

For a dynamic logic L we study dynamic logics L_n for which programs allowed in formulas cannot use more than n variables. We prove that there exists a structure A of a finite signature such that for a wide class of dynamic logics L and for every natural number n the logic L_n+1 is more expressive over A than L_n. This result is based on a construction of some canonical form for the formulas of L_n over a free one-generated groupoid.