Enumerating Types of Boolean Functions
From MaRDI portal
Publication:3398615
DOI10.2178/BSL/1246453975zbMATH Open1181.03002OpenAlexW2025524923MaRDI QIDQ3398615FDOQ3398615
Authors: Alasdair Urquhart
Publication date: 29 September 2009
Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2178/bsl/1246453975
Recommendations
History of mathematics in the 19th century (01A55) History of mathematics in the 20th century (01A60) Classical propositional logic (03B05) History of mathematical logic and foundations (03-03)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On the shoulders of Hipparchus. A reappraisal of ancient Greek combinatorics
- On the Second Number of Plutarch
- Hipparchus, Plutarch, Schroder, and Hough
- Title not available (Why is that?)
- Kombinatorische Anzahlbestimmungen für Gruppen, Graphen und chemische Verbindungen
- Title not available (Why is that?)
- On the cycle index of a product of permutation groups
- On the number of bi-colored graphs
- A Course in Enumeration
- Enumeration under two representations of the wreath product
- Title not available (Why is that?)
- The Number of Transitivity Sets of Boolean Functions
- On The Number of Symmetry Types of Boolean Functions of n Variables
- Exponentiation of Permutation Groups
- Sur les types des propositions composées
- On the number of classes of (n,k) switching networks
- Überprüfung einer frühen Anwendung der Kombinatorik in der Logik
- Title not available (Why is that?)
- ON FACTORING JEVONS' NUMBER
Cited In (4)
This page was built for publication: Enumerating Types of Boolean Functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3398615)