Definability of Boolean functions in Kripke semantics

DOI10.1215/00294527-2023-0011OpenAlexW4387412378MaRDI QIDQ6187418

Naosuke Matsuda

Publication date: 15 January 2024

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/00294527-2023-0011

zbMATH Keywords

Kripke semanticsBoolean functionfunctional completeness

Mathematics Subject Classification ID

Boolean functions (06E30) Subsystems of classical logic (including intuitionistic logic) (03B20)

Cites Work

• Unnamed Item
• Post's functional completeness theorem
• Effect of the choice of connectives on the relation between classical logic and intuitionistic logic
• Deriving Natural Deduction Rules from Truth Tables
• Sequents in many valued logic II
• Logical connectives for intuitionistic propositional logic
• Proof of the independence of the primitive symbols of Heyting's calculus of propositions
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

This page was built for publication: Definability of Boolean functions in Kripke semantics