Repository | Book | Chapter
(2001) Algebraic combinatorics and computer science, Dordrecht, Springer.
Rota-metropolis cubic logic and Ulam-Rényi games
F. Cicalese , Daniele Mundici , U. Vaccaro
pp. 197-244
In their paper [43] Rota and Metropolis considered the partially ordered set F n of all nonempty faces of the n-cube [0, 1]n for each n = 1, 2,…, equipped with the following operation: (⊔) taking the supremum A⊔ B of any two faces A and B of F n , together with the following two partially defined operations: (⊓) taking the set-theoretic intersection A ⊓ B of any two intersecting faces A and B of F n , and (Δ) when a face A is contained in another face B, taking the antipode Δ (B, A) of A in B.
Publication details
DOI: 10.1007/978-88-470-2107-5_10
Full citation:
Cicalese, F. , Mundici, D. , Vaccaro, U. (2001)., Rota-metropolis cubic logic and Ulam-Rényi games, in H. Crapo & D. Senato (eds.), Algebraic combinatorics and computer science, Dordrecht, Springer, pp. 197-244.
This document is unfortunately not available for download at the moment.