Universal Algebra for Logics

نویسنده

  • Joanna GRYGIEL
چکیده

These notes form Lecture Notes of a short course which I will give at 1st School on Universal Logic in Montreux. They cannot be recommended for self studies because, although all definitions and main ideas are included, there are no proofs and examples. I’m going to provide some of them during my lectures, leaving easy ones as exercises. In the first part we discuss some of the most important notions of universal algebra. Then we concentrate on free algebras and varieties. Our main goal is to prove Birkhoff’s Theorem, which says that a class of similar algebras is a variety iff it is definable by a set of equations. In the last part we say more about lattices and boolean algebras, as these algebraic structures which are especially important for logic. Universal algebra is sometimes seen as a special branch of model theory, in which we are dealing with structures having operations only. However, it is only one of aspects of universal algebra, which appears to be a powerful tool in many areas. Universal algebra borrows techniques and ideas from logic, lattice theory and category theory. The connections between lattice theory and the general theory of algebras are particularly strong. We assume that the reader has the basic knowledge of mathematics.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

EQ-logics with delta connective

In this paper we continue development of formal theory of a special class offuzzy logics, called EQ-logics. Unlike fuzzy logics being extensions of theMTL-logic in which the basic connective is implication, the basic connective inEQ-logics is equivalence. Therefore, a new algebra of truth values calledEQ-algebra was developed. This is a lower semilattice with top element endowed with two binary...

متن کامل

From points to intervals

Representable relation algebras are characterised by a certain property of networks. Representations of relation algebras can be further classiied as homogeneous or universal. These properties are also characterised by properties of networks properties (amalgamation and joint embedding properties). For the homogeneous, universal case a method of constructing interval algebras from point algebra...

متن کامل

Universal Coalgebras and Their Logics

We survey coalgebras as models of state based systems together with their global and local logics. We convey some useful intuition regarding Set-functors which leads naturally to coalgebraic modal logic where modalities are validity patterns for the successor object of a state.

متن کامل

Fredkin Gates for Finite–valued Reversible and Conservative Logics

The basic principles and results of Conservative Logic introduced by Fredkin and Toffoli in [FT, 82] on the basis of a seminal paper of Landauer [La, 61] are extended to d–valued logics, with a special attention to three–valued logics. Different approaches to d–valued logics are examined in order to determine some possible universal sets of logic primitives. In particular, we consider the typic...

متن کامل

On Set-Driven Combination of Logics and Verifiers

We explore the problem of automated reasoning about the nondisjoint combination of logics that share set variables and operations. We prove a general combination theorem, and apply it to show the decidability for the quantifier-free combination of formulas in WS2S, two-varible logic with counting, and Boolean Algebra with Presburger Arithmetic. Furthermore, we present an over-approximating algo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005