Sound and complete semantics for classical propositional logic can be obtained by interpreting sentences as sets. Replacing sets with commuting dense binary relations produces an interpretation that turns out to be sound but not complete for R. Adding transitivity yields sound and complete semantics for RM, because all normal Sugihara matrices are representable as algebras of binary relations.

We study algebras whose elements are relations, and the operations are natural “manipulations” of relations. This area goes back to 140 years ago to works of De Morgan, Peirce, Schröder . Well known examples of algebras of relations are the varieties RCAn of cylindric algebras of n-ary relations, RPEAn of polyadic equality algebras of n-ary relations, and RRA of binary relations with composition. We prove that any axiomatization, say E, of RCAn has to be very complex in the following sense: (...) for every natural number k there is an equation in E containing more than k distinct variables and all the operation symbols, if 2 < n < ω. Completely analogous statement holds for the case n ω. This improves Monk's famous non-finitizability theorem for which we give here a simple proof. We prove analogous nonfinitizability properties of the larger varieties SNrnCAn + k. We prove that the complementation-free subreducts of RCAn do not form a variety. We also investigate the reason for the above “non-finite axiomatizability” behaviour of RCAn. We look at all the possible reducts of RCAn and investigate which are finitely axiomatizable. We obtain several positive results in this direction. Finally, we summarize the results and remaining questions in a figure. We carry through the same programme for RPEAn and for RRA. By looking into the reducts we also investigate what other kinds of natural algebras of relations are possible with more positive behaviour than that of the well known ones. Our investigations have direct consequences for the logical properties of the n-variable fragment Ln of first order logic. The reason for this is that RCAn and RPEAn are the natural algebraic counterparts of Ln while the varieties SNrnCAn + k are in connection with the proof theory of Ln. This paper appears in two parts. The first part contains the non-finite axiomatizability results. The present second part contains finite axiomatizations of some fragments together with a figure summarizing the finite and non-finite axiomatizability results in this area and the problems left open. (shrink)

Contact relations have been studied in the context of qualitative geometry and physics since the early 1920s, and have recently received attention in qualitative spatial reasoning. In this paper, we present a sound and complete proof system in the style of Rasiowa and Sikorski (1963) for relation algebras generated by a contact relation.

Resumen En esta contribución ofrecemos una interpretación del pons asinorum que se basa en una lógica de términos contemporánea. Esto nos permite revitalizar la idea del pons asinorum para generar el -políticamente correcto- pons scholasticorum, una versión terminística del pons asinorum que conecta la inventio medii con el dictum de omni et nullo.In this contribution we offer an interpretation of the pons asinorum by using a contemporary term logic. This interpretation allows us to revitalize the concept of the pons asinorum (...) in order to produce the -politically correct- pons scholasticorum, a terministic version of the pons asinorum that relates the inventio medii with the dictum de omni et nullo. (shrink)

Nathan Houser, Don D. Roberts and James Van Evra (eds), Studies in the Logic of Charles Sanders Peirce, In:Bloomington and Indianapolis, Indiana University Press, 1997, xiii + 653 pp. £41.95. ISBN 0-253-33020-3.

The process of ‘logical differentiation’ was introduced by Peirce in 1870. Directly analogous to mathematical differentiation, it uses logical terms instead of mathematical variables. Here, this mysterious process receives new interpretations which serve to clarify Peirce’s use of logical terms. I introduce the logical terms, the operation of multiplication, the logical analogy to the binomial theorem, infinitesimal relatives, the concepts of numerical coefficients and the number associated with each term. I also analyse the algebraic development of ‘logical differentiation’ and consider (...) in depth one application of the process. (shrink)

For Ivor Grattan-Guinness on the occasion of his retirement. The work of Augustus De Morgan on symbolic logic in the mid-nineteenth century is familiar to historians of logic and mathematics alike. What is less well known is his work on probability and, more specifically, the use of probabilistic ideas and methods in his logic. The majority of De Morgan's work on probability was undertaken around 1837???1838, with his earliest publications on logic appearing from 1839, a period which culminated with the (...) publication of his Formal Logic in 1847. This article examines the overlap between his work on probability theory and logic during the earliest period of his interest in both. (shrink)