Simple characterization of functionally complete one-element sets of propositional connectives

DOI10.1002/MALQ.200610009MaRDI QIDQ3419673zbMATH OpenOpenAlexFDO

Authors Petar Maksimović, Predrag Janičić

Publication date 7 February 2007

Published in MLQ (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/malq.200610009

zbMATH Keywords

Boolean functionspropositional logiccomplete sets of connectivesfunctionally complete propositional connectives

Mathematics Subject Classification ID

Classical propositional logic (03B05)

Recommendations

• ОБ ОДНОЭЛЕМЕНТНОЙ ФУНКЦИОНАЛЬНОЙ ПОЛНОТЕ В АЛГЕБРЕ БУЛЕВЫХ ФУНКЦИЙ
• A note on generalized functional completeness in the realm of elementary logic
• scientific article; zbMATH DE number 3863173
• Semantic characterization of certain sets of intuitionistic logical connectives
• Functional completeness for subsystems of intuitionistic propositional logic
• scientific article; zbMATH DE number 4118334
• Completeness proofs for propositional logic with polynomial-time connectives
• scientific article; zbMATH DE number 997666
• The Completeness of Propositional Resolution: A Simple and Constructive Proof
• scientific article; zbMATH DE number 1180553

Cited in

(1)

• A note on generalized functional completeness in the realm of elementary logic

This page was built for publication: Simple characterization of functionally complete one-element sets of propositional connectives

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