Back
  1. Home
  3. Detailled Reference
Request a copy
Article (Scientific journals)
Counting the maximal partial clones on a finite set
Schölzel, Karsten
2012 • In Journal of Multiple-Valued Logic and Soft Computing, 18 (2), p. 153-165
Peer Reviewed verified by ORBi
Permalink
https://hdl.handle.net/10993/11405
 

Files (1)Send toDetailsStatisticsBibliographySimilar publications

Files

Full Text
number.pdf
Author postprint (230.87 kB)
Request a copy

All documents in ORBilu are protected by a user license.

Send to


Details


Keywords :
Completeness theorem; Maximal partial clones; Partial functions; Completeness theorems; Computer program; Finite set; Partial clones; Formal logic; Software engineering; Cloning
Abstract :
[en] We show that different coherent relations specify different maximal partial clones. Then we describe a computer program to find all coherent relations and thus all maximal partial clones on 4-element, 5-element, and 6-element sets.
Disciplines :
Mathematics
Author, co-author :
Schölzel, Karsten ;  University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit
Language :
English
Title :
Counting the maximal partial clones on a finite set
Publication date :
2012
Journal title :
Journal of Multiple-Valued Logic and Soft Computing
ISSN :
1542-3980
Publisher :
Old City Publishing, United States - Pennsylvania
Volume :
18
Issue :
2
Pages :
153-165
Peer reviewed :
Peer Reviewed verified by ORBi
Available on ORBilu :
since 19 November 2013

Statistics

Number of views
40 (3 by Unilu)
Number of downloads
1 (1 by Unilu)
More statistics
Scopus citations®
 
0
Scopus citations®
without self-citations
0
WoS citations™
 
0

Bibliography

Similar publications


Contact ORBilu