An Asymptotic Formula for the Number of Complete Propositional Connectives

DOI10.1002/MALQ.19620080102MaRDI QIDQ5596726zbMATH OpenOpenAlexFDO

Authors Roger F. Wheeler

Publication date 1962

Published in Mathematical Logic Quarterly (Search for Journal in Brave)

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

zbMATH Keywords

general logic

Mathematics Subject Classification ID

General logic (03Bxx)

Cited in

(2)

• On generating large classes of Sheffer functions
• On η-valued functionally complete truth functions

This page was built for publication: An Asymptotic Formula for the Number of Complete Propositional Connectives

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