Abstract
The question of the existence and the number of substitutional logics is considered. Every tabular logic with a functionally complete system of connectives is proved to be substitutional. For these logics, the existence of an algorithm is proved, which uses calculable consistent axiomatics of the theory to construct an exact unifying substitution for it. A denumerable number of substitutional tabular logics is constructed. Some substitutional tabular logics with meaningful interpretation are presented. Moreover, every substitutional logic is proved to have a characteristic matrix. The set of nonsubstitutional logics is proved to be continual.
Similar content being viewed by others
REFERENCES
J. Łos and R. Suszko, “Remarks on sentential logics,” Indagationes Math. 20, 177–183 (1958).
R. Wójcicki, Lectures on Propositional Calculi (Ossolineum, Wroclaw, 1984).
I. A. Gorbunov, “Converse of substitution and the theory of classical propositional logic,” in Proc. Int. Conf. Algebra and Mathematical Logic: Theory and Applications, Kazan, 2019 (Kazan. Fed. Univ., Kazan, 2019), pp. 101–103.
S. V. Yablonskii, Introduction to Discrete Mathematics (Vysshaya Shkola, Moscow, 2003) [in Russian].
S. V. Yablonskii, “Functional constructions in a k-valued logic,” Tr. Mat. Inst. Steklova 51, 5–142 (1958).
A. S. Karpenko, Lukasiewicz Logics and Prime Numbers (Nauka, Moscow, 2000) [in Russian].
A. Chagrov and M. Zakharyaschev, Modal Logic (Clarendon Press, Oxford, 1997).
A. G. Dragalin, Mathematical Intuitionism. Introduction to Proof Theory, Ser. Mathematical Logic and Foundations of Mathematics (Nauka, Moscow, 1979; Am. Math. Soc., Providence, RI, 1988).
Funding
This work is supported by the Russian Scientific Foundation (grant no. 21-18-00195).
Author information
Authors and Affiliations
Corresponding author
Ethics declarations
The authors declare that they have no conflicts of interest.
Additional information
Translated by M. Talacheva
About this article
Cite this article
Gorbunov, I.A. Theories of Propositional Logics and the Converse of Substitution. Russ Math. 66, 26–32 (2022). https://doi.org/10.3103/S1066369X22050048
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.3103/S1066369X22050048