A solution of Dedekind's problem on the number of isotone Boolean functions.

DOI10.1515/crll.1988.386.139zbMath0632.06020OpenAlexW3140333211WikidataQ56679827 ScholiaQ56679827MaRDI QIDQ3768953

Andrzej P. Kisielewicz

Publication date: 1988

Published in: Journal für die reine und angewandte Mathematik (Crelles Journal) (Search for Journal in Brave)

Full work available at URL: https://www.digizeitschriften.de/dms/resolveppn/?PPN=GDZPPN002205467

zbMATH Keywords

Boolean latticeDedekind's problemcardinality of free bounded distributive latticenumber of isotone maps

Mathematics Subject Classification ID

Exact enumeration problems, generating functions (05A15) Combinatorial identities, bijective combinatorics (05A19) Boolean functions (06E30) Free lattices, projective lattices, word problems (06B25)

Related Items (12)

On Dedekind's problem for complete simple games ⋮ Unnamed Item ⋮ Unnamed Item ⋮ On the number of maximal antichains in Boolean lattices for \(n\) up to 7 ⋮ A note on binary strategy-proof social choice functions ⋮ A theoretical look at \textsc{Electre Tri}-nB and related sorting models ⋮ Counting inequivalent monotone Boolean functions. ⋮ The linear chromatic number of a Sperner family ⋮ The Polytope of Fuzzy Measures and Its Adjacency Graph ⋮ Counting finite posets and topologies ⋮ Dedekind's numbers characterize distributive lattices ⋮ Unnamed Item

This page was built for publication: A solution of Dedekind's problem on the number of isotone Boolean functions.