9.4.2018 14:00 @ Hora Informaticae
Boolean cubes (or hypercubes) are natural underlying graphs for study of Boolean functions, error-correcting codes, set families, enumerations of bitstrings and many other objects. They are also one of the most studied architectures for interconnection networks. We present several examples of combinatorial structures in Boolean cubes, namely level-disjoint partitions, incidence colorings, distance labelings, symmetric chain decompositions, Gray codes, and we focus on their applications in various areas of computer science. We give an overview of recent results about these structures.
11.4.2018 10:00 @ Applied Mathematical Logic
18.4.2018 10:00 @ Applied Mathematical Logic
We present a generalization of Blok-Jnsson theory of equivalence between structural consequence relation in such a way as to naturally accommodate multiset-based consequence relations as well. While Blok and Jnsson admit, in place of sheer formulas, a wider range of syntactic units to be manipulated in deductions (including sequents and equations), these objects are invariably aggregated via set theoretical union. Our approach is more general in that non-idempotent forms of premiss and conclusion aggregation, including multiset sum and fuzzy set union, are considered. In the first part we focus on multiset consequence relation, present a natural general framework for their study, introduce basic syntactical and semantical notions and prove completenes. In the second part we present an abstract categorical framework generalizing Galatos-Tsinakis take on Blok-Jnsson theory.
25.4.2018 10:00 @ Applied Mathematical Logic
