多值逻辑中函数的有限闭集

IF 0.2 Q4 MATHEMATICS
M. Malkov
{"title":"多值逻辑中函数的有限闭集","authors":"M. Malkov","doi":"10.11648/J.PAMJ.20170601.13","DOIUrl":null,"url":null,"abstract":"The article is devoted to classification of close sets of functions in k-valued logic. We build the classification of finite closed sets. The sets contain only constants and unary functions since sets containing even a two-ary function are infinite. Formulas of the number of finite sets and minimal sets exist for all natural k. We find the numbers of closed sets containing the identity function f (x)=x or a constant for all k. We give the number of sets on levels of inclusions at k up to 10. The inclusion diagrams are present at k up to 5, at k=6 we give inclusion diagrams of sets containing only function f (x)=x and constant 0. We find isomorphic sets and use only one of the isomorphic sets to build the diagrams.","PeriodicalId":46057,"journal":{"name":"Italian Journal of Pure and Applied Mathematics","volume":null,"pages":null},"PeriodicalIF":0.2000,"publicationDate":"2017-02-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Finite Closed Sets of Functions in Multi-valued Logic\",\"authors\":\"M. Malkov\",\"doi\":\"10.11648/J.PAMJ.20170601.13\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article is devoted to classification of close sets of functions in k-valued logic. We build the classification of finite closed sets. The sets contain only constants and unary functions since sets containing even a two-ary function are infinite. Formulas of the number of finite sets and minimal sets exist for all natural k. We find the numbers of closed sets containing the identity function f (x)=x or a constant for all k. We give the number of sets on levels of inclusions at k up to 10. The inclusion diagrams are present at k up to 5, at k=6 we give inclusion diagrams of sets containing only function f (x)=x and constant 0. We find isomorphic sets and use only one of the isomorphic sets to build the diagrams.\",\"PeriodicalId\":46057,\"journal\":{\"name\":\"Italian Journal of Pure and Applied Mathematics\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.2000,\"publicationDate\":\"2017-02-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Italian Journal of Pure and Applied Mathematics\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.11648/J.PAMJ.20170601.13\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"MATHEMATICS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Italian Journal of Pure and Applied Mathematics","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.11648/J.PAMJ.20170601.13","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 1

摘要

研究了k值逻辑中函数闭集的分类问题。我们建立了有限闭集的分类。这些集合只包含常量和一元函数,因为即使包含二元函数的集合也是无限的。对于所有自然k,存在有限集和最小集的数量公式。我们找到了包含恒等函数f (x)=x或所有k的常数的闭集的数量。我们给出了k到10的包含层上的集合的数量。包含图在k ~ 5时存在,在k=6时我们给出只包含函数f (x)=x和常数0的集合的包含图。我们找到同构集合,只用其中一个同构集合来构建图。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Finite Closed Sets of Functions in Multi-valued Logic
The article is devoted to classification of close sets of functions in k-valued logic. We build the classification of finite closed sets. The sets contain only constants and unary functions since sets containing even a two-ary function are infinite. Formulas of the number of finite sets and minimal sets exist for all natural k. We find the numbers of closed sets containing the identity function f (x)=x or a constant for all k. We give the number of sets on levels of inclusions at k up to 10. The inclusion diagrams are present at k up to 5, at k=6 we give inclusion diagrams of sets containing only function f (x)=x and constant 0. We find isomorphic sets and use only one of the isomorphic sets to build the diagrams.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
0.60
自引率
0.00%
发文量
2
期刊介绍: The “Italian Journal of Pure and Applied Mathematics” publishes original research works containing significant results in the field of pure and applied mathematics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信