Counting the maximal partial clones on a finite set

Reference : Counting the maximal partial clones on a finite set


	Document type :	Scientific journals : Article
	Discipline(s) :	Physical, chemical, mathematical & earth Sciences : Mathematics
	To cite this reference:	http://hdl.handle.net/10993/11405

Title :	Counting the maximal partial clones on a finite set
Language :	English
Author, co-author :	Schölzel, Karsten [University of Luxembourg > Faculty of Science, Technology and Communication (FSTC) > Mathematics Research Unit >]
Publication date :	2012
Journal title :	Journal of Multiple-Valued Logic and Soft Computing
Volume :	18
Issue/season :	2
Pages :	153-165
Peer reviewed :	Yes (verified by ORBi^lu)
Audience :	International
ISSN :	1542-3980
Keywords :	[en] 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.
Permalink :	http://hdl.handle.net/10993/11405

File(s) associated to this reference

Fulltext file(s):

	File	Commentary	Version	Size	Access
Limited access	number.pdf		Author postprint	225.46 kB	Request a copy

All documents in ORBi^lu are protected by a user license.