On connections between information systems, rough sets and algebraic logic

Stephen Comer

The search session has expired. Please query the service again.

Displaying similar documents to “On connections between information systems, rough sets and algebraic logic”

Weak products of universal algebras

Ildikó Sain (1993)

Banach Center Publications

Similarity:

Weak direct products of arbitrary universal algebras are introduced. The usual notion for groups and rings is a special case. Some universal algebraic properties are proved and applications to cylindric and polyadic algebras are considered.

Finitary axiomatizations of the true relational equations

Roger Maddux (1993)

Banach Center Publications

Similarity:

Discriminator varieties of Boolean algebras with residuated operators

Peter Jipsen (1993)

Banach Center Publications

Similarity:

The theory of discriminator algebras and varieties has been investigated extensively, and provides us with a wealth of information and techniques applicable to specific examples of such algebras and varieties. Here we give several such examples for Boolean algebras with a residuated binary operator, abbreviated as r-algebras. More specifically, we show that all finite r-algebras, all integral r-algebras, all unital r-algebras with finitely many elements below the unit, and all commutative...

Lectures on cylindric set algebras

J. Monk (1993)

Banach Center Publications

Similarity:

Dual commutative hyper K-ideals of type 1 in hyper K-algebras of order 3.

L. Torkzadeh, M. M. Zahedi (2006)

Mathware and Soft Computing

Similarity:

In this note we classify the bounded hyper K-algebras of order 3, which have D = {1}, D = {1,2} and D = {0,1} as a dual commutative hyper K-ideal of type 1. In this regard we show that there are such non-isomorphic bounded hyper K-algebras.

Classification of 4-dimensional nilpotent complex Leibniz algebras.

Sergio Albeverio, Bakhrom A. Omirov, Isamiddin S. Rakhimov (2006)

Extracta Mathematicae

Similarity:

Two-dimensional real division algebras revisited.

Hübner, Marion, Petersson, Holger P. (2004)

Beiträge zur Algebra und Geometrie

Similarity:

Subdirect decompositions of algebras from 2-clone extensions of varieties

J. Płonka (1998)

Colloquium Mathematicae

Similarity:

Let τ:F → ℕ be a type of algebras, where F is a set of fundamental operation symbols and ℕ is the set of nonnegative integers. We assume that |F|≥2 and 0 ∉ (F). For a term φ of type τ we denote by F(φ) the set of fundamental operation symbols from F occurring in φ. An identity φ ≉ ψ of type τ is called clone compatible if φ and ψ are the same variable or F(φ)=F(ψ)≠ $\emptyset$ . For a variety V of type τ we denote by $V^{c, 2}$ the variety of type τ defined by all identities φ ≉ ψ from Id(V) which are either...

Tail and free poset algebras.

Mohamed Bekkali, Driss Zhani (2004)

Revista Matemática Complutense

Similarity:

We characterize free poset algebras F(P) over partially ordered sets and show that they can be represented by upper semi-lattice algebras. Hence, the uniqueness, in decomposition into normal form, using symmetric difference, of non-zero elements of F(P) is established. Moreover, a characterization of upper semi-lattice algebras that are isomorphic to free poset algebras is given in terms of a selected set of generators of B(T).

Completeness criteria and invariants for operation and transformation algebras.

Jakubíková-Studenovská, Danica, Mašulović, Dragan, Pöschel, Reinhard (2004)

Beiträge zur Algebra und Geometrie

Similarity:

Some properties of octonion and quaternion algebras.

Flaut, Cristina (2006)

Acta Mathematica Academiae Paedagogicae Nyí regyháziensis. New Series [electronic only]

Similarity:

Analysis of Algorithms: An Example of a Sort Algorithm

Grzegorz Bancerek (2013)

Formalized Mathematics

Similarity:

We analyse three algorithms: exponentiation by squaring, calculation of maximum, and sorting by exchanging in terms of program algebra over an algebra.