Abstract

Any language $$\mathcal {L}$$ L of classical logic, of first- or higher-order, is expanded with sentential quantifiers and operators. The resulting language $$\mathcal {L}^+\!$$ L +, capable of self-reference without arithmetic or syntax encoding, can serve as its own metalanguage. The syntax of $$\mathcal {L}^+$$ L + is represented by directed graphs, and its semantics, which coincides with the classical one on $$\mathcal {L}$$ L, uses the graph-theoretic concepts of kernels and semikernels. Kernels provide an explosive semantics, while semikernels generalize this to situations where paradoxes do not lead to explosion, thus distinguishing them from contradictions. Paradoxes arise only at the metalevel due to specific interpretations of the operators, but they can be avoided: $$\mathcal {L}^+$$ L + can express paradoxes but remains free from them. For an expansion $$\mathcal {L}^+$$ L + of any FOL language $$\mathcal {L}$$ L, with the non-explosive semantics, a complete reasoning system is obtained by extending Gentzen’s classical sequent calculus with two rules for the sentential quantifiers. Adding (cut) yields a complete system for the explosive semantics. The novel semantics and self-referential capabilities seem promising for a further extension of classical logic towards one capable also of consistently expressing its own syntax and truth theory.