Universal Classes of MV‐chains with Applications to Many‐valued Logics

In this paper we characterize, classify and axiomatize all universal classes of MV‐chains. Moreover, we accomplish analogous characterization, classification and axiomatization for congruence distributive quasivarieties of MV‐algebras. Finally, we apply those results to study some finitary extensions of the Łukasiewicz infinite valued propositional calculus.     

n ‐fold filters in BL‐algebras

In this paper we introduce n ‐fold (positive) implicative basis logic and the related algebras called n ‐fold (positive) implicative BL‐algebras. Also we define n ‐fold (positive) implicative filters and we prove some relations between these filters and construct quotient algebras via these filters. (© 2008 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Hyper‐Archimedean BL‐algebras are MV‐algebras

Generalizations of Boolean elements of a BL‐algebra L are studied. By utilizing the MV‐center MV(L) of L, it is reproved that an element x ∈ L is Boolean iff x ∨ x * = 1 . L is called semi‐Boolean if for all x ∈ L, x * is Boolean. An MV‐algebra L is semi‐Boolean iff L is a Boolean algebra. A BL‐algebra L is semi‐Boolean iff L is an SBL‐algebra. A BL‐algebra L is called hyper‐Archimedean if for all x ∈ L, xⁿ is Boolean for some finite n ≥ 1. It is proved that hyper‐Archimedean BL‐algebras are MV‐algebras. The study has application in mathematical fuzzy logics whose Lindenbaum algebras are MV‐algebras or BL‐algebras. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Representations of MV‐algebras by sheaves

In this paper, inspired by methods of Bigard, Keimel, and Wolfenstein ([2]), we develop an approach to sheaf representations of MV‐algebras which combines two techniques for the representation of MV‐algebras devised by Filipoiu and Georgescu ([18]) and by Dubuc and Poveda ([16]). Following Davey approach ([12]), we use a subdirect representation of MV‐algebras that is based on local MV‐algebras. This allowed us to obtain: (a) a representation of any MV‐algebras as MV‐algebra of all global sections of a sheaf of local MV‐algebras on the spectruum of its prime ideals; (b) a representation of MV‐algebras, having the space of minimal prime ideals compact, as MV‐algebra of all global sections of a Hausdorff sheaf of MV‐chains on the space of minimal prime ideals, which is a Stone space; (c) an adjunction between the category of all MV‐algebras and the category of MV‐algebraic spaces, where an MV‐algebraic space is a pair (X, F), where X is a compact topological space and F is a sheaf of MV‐algebras with stalks that are local (© 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Kripke‐style semantics for many‐valued logics

This paper deals with Kripke‐style semantics for many‐valued logics. We introduce various types of Kripke semantics, and we connect them with algebraic semantics. As for modal logics, we relate the axioms of logics extending MTL to properties of the Kripke frames in which they are valid. We show that in the propositional case most logics are complete but not strongly complete with respect to the corresponding class of complete Kripke frames, whereas in the predicate case there are important many‐valued logics like BL, ? and Π, which are not even complete with respect to the class of all predicate Kripke frames in which they are valid. Thus although very natural, Kripke semantics seems to be slightly less powerful than algebraic semantics. (© 2003 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Glivenko like theorems in natural expansions of BCK‐logic

The classical Glivenko theorem asserts that a propositional formula admits a classical proof if and only if its double negation admits an intuitionistic proof. By a natural expansion of the BCK‐logic with negation we understand an algebraizable logic whose language is an expansion of the language of BCK‐logic with negation by a family of connectives implicitly defined by equations and compatible with BCK‐congruences. Many of the logics in the current literature are natural expansions of BCK‐logic with negation. The validity of the analogous of Glivenko theorem in these logics is equivalent to the validity of a simple one‐variable formula in the language of BCK‐logic with negation. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Quantifier‐eliminable locally finite graphs

We identify the locally finite graphs that are quantifier‐eliminable and their first order theories in the signature of distance predicates. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

On the hamiltonicity of line graphs of locally finite, 6‐edge‐connected graphs

The topological approach to the study of infinite graphs of Diestel and KÜhn has enabled several results on Hamilton cycles in finite graphs to be extended to locally finite graphs. We consider the result that the line graph of a finite 4‐edge‐connected graph is hamiltonian. We prove a weaker version of this result for infinite graphs: The line graph of locally finite, 6‐edge‐connected graph with a finite number of ends, each of which is thin, is hamiltonian.     

Algebraization of the Three‐valued BCK‐logic

In this paper a definition of n‐valued system in the context of the algebraizable logics is proposed. We define and study the variety V₃, showing that it is definitionally equivalent to the equivalent quasivariety semantics for the “Three‐valued BCK‐logic”. As a consequence we find an axiomatic definition of the above system.     

Locally primitive Cayley graphs of finite simple groups

A graph Г is said to be G-locally primitive, where G is a subgroup of automorphisms of Г, if the stabiliser G_a of a vertex α acts primitively on the set Г( α ) of vertices of Г adjacent to α. For a finite non-abelian simple group L and a Cayley subset S of L, suppose that L ⊴ G ⩽ Aut( L), and the Cayley graph Г = Cay ( L, S) is G-locally primitive. In this paper we prove that L is a simple group of Lie type, and either the valency of Г is an add prine divisor of |Out(L)|, orL =PΩ ₈ ⁺ (q) and Г has valency 4. In either cases, it is proved that the full automorphism group of Г is also almost simple with the same socle L.     

Stability of a combined finite element ‐ finite volume discretization of convection‐diffusion equations

We consider a time‐dependent and a stationary convection‐diffusion equation. These equations are approximated by a combined finite element – finite volume method: the diffusion term is discretized by Crouzeix‐Raviart piecewise linear finite elements on a triangular grid, and the convection term by upwind barycentric finite volumes. In the nonstationary case, we use an implicit Euler approach for time discretization. This scheme is shown to be L²‐stable uniformly with respect to the diffusion coefficient. In addition, it turns out that stability is unconditional in the time‐dependent case. These results hold if the underlying grid satisfies a condition that is fulfilled, for example, by some structured meshes. © 2012 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 28: 402–424, 2012     

Radical of filters in BL‐algebras

In this paper, the notion of the radical of a filter in BL‐algebras is defined and several characterizations of the radical of a filter are given. Also we prove that A/F is an MV‐algebra if and only if D_s(A) ? F. After that we define the notion of semi maximal filter in BL‐algebras and we state and prove some theorems which determine the relationship between this notion and the other types of filters of a BL‐algebra. Moreover, we prove that A/F is a semi simple BL‐algebra if and only if F is a semi maximal filter of A. © 2011 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim     

Mesh‐centered finite differences from unconventional mixed‐hybrid nodal finite elements

It is shown how mesh‐centered finite differences can be obtained from unconventional mixed‐hybrid nodal finite elements. The classical Raviart‐Thomas schemes of index k (RTk) are based on interpolation parameters that are cell and/or edge moments. For the unconventional form (URTk), they become point values at Gaussian points. In particular, the scheme URT1 is fully described. © 2006 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2006     

Crossed product of C*‐algebras by hypergroups

The crossed product of ‐algebras by groups, groupoids and semigroups are well studied. In this paper we introduce and study the crossed product of ‐algebras by (locally compact) hypergroups. We calculate the crossed products by finite hypergroups of orders 2 and 3.     

Fraenkel‐Carnap properties

In the 1920's Fraenkel and Carnap raised the question of whether or not every finitely axiomatizable semantically complete theory formulated in the theory of types is categorical. Partial answers to this and a related question are presented for theories formulated in second‐order logic. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

A space‐time mixed‐hybrid finite element method for the damped wave equation

A space‐time finite element method is introduced to solve the linear damped wave equation. The scheme is constructed in the framework of the mixed‐hybrid finite element methods, and where an original conforming approximation of H(div;Ω) is used, the latter permits us to obtain an upwind scheme in time. We establish the link between the nonstandard finite difference scheme recently introduced by Mickens and Jordan and the scheme proposed. In this regard, two approaches are considered and in particular we employ a formulation allowing the solution to be marched in time, i.e., one only needs to consider one time increment at a time. Numerical results are presented and compared with the analytical solution illustrating good performance of the present method. © 2007 Wiley Periodicals, Inc. Numer Methods Partial Differential Eq 2008     

A non‐standard finite difference scheme for an advection‐diffusion‐reaction equation

In this note, a non‐standard finite difference (NSFD) scheme is proposed for an advection‐diffusion‐reaction equation with nonlinear reaction term. We first study the diffusion‐free case of this equation, that is, an advection‐reaction equation. Two exact finite difference schemes are constructed for the advection‐reaction equation by the method of characteristics. As these exact schemes are complicated and are not convenient to use, an NSFD scheme is derived from the exact scheme. Then, the NSFD scheme for the advection‐reaction equation is combined with a finite difference space‐approximation of the diffusion term to provide a NSFD scheme for the advection‐diffusion‐reaction equation. This new scheme could preserve the fixed points, the positivity, and the boundedness of the solution of the original equation. Numerical experiments verify the validity of our analytical results. Copyright © 2014 JohnWiley & Sons, Ltd.     

Characterization of set‐valued conditional expectation

For an essentially bounded closed‐convex‐nonempty set‐valued random variable, it is shown that the conditional expectation is characterized by its integrals over the sets of the associated σ ‐field. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)