Leśniewski's protothetic is an extended propositional calculus in which all Boolean functions can be defined. The theory also includes a universal quantifier. In 1922, Alfred Tarski established that by employing functional variables and quantifiers, all the functions of propositional calculus can be defined using equivalence as the sole primitive function.


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


Tarski proved:
each of which can be used in the protothetic as the definition of the conjunction "." by means of the equivalence "≡". Note the use of dots instead of parentheses. Without this usage, the second definition would be:
Here the expression is the universal quantifier. The definitions of True and False can be and .
Sobociński discovered that conjunction can be defined by means of equivalence, the universal quantifier, and a variable propositional functor of two arguments.
The first of Sobociński's definitions of conjunction is
In more modern notation, the definition could be
So means the universal quantifier for all and all . The range of propositional variables is the set or . The expression means for all , where the range is the set of all 16 Boolean functions of two arguments. Note also that variables in Sobociński's definitions are not separated by commas.
This Demonstration shows all 12 of Sobociński's definitions and an expression that is not a definition of conjunction.
[1] B. Sobociński, "An Investigation of Protothetic," Polish Logic 1920-1939 (S. McCall, ed.), Oxford: Oxford University Press, 1967 pp. 201–206.
[2] J. T. J. Srzdnicki and Z. Stachniak, eds., S. Leśniewski's Lecture Notes in Logic, Dordrecht: Kluwer Academic Publishers, 1988 pp. 2–28.
    • 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 © 2017 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+