An Asymptotic Formula for the Number of Complete Propositional Connectives

DOI10.1002/malq.19620080102zbMath0199.00302OpenAlexW1964938448MaRDI QIDQ5596726

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)

Related Items (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