Decision algorithms for elementary topology I. Topological syllogistics with set and map constructs, connectedness, and cardinality comparison
Decision algorithms for elementary topology I. Topological syllogistics with set and map constructs, connectedness, and cardinality comparison
复制标题
基本拓扑的决策算法 I. 具有集合和映射构造、连通性和基数比较的拓扑三段论
DOI：
--
复制
发表时间：
1994
期刊：
影响因子：
--
通讯作者：
V. Cutello
中科院分区：
文献类型：
--
作者：
D. Cantone;V. Cutello
在本文中，我们给出了拓扑三段论的决策过程，表示为ℒ2,∞，除了标准布尔集算子（∩，∩，′（集补））和谓词（ϵ（隶属），=（相等））之外，还涉及 Kuratowski 闭包算子，具有正像和逆像、满射性和单射性以及点评估概念的连续和封闭映射，单例运算符{·}，用于比较两个给定集合的基数的谓词，以及表示给定集合拓扑连接的谓词。还讨论了几个例子。 © 1994 约翰威利父子公司。
In this paper we give a decision procedure for a topological syllogistic, denoted ℒ2,∞, involving, besides the standard Boolean set operators (∩, ∩, ′ (set complementation)) and predicates ( ϵ (membership), = (equality)), also the Kuratowski closure operator, continuous and closed maps with the notion of direct and inverse images, surjectivity and injectivity, as well as point evaluation, the singleton operator {·}, a predicate for comparing the cardinalities of two given sets, and a predicate expressing that a given set is topologically connected. Several examples are also discussed. © 1994 John Wiley & Sons, Inc.