Results 231 to 240 of about 716,706 (268)

Perfect MV-algebras and their Logic

Applied Categorical Structures, 2007
An algebra \((A, \oplus, \neg, 0)\) of type (2,1,0) is called MV-algebra if \((A,\oplus, 0)\) is a commutative monoid, \(x\oplus 1=1\), \(\neg \neg x=x\) and \(\neg (\neg x \oplus y)\oplus y=\neg (\neg y \oplus x)\oplus x\) for every \(x,y\in A\) (where \(\neg 0=1\)). For \(x\in A\), the least integer \(n\) for which \(nx=1\) is called the order of \(x\
DI NOLA, Antonio, BELLUCE P, GERLA B.
openaire   +3 more sources

Logic and algebraic computation

ACM SIGSAM Bulletin, 1984
Logic and algebra definitely derive from a common tradition of human thought which may be traced back deeply into the history of mathematics and philosophy. Leibniz and Boole are outstanding representatives in this tradition, that is in the more recent part of it.
openaire   +1 more source

The algebra of logic

1914
Originally published in French in 1901 and translated into English by Lydia Gillingham Robinson in 1914, Louis Couturat's The Algebra of Logic is a systematic treatise investigating the fundamental relationship between logic and mathematics, powerfully arguing for the importance of mathematical logic as a necessary preliminary to logical mathematics ...
openaire   +1 more source

Equations in the algebra of logic

Proceedings 32nd IEEE International Symposium on Multiple- Valued Logic, 2003
We survey the basic results in the theory of Boolean equations and the theory of equations in Post algebras. The two theories share four common features, which are analysed from the point of view of universal algebra; this yields further generalizations.
openaire   +1 more source

Algebras and Matrices for Annotated Logics

Studia Logica, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Renato A. Lewin, Irene F. Mikenberg, María G. Schwarze   +2 more
openaire   +2 more sources

Rough Algebras and Fuzzy Logic Algebras

Fourth International Conference on Fuzzy Systems and Knowledge Discovery (FSKD 2007), 2007
Rough Nelson algebras (rough sets systems) and UL* - algebras arose in two rather different fields: rough sets and fuzzy sets. In present paper, a pair of implication operator (rarrL, rarrG) is introduced using the method by G. Cattaneo and D. Ciucci, and the relationship between rough Nelson algebras (rough sets systems) and UL* - algebras is ...
openaire   +2 more sources

A Survey of Abstract Algebraic Logic

Studia Logica, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Josep Maria Font, Ramon Jansana, Don Pigozzi   +2 more
openaire   +2 more sources

Fork Algebras in Algebra, Logic and Computer Science

Fundamenta Informaticae, 1997
Since the main themes at the Helena Rasiowa memorial were algebra, logic and computer science, we will present a survey of results on fork algebras from these points of view. In this paper we study fork algebras from the points of view of their algebraic and logical properties and applications. These results will prove to be essential, in a future work,
Marcelo F. Frias, Gabriel Baum, Armando Martin Haeberer   +2 more
openaire   +2 more sources

On Neat Reducts of Algebras of Logic

Studia Logica, 2001
Let \(K\) stand for any of the following classes of algebras: substitution algebras in the sense of C. Pinter, cylindric algebras, quasipolyadic algebras, quasipolyadic equality algebras, and let \(K'\) stand for either the class of polyadic or polyadic equality algebras.
Tarek Sayed Ahmed, István Németi
openaire   +3 more sources

RELEVANCE LOGICS AND RELATION ALGEBRAS

The Review of Symbolic Logic, 2009
Relevance logicsare known to be sound and complete for relational semantics with a ternary accessibility relation. This paper investigates the problem of adequacy with respect to special kinds ofdynamic semantics(i.e., proper relation algebras and relevant families of relations). We prove severalsoundnessresults here.
Katalin Bimbó, J. Michael Dunn, Roger D. Maddux   +2 more
openaire   +2 more sources