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: 94,749

External links

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

Through your library

Analytics

Added to PP
2023-10-07

Downloads
14 (#1,020,870)

6 months
8 (#528,770)

Historical graph of downloads
How can I increase my downloads?