Abstract
A set of Boolean functions is said to be functionally complete if every Boolean function is definable by combining functions in . Post clarified when a set of Boolean functions is functionally complete (with respect to classical semantics). In this paper, by extending Post’s theorem, we clarify when a set of Boolean functions is functionally complete with respect to Kripke semantics.
Citation
Naosuke Matsuda. "Definability of Boolean Functions in Kripke Semantics." Notre Dame J. Formal Logic 64 (3) 363 - 376, August 2023. https://doi.org/10.1215/00294527-2023-0011
Information