Classical propositional calculus is the standard propositional logic. Its intended semantics is bivalent and its main property is that it is syntactically complete, otherwise said that no new axiom not already consequence of the existing axioms can be added without making the logic inconsistent. Many different equivalent complete axiom systems have been formulated. They differ in the choice of basic connectives used, which in all cases have to be functionally complete (i.e. able to express by composition all *n*-ary truth tables), and in the exact complete choice of axioms over the chosen basis of connectives.

The formulations here use implication and negation
{
→
,
¬
}
as functionally complete set of basic connectives. Every logic system requires at least one non-nullary rule of inference. Classical propositional calculus typically uses the rule of modus ponens:

A
,
A
→
B
⊢
B
.
We assume this rule is included in all systems below unless stated otherwise.

Frege's axiom system:

A
→
(
B
→
A
)
(
A
→
(
B
→
C
)
)
→
(
(
A
→
B
)
→
(
A
→
C
)
)
(
A
→
B
)
→
(
¬
B
→
¬
A
)
¬
¬
A
→
A
A
→
¬
¬
A
Hilbert's axiom system:

A
→
(
B
→
A
)
(
A
→
(
B
→
C
)
)
→
(
B
→
(
A
→
C
)
)
(
B
→
C
)
→
(
(
A
→
B
)
→
(
A
→
C
)
)
A
→
(
¬
A
→
B
)
(
A
→
B
)
→
(
(
¬
A
→
B
)
→
B
)
Łukasiewicz's axiom systems:

First:
Second:
Third:
Fourth:
Łukasiewicz and Tarski's axiom system:

[
(
A
→
(
B
→
A
)
)
→
(
[
(
¬
C
→
(
D
→
¬
E
)
)
→
[
(
C
→
(
D
→
F
)
)
→
(
(
E
→
D
)
→
(
E
→
F
)
)
]
]
→
G
)
]
→
(
H
→
G
)
Meredith's axiom system:

(
(
(
(
A
→
B
)
→
(
¬
C
→
¬
D
)
)
→
C
)
→
E
)
→
(
(
E
→
A
)
→
(
D
→
A
)
)
Mendelson's axiom system:

A
→
(
B
→
A
)
(
A
→
(
B
→
C
)
)
→
(
(
A
→
B
)
→
(
A
→
C
)
)
(
¬
A
→
¬
B
)
→
(
(
¬
A
→
B
)
→
A
)
Russell's axiom system:

A
→
(
B
→
A
)
(
A
→
B
)
→
(
(
B
→
C
)
→
(
A
→
C
)
)
(
A
→
(
B
→
C
)
)
→
(
B
→
(
A
→
C
)
)
¬
¬
A
→
A
(
A
→
¬
A
)
→
¬
A
(
A
→
¬
B
)
→
(
B
→
¬
A
)
Sobociński's axiom systems:

First:
(
A
→
B
)
→
(
¬
B
→
(
A
→
C
)
)
A
→
(
B
→
(
C
→
A
)
)
(
¬
A
→
B
)
→
(
(
A
→
B
)
→
B
)
Second:
¬
A
→
(
A
→
B
)
A
→
(
B
→
(
C
→
A
)
)
(
¬
A
→
C
)
→
(
(
B
→
C
)
→
(
(
A
→
B
)
→
C
)
)
Instead of negation, classical logic can also be formulated using the functionally complete set
{
→
,
⊥
}
of connectives.

Tarski–Bernays–Wajsberg axiom system:

(
A
→
B
)
→
(
(
B
→
C
)
→
(
A
→
C
)
)
A
→
(
B
→
A
)
(
(
A
→
B
)
→
A
)
→
A
⊥
→
A
Church's axiom system:

A
→
(
B
→
A
)
(
A
→
(
B
→
C
)
)
→
(
(
A
→
B
)
→
(
A
→
C
)
)
(
(
A
→
⊥
)
→
⊥
)
→
A
Meredith's axiom systems:

First:
Second:
Instead of implication, classical logic can also be formulated using the functionally complete set
{
¬
,
∨
}
of connectives. These formulations use the following rule of inference;

A
,
¬
A
∨
B
⊢
B
.
Russell–Bernays axiom system:

¬
(
¬
B
∨
C
)
∨
(
¬
(
A
∨
B
)
∨
(
A
∨
C
)
)
¬
(
A
∨
B
)
∨
(
B
∨
A
)
¬
A
∨
(
B
∨
A
)
¬
(
A
∨
A
)
∨
A
Meredith's axiom systems:

First:
Second:
Third:
Dually, classical propositional logic can be defined using only conjunction and negation.

Because Sheffer's stroke (also known as NAND operator) is functionally complete, it can be used to create an entire formulation of propositional calculus. NAND formulations use a rule of inference called Nicod's modus ponens:

A
,
A
∣
(
B
∣
C
)
⊢
C
.
Nicod's axiom system:

(
A
∣
(
B
∣
C
)
)
∣
[
(
E
∣
(
E
∣
E
)
)
∣
(
(
D
∣
B
)
∣
[
(
A
∣
D
)
∣
(
A
∣
D
)
]
)
]
Łukasiewicz's axiom systems:

First:
Second:
Wajsberg's axiom system:

(
A
∣
(
B
∣
C
)
)
∣
[
(
(
D
∣
C
)
∣
[
(
A
∣
D
)
∣
(
A
∣
D
)
]
)
∣
(
A
∣
(
A
∣
B
)
)
]
Argonne axiom systems:

First:
(
A
∣
(
B
∣
C
)
)
∣
[
(
A
∣
(
B
∣
C
)
)
∣
(
(
D
∣
C
)
∣
[
(
C
∣
D
)
∣
(
A
∣
D
)
]
)
]
Second:
(
A
∣
(
B
∣
C
)
)
∣
[
(
[
(
B
∣
D
)
∣
(
A
∣
D
)
]
∣
(
D
∣
B
)
)
∣
(
(
C
∣
B
)
∣
A
)
]
Computer analysis by Argonne has revealed > 60 additional single axiom systems that can be used to formulate NAND propositional calculus.

The implicational propositional calculus is the fragment of the classical propositional calculus which only admits the implication connective. It is not functionally complete (because it lacks the ability to express falsity and negation) but it is however syntactically complete. The implicational calculi below use modus ponens as an inference rule.

Bernays–Tarski axiom system:

A
→
(
B
→
A
)
(
A
→
B
)
→
(
(
B
→
C
)
→
(
A
→
C
)
)
(
(
A
→
B
)
→
A
)
→
A
Łukasiewicz and Tarski's axiom systems:

First:
Second:
Third:
Fourth:
Łukasiewicz's axiom system:

Intuitionistic logic is a subsystem of classical logic. It is commonly formulated with
{
→
,
∧
,
∨
,
⊥
}
as the set of (functionally complete) basic connectives. It is not syntactically complete since it lacks excluded middle A∨¬A or Peirce's law ((A→B)→A)→A which can be added without making the logic inconsistent. It has modus ponens as inference rule, and the following axioms:

A
→
(
B
→
A
)
(
A
→
(
B
→
C
)
)
→
(
(
A
→
B
)
→
(
A
→
C
)
)
(
A
∧
B
)
→
A
(
A
∧
B
)
→
B
A
→
(
B
→
(
A
∧
B
)
)
A
→
(
A
∨
B
)
B
→
(
A
∨
B
)
(
A
→
C
)
→
(
(
B
→
C
)
→
(
(
A
∨
B
)
→
C
)
)
⊥
→
A
Alternatively, intuitionistic logic may be axiomatized using
{
→
,
∧
,
∨
,
¬
}
as the set of basic connectives, replacing the last axiom with

(
A
→
¬
A
)
→
¬
A
¬
A
→
(
A
→
B
)
Intermediate logics are in between intuitionistic logic and classical logic. Here are a few intermediate logics:

Jankov logic (KC) is an extension of intuitionistic logic, which can be axiomatized by the intuitionistic axiom system plus the axiom
¬
A
∨
¬
¬
A
.
Gödel–Dummett logic (LC) can be axiomatized over intuitionistic logic by adding the axiom
(
A
→
B
)
∨
(
B
→
A
)
.
The positive implicational calculus is the implicational fragment of intuitionistic logic. The calculi below use modus ponens as an inference rule.

Łukasiewicz's axiom system:

A
→
(
B
→
A
)
(
A
→
(
B
→
C
)
)
→
(
(
A
→
B
)
→
(
A
→
C
)
)
Meredith's axiom systems:

First:
Second:
Third:
Hilbert's axiom systems:

First:
Second:
Third:
Positive propositional calculus is the fragment of intuitionistic logic using only the (non functionally complete) connectives
{
→
,
∧
,
∨
}
. It can be axiomatized by any of the above-mentioned calculi for positive implicational calculus together with the axioms

(
A
∧
B
)
→
A
(
A
∧
B
)
→
B
A
→
(
B
→
(
A
∧
B
)
)
A
→
(
A
∨
B
)
B
→
(
A
∨
B
)
(
A
→
C
)
→
(
(
B
→
C
)
→
(
(
A
∨
B
)
→
C
)
)
Optionally, we may also include the connective
↔
and the axioms

(
A
↔
B
)
→
(
A
→
B
)
(
A
↔
B
)
→
(
B
→
A
)
(
A
→
B
)
→
(
(
B
→
A
)
→
(
A
↔
B
)
)
Johansson's minimal logic can be axiomatized by any of the axiom systems for positive propositional calculus and expanding its language with the nullary connective
⊥
, with no additional axiom schemas. Alternatively, it can also be axiomatized in the language
{
→
,
∧
,
∨
,
¬
}
by expanding the positive propositional calculus with the axiom

(
A
→
¬
B
)
→
(
B
→
¬
A
)
or the pair of axioms

(
A
→
B
)
→
(
¬
B
→
¬
A
)
A
→
¬
¬
A
Intuitionistic logic in language with negation can be axiomatized over the positive calculus by the pair of axioms

(
A
→
¬
B
)
→
(
B
→
¬
A
)
¬
A
→
(
A
→
B
)
or the pair of axioms

(
A
→
¬
A
)
→
¬
A
¬
A
→
(
A
→
B
)
Classical logic in the language
{
→
,
∧
,
∨
,
¬
}
can be obtained from the positive propositional calculus by adding the axiom

(
¬
A
→
¬
B
)
→
(
B
→
A
)
or the pair of axioms

(
A
→
¬
B
)
→
(
B
→
¬
A
)
¬
¬
A
→
A
Fitch calculus takes any of the axiom systems for positive propositional calculus and adds the axioms

¬
A
→
(
A
→
B
)
A
↔
¬
¬
A
¬
(
A
∨
B
)
↔
(
¬
A
∧
¬
B
)
¬
(
A
∧
B
)
↔
(
¬
A
∨
¬
B
)
Note that the first and third axioms are also valid in intuitionistic logic.

Equivalential calculus is the subsystem of classical propositional calculus that only allows the (functionally incomplete) equivalence connective, denoted here as
≡
. The rule of inference used in these systems is as follows:

A
,
A
≡
B
⊢
B
Iséki's axiom system:

(
(
A
≡
C
)
≡
(
B
≡
A
)
)
≡
(
C
≡
B
)
(
A
≡
(
B
≡
C
)
)
≡
(
(
A
≡
B
)
≡
C
)
Iséki–Arai axiom system:

A
≡
A
(
A
≡
B
)
≡
(
B
≡
A
)
(
A
≡
B
)
≡
(
(
B
≡
C
)
≡
(
A
≡
C
)
)
Arai's axiom systems;

First:
Second:
Łukasiewicz's axiom systems:

First:
Second:
Third:
Meredith's axiom systems:

First:
Second:
Third:
Fourth:
Fifth:
Sixth:
Seventh:
Kalman's axiom system:

Winker's axiom systems:

First:
Second:
XCB axiom system: