Aristotle's syllogistic and modern logic

2005 ◽  
Vol 48 (3-4) ◽  
pp. 155-166
Author(s):  
Danica Andjelkovic

Different understandings of Aristotle's syllogistic as a logical theory are reviewed. Leibniz offered a mathematical interpretation of syllogistic. Boole expressed all syllogistic relations by means of algebraic formulas. Lukasiewicz built a system of syllogistic as a logical theory separate and different from the predicate calculus Comparing syllogistic with other formal systems, its definitional equivalence with Boolean algebra is proven. Many systems of syllogistic are built, and their differences are due to recognizing the bearer of existential sense of categorical propositions. It is shown that these systems can be embedded in the predicate calculus, which means that syllogistic is not a separate and different theory from the predicate calculus.

Author(s):  
Jaakko Hintikka ◽  
Gabriel Sandu

The quantifiers ‘some’ and ‘every’ were the object of the very first logical theory, Aristotelian syllogistic. An example of a syllogism is ‘Every Spartan is Greek, every Greek is European, therefore every Spartan is European’. In such inferences, no quantifier is governed by another one. Contrast this with ‘Everybody loves somebody’. Modern logic is often taken to have begun when Frege systematized for the first time the logic of quantifiers, including such dependent ones. In general, much of what has passed as logic over the centuries is in effect the study of quantifiers. This is especially clear with the area of logic variously known as quantification theory, lower predicate calculus or elementary logic. Some philosophers have even sought to limit the scope of logic to such a study of quantifiers. Yet the nature of quantifiers is a delicate matter which is captured incompletely by the logic initiated by Frege and Russell.


1959 ◽  
Vol 24 (3) ◽  
pp. 236-238
Author(s):  
William Craig

Author(s):  
Timothy Smiley

The predicate calculus is the dominant system of modern logic, having displaced the traditional Aristotelian syllogistic logic that had been the previous paradigm. Like Aristotle’s, it is a logic of quantifiers – words like ‘every’, ‘some’ and ‘no’ that are used to express that a predicate applies universally or with some other distinctive kind of generality, for example ‘everyone is mortal’, ‘someone is mortal’, ‘no one is mortal’. The weakness of syllogistic logic was its inability to represent the structure of complex predicates. Thus it could not cope with argument patterns like ‘everything Fs and Gs, so everything Fs’. Nor could it cope with relations, because a logic of relations must be able to analyse cases where a quantifier is applied to a predicate that already contains one, as in ‘someone loves everyone’. Remedying the weakness required two major innovations. One was a logic of connectives – words like ‘and’, ‘or’ and ‘if’ that form complex sentences out of simpler ones. It is often studied as a distinct system: the propositional calculus. A proposition here is a true-or-false sentence and the guiding principle of propositional calculus is truth-functionality, meaning that the truth-value (truth or falsity) of a compound proposition is uniquely determined by the truth-values of its components. Its principal connectives are negation, conjunction, disjunction and a ‘material’ (that is, truth-functional) conditional. Truth-functionality makes it possible to compute the truth-values of propositions of arbitrary complexity in terms of their basic propositional constituents, and so develop the logic of tautology and tautological consequence (logical truth and consequence in virtue of the connectives). The other invention was the quantifier-variable notation. Variables are letters used to indicate things in an unspecific way; thus ‘x is mortal’ is read as predicating of an unspecified thing x what ‘Socrates is mortal’ predicates of Socrates. The connectives can now be used to form complex predicates as well as propositions, for example ‘x is human and x is mortal’; while different variables can be used in different places to express relational predicates, for example ‘x loves y’. The quantifier goes in front of the predicate it governs, with the relevant variable repeated beside it to indicate which positions are being generalized. These radical departures from the idiom of quantification in natural languages are needed to solve the further problem of ambiguity of scope. Compare, for example, the ambiguity of ‘someone loves everyone’ with the unambiguous alternative renderings ‘there is an x such that for every y, x loves y’ and ‘for every y, there is an x such that x loves y’. The result is a pattern of formal language based on a non-logical vocabulary of names of things and primitive predicates expressing properties and relations of things. The logical constants are the truth-functional connectives and the universal and existential quantifiers, plus a stock of variables construed as ranging over things. This is ‘the’ predicate calculus. A common option is to add the identity sign as a further logical constant, producing the predicate calculus with identity. The first modern logic of quantification, Frege’s of 1879, was designed to express generalizations not only about individual things but also about properties of individuals. It would nowadays be classified as a second-order logic, to distinguish it from the first-order logic described above. Second-order logic is much richer in expressive power than first-order logic, but at a price: first-order logic can be axiomatized, second-order logic cannot.


1951 ◽  
Vol 16 (4) ◽  
pp. 241-267 ◽  
Author(s):  
G. Kreisel

1. The purpose of the present paper is to formulate the problem of non-finitist proofs, and to solve it for certain extensions of the predicate calculus, and for analysis with the exclusion of the theory of sets of points. The corresponding problem for general formal systems is discussed in another publication [1].To fix ideas we introduce the problem by examples from analysis. The general formulation is given in the text. Also, we shall use in the introduction the concepts decidable, verifiable, finitist without much formal explanation, because the reader is probably familiar with them, and they are defined early on in the text.The paper presupposes some knowledge of the methods and results in the theory of proofs. These enable one to state the general problem rather more precisely.


1962 ◽  
Vol 27 (1) ◽  
pp. 11-18 ◽  
Author(s):  
S. C. Kleene

Let Pp, Pd, and N be the intuitionistic formal systems of prepositional calculus, predicate calculus, and elementary number theory, respectively.1 Consider the following six propositions.8(1) ├A V B only if ├A or ├B.(2) ├∋xA(x) only if ├Ã(t) for some formula Ã(x) congruent to A(x) and some term t free for x in Ã(x).


1981 ◽  
Vol 46 (4) ◽  
pp. 773-780 ◽  
Author(s):  
E. G. K. López-Escobar

It is probably because intuitionism is founded on the concept of (abstract) proof that it has been possible to develop various kinds of models. The following is but a partial list: Gabbay [5], Beth [2], Kripke [8], Kleene [7], Läuchli [9], McKinsey and Tarski [10], Rasiowa and Sikorski [14], Scott [15], de Swart [16], and Veldman [17].The original purpose for having the models appears to have been for obtaining independence or consistency results for certain formalizations of intuitionism [see Beth [2], Prawitz [13]]; of course, if the models could be also justified as being plausible interpretations of intuitionistic thinking, so much the better. In fact, having some kind of plausible interpretation makes it much easier to work with the models. Occasionally the models were used to suggest possible extensions of the formal systems; for example, the Kripke models with constant domains have motivated interest in the formal logic CD which extends the Intuitionistic Predicate Calculus (IPC) by having the axiom schema


1957 ◽  
Vol 41 (336) ◽  
pp. 158
Author(s):  
R. L. Goodstein ◽  
Th. Skolem ◽  
G. Hasenjaeger ◽  
G. Kreisel ◽  
A. Robinson ◽  
...  

Sign in / Sign up

Export Citation Format

Share Document