Definability of Boolean functions in Kripke semantics

DOI10.1215/00294527-2023-0011MaRDI QIDQ6187418zbMATH OpenOpenAlexFDO

Authors 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

Boolean functionfunctional completenessKripke semantics

Mathematics Subject Classification ID

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

Cites work

• Deriving natural deduction rules from truth tables
• Effect of the choice of connectives on the relation between classical logic and intuitionistic logic
• scientific article; zbMATH DE number 3222098 (Why is no real title available?)
• Logical connectives for intuitionistic propositional logic
• Post's functional completeness theorem
• Proof of the independence of the primitive symbols of Heyting's calculus of propositions
• Sequents in many valued logic II
• The Two-Valued Iterative Systems of Mathematical Logic. (AM-5)

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6187418)