Lewis Carroll's Diagram and Categorical Syllogisms

Aristotelian logic, or the traditional study of deduction, deals with four so-called categorical or subject-predicate propositions, which can be defined by
S a P ⇔ All S is P (universal affirmative or A proposition),
S i P ⇔ Some S is P (particular affirmative or I proposition),
S e P ⇔ No S is P (universal negative or E proposition),
S o P ⇔ Some S is not P (particular negative or O proposition).
S is called the subject (or minor) term and P is called the predicate (or major) term of the proposition. A categorical syllogism is a deductive argument about categorical propositions in which a conclusion is inferred from two premises. The term M that occurs in both premises is called the middle term. An example of a syllogism is M a P, S i M ⊨ S i P. There are 256 possible triples of categorical propositions, but only 24 valid syllogisms, some of which need existential support (Ex(S), Ex(P), or Ex(M), where Ex means "there is" or "there exists").
The aim of this Demonstration is to falsify (when the checkbox "valid syllogism" is unchecked) the argument, making the premises true and the conclusion false. According to Venn diagrams, a shaded region R means it is empty and + in the region R means existence of at least one element there (proposition Ex(R) is true). (To shade a region, click the appropriate button. A click in a region introduces a new locator (+) and Alt-click removes it.) Such an example is known as a counterexample.
Choosing a valid syllogism means that making the premises true will make the conclusion true as well. So an attempt to make the conclusion false will end in a contradiction (+ in the empty region).


  • [Snapshot]
  • [Snapshot]
  • [Snapshot]


The so-called figure of a categorical syllogism is determined by the possible position of middle term. There are four figures:
M x P, S x M ⊨ S x P,
P x M, S x M ⊨ S x P,
M x P, M x S ⊨ S x P,
P x M, M x S ⊨ S x P,
where x is a, i, e, or o.
This version of Carroll's diagrams was found in [2], p. 112. See also the Wikipedia entry for Categorical proposition.

[1] R. Audi, ed., The Cambridge Dictionary of Philosophy, Cambridge: Cambridge University Press, 1995 pp. 780–782.
[2] L. Borkowski, Elementy logiki formalnej (Elements of Formal Logic, in Polish), 3rd ed., Warsaw: Wyd, 1976.
[3] L. Carroll, Symbolic Logic and the Game of Logic, New York: Dover, 1958.
[4] I. M. Copi and C. Cohen, Introduction to Logic, 9th ed., New York: Macmillan, 1994 pp. 214–218.
    • Share:

Embed Interactive Demonstration New!

Just copy and paste this snippet of JavaScript code into your website or blog to put the live Demonstration on your site. More details »

Files require Wolfram CDF Player or Mathematica.

Mathematica »
The #1 tool for creating Demonstrations
and anything technical.
Wolfram|Alpha »
Explore anything with the first
computational knowledge engine.
MathWorld »
The web's most extensive
mathematics resource.
Course Assistant Apps »
An app for every course—
right in the palm of your hand.
Wolfram Blog »
Read our views on math,
science, and technology.
Computable Document Format »
The format that makes Demonstrations
(and any information) easy to share and
interact with.
STEM Initiative »
Programs & resources for
educators, schools & students.
Computerbasedmath.org »
Join the initiative for modernizing
math education.
Step-by-Step Solutions »
Walk through homework problems one step at a time, with hints to help along the way.
Wolfram Problem Generator »
Unlimited random practice problems and answers with built-in step-by-step solutions. Practice online or make a printable study sheet.
Wolfram Language »
Knowledge-based programming for everyone.
Powered by Wolfram Mathematica © 2018 Wolfram Demonstrations Project & Contributors  |  Terms of Use  |  Privacy Policy  |  RSS Give us your feedback
Note: To run this Demonstration you need Mathematica 7+ or the free Mathematica Player 7EX
Download or upgrade to Mathematica Player 7EX
I already have Mathematica Player or Mathematica 7+