Weak bases for Boolean relational clones revisited

  • Mike Behrisch

Research output: Chapter in Book/Report/Conference proceedingConference proceedingspeer-review

Abstract

We improve an existence condition for weak bases of relational clones on finite sets. Moreover, we provide a set of singleton weak bases of Boolean relational clones different than those exhibited by Lagerkvist in [10]. We treat groups of ‘similar’ Boolean clones in a uniform manner with the goal of thereby simplifying proofs working by case distinction along the clones in Post's lattice.
Original languageEnglish
Title of host publicationIEEE 52nd International Symposium on Multiple-Valued Logic—ISMVL 2022, Dallas, Texas, USA, 18–20 May 2022
Place of PublicationLos Alamitos, CA, USA
PublisherIEEE Computer Society
Pages68-73
Number of pages6
ISBN (Electronic)9781665423953
DOIs
Publication statusPublished - May 2022

Publication series

NameProceedings of The International Symposium on Multiple-Valued Logic
Volume2022-May
ISSN (Print)0195-623X

Fields of science

  • 101 Mathematics
  • 101001 Algebra
  • 101013 Mathematical logic
  • 102031 Theoretical computer science

JKU Focus areas

  • Digital Transformation

Cite this