Record link: 
http://hdl.handle.net/20.500.12708/136048
-
Title: 
Weak bases for Boolean relational clones revisited
en
Citation: 
Behrisch, M. (2022). Weak bases for Boolean relational clones revisited. In 2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL) (pp. 68–73). IEEE Computer Society. https://doi.org/10.1109/ISMVL52857.2022.00017
-
Publisher DOI: 
10.1109/ISMVL52857.2022.00017
-
Publication Type: 
Inproceedings - Full-Paper Contribution
en
Language: 
English
-
Authors: 
Behrisch, Mike 
-
Organisational Unit: 
E104-01 - Forschungsbereich Algebra 
-
Published in: 
2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL) 
-
Date (published): 
May-2022
-
Event name: 
2022 IEEE 52nd International Symposium on Multiple-Valued Logic (ISMVL) 
-
Event date: 
18-May- 22 - 20-May- 22
-
Event place: 
Dallas, United States of America (the)
-
Number of Pages: 
6
-
Publisher: 
IEEE Computer Society
-
Keywords: 
Boolean clone; Boolean co-clone; Boolean relational clone; relational clone; strong partial clone; weak base
en
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.
en
Project (external): 
FWF
-
Project ID: 
P 33878
-
Link (external): 
https://ieeexplore.ieee.org/xpl/conhome/9797390/proceeding
-
Research Areas: 
Logic and Computation: 60%
Computer Science Foundations: 40%
-
Science Branch: 
1020 - Informatik: 40%
1010 - Mathematik: 60%
-
Appears in Collections:
Conference Paper

Show full item record

Page view(s)

170
checked on Nov 30, 2023

Google ScholarTM

Check