An Investigation of the Laws of Thought on Which are Founded the Mathematical Theories of Logic and Probabilities by George Boole, published in 1854, is the second of Boole's two monographs on algebraic logic. Boole was a professor of mathematics at what was then Queen's College, Cork, now University College Cork, in Ireland.
The historian of logic John Corcoran wrote an accessible introduction to Laws of Thought [1] and a point by point comparison of Prior Analytics and Laws of Thought. [2] According to Corcoran, Boole fully accepted and endorsed Aristotle's logic. Boole's goals were “to go under, over, and beyond” Aristotle's logic by:
More specifically, Boole agreed with what Aristotle said; Boole's ‘disagreements’, if they might be called that, concern what Aristotle did not say. First, in the realm of foundations, Boole reduced the four propositional forms of Aristotle's logic to formulas in the form of equations—by itself a revolutionary idea. Second, in the realm of logic's problems, Boole's addition of equation solving to logic—another revolutionary idea—involved Boole's doctrine that Aristotle's rules of inference (the “perfect syllogisms”) must be supplemented by rules for equation solving. Third, in the realm of applications, Boole's system could handle multi-term propositions and arguments whereas Aristotle could handle only two-termed subject-predicate propositions and arguments. For example, Aristotle's system could not deduce “No quadrangle that is a square is a rectangle that is a rhombus” from “No square that is a quadrangle is a rhombus that is a rectangle” or from “No rhombus that is a rectangle is a square that is a quadrangle”.
Boole's work founded the discipline of algebraic logic. It is often, but mistakenly, credited as being the source of what we know today as Boolean algebra. In fact, however, Boole's algebra differs from modern Boolean algebra: in Boole's algebra A+B cannot be interpreted by set union, due to the permissibility of uninterpretable terms in Boole's calculus. Therefore, algebras on Boole's account cannot be interpreted by sets under the operations of union, intersection and complement, as is the case with modern Boolean algebra. The task of developing the modern account of Boolean algebra fell to Boole's successors in the tradition of algebraic logic (Jevons 1869, Peirce 1880, Jevons 1890, Schröder 1890, Huntington 1904).
In Boole's account of his algebra, terms are reasoned about equationally, without a systematic interpretation being assigned to them. In places, Boole talks of terms being interpreted by sets, but he also recognises terms that cannot always be so interpreted, such as the term 2AB, which arises in equational manipulations. Such terms he classes uninterpretable terms; although elsewhere he has some instances of such terms being interpreted by integers.
The coherences of the whole enterprise is justified by Boole in what Stanley Burris has later called the "rule of 0s and 1s", which justifies the claim that uninterpretable terms cannot be the ultimate result of equational manipulations from meaningful starting formulae (Burris 2000). Boole provided no proof of this rule, but the coherence of his system was proved by Theodore Hailperin, who provided an interpretation based on a fairly simple construction of rings from the integers to provide an interpretation of Boole's theory (Hailperin 1976).
In every discourse, whether of the mind conversing with its own thoughts, or of the individual in his intercourse with others, there is an assumed or expressed limit within which the subjects of its operation are confined. The most unfettered discourse is that in which the words we use are understood in the widest possible application, and for them the limits of discourse are co-extensive with those of the universe itself. But more usually we confine ourselves to a less spacious field. Sometimes, in discoursing of men we imply (without expressing the limitation) that it is of men only under certain circumstances and conditions that we speak, as of civilized men, or of men in the vigour of life, or of men under some other condition or relation. Now, whatever may be the extent of the field within which all the objects of our discourse are found, that field may properly be termed the universe of discourse. Furthermore, this universe of discourse is in the strictest sense the ultimate subject of the discourse.
In abstract algebra, a Boolean algebra or Boolean lattice is a complemented distributive lattice. This type of algebraic structure captures essential properties of both set operations and logic operations. A Boolean algebra can be seen as a generalization of a power set algebra or a field of sets, or its elements can be viewed as generalized truth values. It is also a special case of a De Morgan algebra and a Kleene algebra.
George Boole was a largely self-taught English mathematician, philosopher and logician, most of whose short career was spent as the first professor of mathematics at Queen's College, Cork in Ireland. He worked in the fields of differential equations and algebraic logic, and is best known as the author of The Laws of Thought (1854), which contains Boolean algebra. Boolean logic, essential to computer programming, is credited with helping to lay the foundations for the Information Age.
A syllogism is a kind of logical argument that applies deductive reasoning to arrive at a conclusion based on two propositions that are asserted or assumed to be true.
Classical logic or Frege–Russell logic is the intensively studied and most widely used class of deductive logic. Classical logic has had much influence on analytic philosophy.
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.
In the formal sciences, the domain of discourse, also called the universe of discourse, universal set, or simply universe, is the set of entities over which certain variables of interest in some formal treatment may range.
In logic and formal semantics, term logic, also known as traditional logic, syllogistic logic or Aristotelian logic, is a loose name for an approach to formal logic that began with Aristotle and was developed further in ancient history mostly by his followers, the Peripatetics. It was revived after the third century CE by Porphyry's Isagoge.
The Organon is the standard collection of Aristotle's six works on logical analysis and dialectic. The name Organon was given by Aristotle's followers, the Peripatetics, who maintained against the Stoics that Logic was "an instrument" of Philosophy.
The laws of thought are fundamental axiomatic rules upon which rational discourse itself is often considered to be based. The formulation and clarification of such rules have a long tradition in the history of philosophy and logic. Generally they are taken as laws that guide and underlie everyone's thinking, thoughts, expressions, discussions, etc. However, such classical ideas are often questioned or rejected in more recent developments, such as intuitionistic logic, dialetheism and fuzzy logic.
Boole's expansion theorem, often referred to as the Shannon expansion or decomposition, is the identity: , where is any Boolean function, is a variable, is the complement of , and and are with the argument set equal to and to respectively.
Platon Sergeevich Poretsky was a noted Russian Imperial astronomer, mathematician, and logician.
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.
Boolean algebra is a mathematically rich branch of abstract algebra. Stanford Encyclopaedia of Philosophy defines Boolean algebra as 'the algebra of two-valued logic with only sentential connectives, or equivalently of algebras of sets under union and complementation.' Just as group theory deals with groups, and linear algebra with vector spaces, Boolean algebras are models of the equational theory of the two values 0 and 1. Common to Boolean algebras, groups, and vector spaces is the notion of an algebraic structure, a set closed under some operations satisfying certain equations.
In mathematical logic, algebraic logic is the reasoning obtained by manipulating equations with free variables.
John Corcoran was an American logician, philosopher, mathematician, and historian of logic. He is best known for his philosophical work on concepts such as the nature of inference, relations between conditions, argument-deduction-proof distinctions, the relationship between logic and epistemology, and the place of proof theory and model theory in logic. Nine of Corcoran's papers have been translated into Spanish, Portuguese, Persian, and Arabic; his 1989 "signature" essay was translated into three languages. Fourteen of his papers have been reprinted; one was reprinted twice.
Wholistic reference is reference to the whole—with respect to the context. In its strongest, unqualified form, the principle of wholistic reference is the proposition that each and every proposition, regardless how limited the referents of its non-logical or content terms, refers to the whole of its universe of discourse. According to this principle every proposition of number theory, even an equational proposition such as 5 + 7 = 12, refers not only to the individual numbers that it happens to mention but to the whole universe of numbers. The relation verb ‘refers’ is being used in its broad sense and not as a synonym for ‘names’ in the sense of “is a name of”.
In mathematics and mathematical logic, Boolean algebra is a branch of algebra. It differs from elementary algebra in two ways. First, the values of the variables are the truth values true and false, usually denoted 1 and 0, whereas in elementary algebra the values of the variables are numbers. Second, Boolean algebra uses logical operators such as conjunction (and) denoted as ∧, disjunction (or) denoted as ∨, and negation (not) denoted as ¬. Elementary algebra, on the other hand, uses arithmetic operators such as addition, multiplication, subtraction, and division. Boolean algebra is therefore a formal way of describing logical operations in the same way that elementary algebra describes numerical operations.
In logic, a finite-valued logic is a propositional calculus in which truth values are discrete. Traditionally, in Aristotle's logic, the bivalent logic, also known as binary logic was the norm, as the law of the excluded middle precluded more than two possible values for any proposition. Modern three-valued logic allows for an additional possible truth value.