Tautologies of Propositional Logic

PC1 (φ ∧ ψ) → φ
PC2 (φ ∧ ψ) → ψ
PC3 (φ → ψ) → ((φ → χ) → (φ → (ψ ∧ χ))) Law of Composition
PC4 φ → (ψ → (φ ∧ ψ)) Law of Adjunction
PC5 (φ → ψ) → ((ψ → φ) → (φ ↔ ψ))
PC6 (φ → ψ) → ((ψ → χ) → (φ → χ)) Law of Syllogism (or HS)
PC7 (φ → (ψ → χ)) → ((φ ∧ ψ) → χ) Law of Importation
PC8 (φ → ψ) → ((ψ → (χ → ξ)) → ((φ ∧ χ) → ξ))
PC9 φ → (φ ∨ ψ)
PC10 ψ → (φ ∨ ψ)
PC11 (φ → ψ) → ((χ → ψ) → ((φ ∨ χ) → ψ))
PC12 φ ↔∼∼ φ Law of Double Negation (DN)
PC13 (φ ∨ ψ) ↔∼ (∼ φ∧ ∼ ψ) De Morgan’s Law I (DM)
PC14 (φ ∧ ψ) ↔∼ (∼ φ∨ ∼ ψ) De Morgan’s Law II (DM)
PC15 (φ → ψ) ↔ (∼ ψ →∼ φ) Law of Transposition
PC16 (φ ∨ ψ) ↔ (ψ ∨ φ) Commutativity
PC17 (φ ∧ ψ) ↔ (ψ ∧ φ) Commutativity
PC18 ((φ ∨ ψ) ∨ χ) ↔ (φ ∨ (ψ ∨ χ)) Associativity
PC19 ((φ ∧ ψ) ∧ χ) ↔ (φ ∧ (ψ ∧ χ)) Associativity
PC20 φ ↔ (φ ∨ φ)
PC21 φ ↔ (φ ∧ φ))

Axioms of Propositional and Quantificational Logic

PL1 φ → (ψ → φ)
PL2 (φ → (ψ → χ)) → ((φ → ψ) → (φ → χ))
PL3 (∼ ψ →∼ φ) → ((∼ ψ → φ) → ψ)
∀1 ∀αφ → φ(β/α)
∀2 ∀α(φ → ψ) → (φ → ∀αψ)

1
Axioms of Modal Logic
K (φ → ψ) → (φ → ψ)
K♦ (φ → ψ) → (♦φ → ♦ψ)
D φ → ♦φ
T φ → φ
T♦ φ → ♦φ
B ♦φ → φ
B♦ φ → ♦φ
S4 φ → φ
S4♦ ♦♦φ → ♦φ
S5 ♦φ → φ
S5♦ ♦φ → ♦φ

Rules of Inference
MP If ` φ → ψ and ` φ, then ` ψ
UG If ` φ, then ` ∀αφ
NEC If ` φ, then ` φ

Other
DT If Γ, φ ` ψ, then Γ ` φ → ψ
RX α = α
LL α = β → (φ(α) → φ(β)) (Leibniz’s Law)

Problematic Formulas
LI ∀x∀y(x = y → (x = y))
LNI ∀x∀y(x 6= y → (x 6= y))
PII ∀F ∀x∀y((F x ↔ F y) → x = y)
BF ∀xF x → ∀xF x
BFC ∀xF x → ∀xF x
Law of Identity (the necessity of identity)
Law of Non-Identity
Principle of the Identity of Indiscernibles
Barcan Formula
Converse Barcan Formula