Algebraic logic

Last updated

In mathematical logic, algebraic logic is the reasoning obtained by manipulating equations with free variables.

Contents

What is now usually called classical algebraic logic focuses on the identification and algebraic description of models appropriate for the study of various logics (in the form of classes of algebras that constitute the algebraic semantics for these deductive systems) and connected problems like representation and duality. Well known results like the representation theorem for Boolean algebras and Stone duality fall under the umbrella of classical algebraic logic ( Czelakowski 2003 ).

Works in the more recent abstract algebraic logic (AAL) focus on the process of algebraization itself, like classifying various forms of algebraizability using the Leibniz operator ( Czelakowski 2003 ).

Calculus of relations

A homogeneous binary relation is found in the power set of X × X for some set X, while a heterogeneous relation is found in the power set of X × Y, where XY. Whether a given relation holds for two individuals is one bit of information, so relations are studied with Boolean arithmetic. Elements of the power set are partially ordered by inclusion, and lattice of these sets becomes an algebra through relative multiplication or composition of relations.

"The basic operations are set-theoretic union, intersection and complementation, the relative multiplication, and conversion." [1]

The conversion refers to the converse relation that always exists, contrary to function theory. A given relation may be represented by a logical matrix; then the converse relation is represented by the transpose matrix. A relation obtained as the composition of two others is then represented by the logical matrix obtained by matrix multiplication using Boolean arithmetic.

Example

An example of calculus of relations arises in erotetics, the theory of questions. In the universe of utterances there are statements S and questions Q. There are two relations π and α from Q to S: qαa holds when a is a direct answer to question q. The other relation, qπp holds when p is a presupposition of question q. The converse relation πT runs from S to Q so that the composition πTα is a homogeneous relation on S. [2] The art of putting the right question to elicit a sufficient answer is recognized in Socratic method dialogue.

Functions

The description of the key binary relation properties has been formulated with the calculus of relations. The univalence property of functions describes a relation R that satisfies the formula where I is the identity relation on the range of R. The injective property corresponds to univalence of , or the formula where this time I is the identity on the domain of R.

But a univalent relation is only a partial function, while a univalent total relation is a function. The formula for totality is Charles Loewner and Gunther Schmidt use the term mapping for a total, univalent relation. [3] [4]

The facility of complementary relations inspired Augustus De Morgan and Ernst Schröder to introduce equivalences using for the complement of relation R. These equivalences provide alternative formulas for univalent relations (), and total relations (). Therefore, mappings satisfy the formula Schmidt uses this principle as "slipping below negation from the left". [5] For a mapping f, 

Abstraction

The relation algebra structure, based in set theory, was transcended by Tarski with axioms describing it. Then he asked if every algebra satisfying the axioms could be represented by a set relation. The negative answer [6] opened the frontier of abstract algebraic logic. [7] [8] [9]

Algebras as models of logics

Algebraic logic treats algebraic structures, often bounded lattices, as models (interpretations) of certain logics, making logic a branch of order theory.

In algebraic logic:

In the table below, the left column contains one or more logical or mathematical systems, and the algebraic structure which are its models are shown on the right in the same row. Some of these structures are either Boolean algebras or proper extensions thereof. Modal and other nonclassical logics are typically modeled by what are called "Boolean algebras with operators."

Algebraic formalisms going beyond first-order logic in at least some respects include:

Logical system Lindenbaum–Tarski algebra
Classical sentential logic Boolean algebra
Intuitionistic propositional logic Heyting algebra
Łukasiewicz logic MV-algebra
Modal logic K Modal algebra
Lewis's S4 Interior algebra
Lewis's S5, monadic predicate logic Monadic Boolean algebra
First-order logic Complete Boolean algebra, polyadic algebra, predicate functor logic
First-order logic with equality Cylindric algebra
Set theory Combinatory logic, relation algebra

History

Algebraic logic is, perhaps, the oldest approach to formal logic, arguably beginning with a number of memoranda Leibniz wrote in the 1680s, some of which were published in the 19th century and translated into English by Clarence Lewis in 1918. [10] :291–305 But nearly all of Leibniz's known work on algebraic logic was published only in 1903 after Louis Couturat discovered it in Leibniz's Nachlass. Parkinson (1966) and Loemker (1969) translated selections from Couturat's volume into English.

Modern mathematical logic began in 1847, with two pamphlets whose respective authors were George Boole [11] and Augustus De Morgan. [12] In 1870 Charles Sanders Peirce published the first of several works on the logic of relatives. Alexander Macfarlane published his Principles of the Algebra of Logic [13] in 1879, and in 1883, Christine Ladd, a student of Peirce at Johns Hopkins University, published "On the Algebra of Logic". [14] Logic turned more algebraic when binary relations were combined with composition of relations. For sets A and B, a relation over A and B is represented as a member of the power set of A×B with properties described by Boolean algebra. The "calculus of relations" [9] is arguably the culmination of Leibniz's approach to logic. At the Hochschule Karlsruhe the calculus of relations was described by Ernst Schröder. [15] In particular he formulated Schröder rules, though De Morgan had anticipated them with his Theorem K.

In 1903 Bertrand Russell developed the calculus of relations and logicism as his version of pure mathematics based on the operations of the calculus as primitive notions. [16] The "Boole–Schröder algebra of logic" was developed at University of California, Berkeley in a textbook by Clarence Lewis in 1918. [10] He treated the logic of relations as derived from the propositional functions of two or more variables.

Hugh MacColl, Gottlob Frege, Giuseppe Peano, and A. N. Whitehead all shared Leibniz's dream of combining symbolic logic, mathematics, and philosophy.

Some writings by Leopold Löwenheim and Thoralf Skolem on algebraic logic appeared after the 1910–13 publication of Principia Mathematica , and Tarski revived interest in relations with his 1941 essay "On the Calculus of Relations". [9]

According to Helena Rasiowa, "The years 1920-40 saw, in particular in the Polish school of logic, researches on non-classical propositional calculi conducted by what is termed the logical matrix method. Since logical matrices are certain abstract algebras, this led to the use of an algebraic method in logic." [17]

Brady (2000) discusses the rich historical connections between algebraic logic and model theory. The founders of model theory, Ernst Schröder and Leopold Loewenheim, were logicians in the algebraic tradition. Alfred Tarski, the founder of set theoretic model theory as a major branch of contemporary mathematical logic, also:

In the practice of the calculus of relations, Jacques Riguet used the algebraic logic to advance useful concepts: he extended the concept of an equivalence relation (on a set) to the heterogeneous case with the notion of a difunctional relation. Riguet also extended ordering to the heterogeneous context by his note that a staircase logical matrix has a complement that is also a staircase, and that the theorem of N. M. Ferrers follows from interpretation of the transpose of a staircase. Riguet generated rectangular relations by taking the outer product of logical vectors; these contribute to the non-enlargeable rectangles of formal concept analysis.

Leibniz had no influence on the rise of algebraic logic because his logical writings were little studied before the Parkinson and Loemker translations. Our present understanding of Leibniz as a logician stems mainly from the work of Wolfgang Lenzen, summarized in Lenzen (2004). To see how present-day work in logic and metaphysics can draw inspiration from, and shed light on, Leibniz's thought, see Zalta (2000).

See also

Related Research Articles

In mathematics, a binary relation associates elements of one set, called the domain, with elements of another set, called the codomain. A binary relation over sets X and Y is a set of ordered pairs (x, y) consisting of elements x from X and y from Y. It is a generalization of the more widely understood idea of a unary function. It encodes the common concept of relation: an element x is related to an element y, if and only if the pair (x, y) belongs to the set of ordered pairs that defines the binary relation. A binary relation is the most studied special case n = 2 of an n-ary relation over sets X1, ..., Xn, which is a subset of the Cartesian product

Propositional calculus is a branch of logic. It is also called propositional logic, statement logic, sentential calculus, sentential logic, or sometimes zeroth-order logic. It deals with propositions and relations between propositions, including the construction of arguments based on them. Compound propositions are formed by connecting propositions by logical connectives. Propositions that contain no logical connectives are called atomic propositions.

In mathematics, a finitary relation over a sequence of sets X1, ..., Xn is a subset of the Cartesian product X1 × ... × Xn; that is, it is a set of n-tuples (x1, ..., xn), each being a sequence of elements xi in the corresponding Xi. Typically, the relation describes a possible connection between the elements of an n-tuple. For example, the relation "x is divisible by y and z" consists of the set of 3-tuples such that when substituted to x, y and z, respectively, make the sentence true.

In mathematical logic, model theory is the study of the relationship between formal theories, and their models. The aspects investigated include the number and size of models of a theory, the relationship of different models to each other, and their interaction with the formal language itself. In particular, model theorists also investigate the sets that can be defined in a model of a theory, and the relationship of such definable sets to each other. As a separate discipline, model theory goes back to Alfred Tarski, who first used the term "Theory of Models" in publication in 1954. Since the 1970s, the subject has been shaped decisively by Saharon Shelah's stability theory.

The history of logic deals with the study of the development of the science of valid inference (logic). Formal logics developed in ancient times in India, China, and Greece. Greek methods, particularly Aristotelian logic as found in the Organon, found wide application and acceptance in Western science and mathematics for millennia. The Stoics, especially Chrysippus, began the development of predicate logic.

Laws of Form is a book by G. Spencer-Brown, published in 1969, that straddles the boundary between mathematics and philosophy. LoF describes three distinct logical systems:

In mathematical logic, a superintuitionistic logic is a propositional logic extending intuitionistic logic. Classical logic is the strongest consistent superintuitionistic logic; thus, consistent superintuitionistic logics are called intermediate logics.

In mathematical logic, the Lindenbaum–Tarski algebra of a logical theory T consists of the equivalence classes of sentences of the theory. That is, two sentences are equivalent if the theory T proves that each implies the other. The Lindenbaum–Tarski algebra is thus the quotient algebra obtained by factoring the algebra of formulas by this congruence relation.

The Latin term characteristica universalis, commonly interpreted as universal characteristic, or universal character in English, is a universal and formal language imagined by Gottfried Leibniz able to express mathematical, scientific, and metaphysical concepts. Leibniz thus hoped to create a language usable within the framework of a universal logical calculation or calculus ratiocinator.

In mathematics, the converse of a binary relation is the relation that occurs when the order of the elements is switched in the relation. For example, the converse of the relation 'child of' is the relation 'parent of'. In formal terms, if and are sets and is a relation from to then is the relation defined so that if and only if In set-builder notation,

A logical matrix, binary matrix, relation matrix, Boolean matrix, or (0, 1)-matrix is a matrix with entries from the Boolean domain B = {0, 1}. Such a matrix can be used to represent a binary relation between a pair of finite sets. It is an important tool in combinatorial mathematics and theoretical computer science.

In mathematics and abstract algebra, a relation algebra is a residuated Boolean algebra expanded with an involution called converse, a unary operation. The motivating example of a relation algebra is the algebra 2X 2 of all binary relations on a set X, that is, subsets of the cartesian square X2, with RS interpreted as the usual composition of binary relations R and S, and with the converse of R as the converse relation.

In mathematical logic, abstract algebraic logic is the study of the algebraization of deductive systems arising as an abstraction of the well-known Lindenbaum–Tarski algebra, and how the resulting algebras are related to logical systems.

In abstract algebraic logic, a branch of mathematical logic, the Leibniz operator is a tool used to classify deductive systems, which have a precise technical definition and capture a large number of logics. The Leibniz operator was introduced by Wim Blok and Don Pigozzi, two of the founders of the field, as a means to abstract the well-known Lindenbaum–Tarski process, that leads to the association of Boolean algebras to classical propositional calculus, and make it applicable to as wide a variety of sentential logics as possible. It is an operator that assigns to a given theory of a given sentential logic, perceived as a term algebra with a consequence operation on its universe, the largest congruence on the algebra that is compatible with the theory.

Logic is the formal science of using reason and is considered a branch of both philosophy and mathematics and to a lesser extent computer science. Logic investigates and classifies the structure of statements and arguments, both through the study of formal systems of inference and the study of arguments in natural language. The scope of logic can therefore be very large, ranging from core topics such as the study of fallacies and paradoxes, to specialized analyses of reasoning such as probability, correct reasoning, and arguments involving causality. One of the aims of logic is to identify the correct and incorrect inferences. Logicians study the criteria for the evaluation of arguments.

In the mathematics of binary relations, the composition of relations is the forming of a new binary relation R; S from two given binary relations R and S. In the calculus of relations, the composition of relations is called relative multiplication, and its result is called a relative product. Function composition is the special case of composition of relations where all relations involved are functions.

Logical consequence is a fundamental concept in logic which describes the relationship between statements that hold true when one statement logically follows from one or more statements. A valid logical argument is one in which the conclusion is entailed by the premises, because the conclusion is the consequence of the premises. The philosophical analysis of logical consequence involves the questions: In what sense does a conclusion follow from its premises? and What does it mean for a conclusion to be a consequence of premises? All of philosophical logic is meant to provide accounts of the nature of logical consequence and the nature of logical truth.

In logic, a quantifier is an operator that specifies how many individuals in the domain of discourse satisfy an open formula. For instance, the universal quantifier in the first order formula expresses that everything in the domain satisfies the property denoted by . On the other hand, the existential quantifier in the formula expresses that there exists something in the domain which satisfies that property. A formula where a quantifier takes widest scope is called a quantified formula. A quantified formula must contain a bound variable and a subformula specifying a property of the referent of that variable.

Jacques Riguet was a French mathematician known for his contributions to algebraic logic and category theory. According to Gunther Schmidt and Thomas Ströhlein, "Alfred Tarski and Jacques Riguet founded the modern calculus of relations".

References

  1. Bjarni Jónsson (1984). "Maximal Algebras of Binary Relations". In Kenneth I. Appel; John G. Ratcliffe; Paul E. Schupp (eds.). Contributions to Group Theory. Contemporary Mathematics. Vol. 33. Providence/RI: American Mathematical Society. pp. 299–307. ISBN   978-0-8218-5035-0.
  2. Eugene Freeman (1934) The Categories of Charles Peirce, page 10, Open Court Publishing Company, quote: By retaining the realistic presuppositions of the plain man concerning the genuineness of external reality, Peirce is able to reinforce the precarious defenses of a conventionalistic theory of nature with the powerful armament of common-sense realism.
  3. G. Schmidt & T. Ströhlein (1993) Relations and Graphs Discrete Mathematics for Computer Scientists, page 54, EATCS Monographs on Theoretical Computer Science, Springer Verlag, ISBN   3-540-56254-0
  4. G. Schmidt (2011) Relational Mathematics, Encyclopedia of Mathematics and its Applications, vol. 132, pages 49 and 57, Cambridge University Press ISBN   978-0-521-76268-7
  5. G. Schmidt & M. Winter(2018) Relational Topology, page 8, Lecture Notes in Mathematics vol. 2208, Springer Verlag, ISBN   978-3-319-74451-3
  6. Roger C. Lyndon (May 1950). "The representation of Relational Algebras". Annals of Mathematics . 51 (3): 707–729. doi:10.2307/1969375. JSTOR   1969375. MR   0037278.
  7. Vaughn Pratt The Origins of the Calculus of Relations, from Stanford University
  8. Roger Maddux (1991) "The Origin of Relation Algebras in the Development and Axiomatization of the Calculus of Relations", Studia Logica 50: 421-55
  9. 1 2 3 4 Alfred Tarski (1941), "On the Calculus of Relations", Journal of Symbolic Logic 6: 73–89 doi : 10.2307/2268577
  10. 1 2 Clarence Lewis (1918) A Survey of Symbolic Logic, University of California Press, second edition 1932, Dover edition 1960
  11. George Boole, The Mathematical Analysis of Logic, Being an Essay towards a Calculus of Deductive Reasoning (London, England: Macmillan, Barclay, & Macmillan, 1847).
  12. Augustus De Morgan (1847), Formal Logic , London: Taylor & Walton, link from Hathi Trust
  13. Alexander Macfarlane (1879), Principles of the Algebra of Logic , via Internet Archive
  14. Christine Ladd (1883), On the Algebra of Logic via Google Books
  15. Ernst Schröder, (1895), Algebra der Logik (Exakte Logik) Dritter Band, Algebra und Logik der Relative , Leibzig: B. G. Teubner via Internet Archive
  16. B. Russell (1903) The Principles of Mathematics
  17. Helena Rasiowa (1974), "Post Algebras as Semantic Foundations of m-valued Logics", pages 92–142 in Studies in Algebraic Logic, edited by Aubert Daigneault, Mathematical Association of America ISBN   0-88385-109-1

Sources

Further reading

Historical perspective