Definability of Boolean Functions in Kripke Semantics

Notre Dame Journal of Formal Logic 64 (3):363-376 (2023)
  Copy   BIBTEX

Abstract

A set F of Boolean functions is said to be functionally complete if every Boolean function is definable by combining functions in F. 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.

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,610

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Kripke bundle semantics and c-set semantics.Eiko Isoda - 1997 - Studia Logica 58 (3):395-401.
Incompleteness Results in Kripke Bundle Semantics.Kazuaki Nagaoka & Eiko Isoda - 1997 - Mathematical Logic Quarterly 43 (4):485-498.
Neighbourhood semantics and generalized Kripke models.Bernd Dahn - 1976 - Bulletin of the Section of Logic 5 (1):2-7.
Algebraic Kripke-Style Semantics for Relevance Logics.Eunsuk Yang - 2014 - Journal of Philosophical Logic 43 (4):803-826.
Kripke-style semantics for many-valued logics.Franco Montagna & Lorenzo Sacchetti - 2003 - Mathematical Logic Quarterly 49 (6):629.
Quantified modal logic with neighborhood semantics.Geir Waagbø & G. Waagbø - 1992 - Mathematical Logic Quarterly 38 (1):491-499.
Semantics in Banach spaces.Sławomir Bugajski - 1983 - Studia Logica 42 (1):81 - 88.
Logics for classes of Boolean monoids.Gerard Allwein, Hilmi Demir & Lee Pike - 2004 - Journal of Logic, Language and Information 13 (3):241-266.

Analytics

Added to PP
2023-10-07

Downloads
13 (#1,030,551)

6 months
9 (#300,492)

Historical graph of downloads
How can I increase my downloads?