完全相容稳定模糊谓词转换器

谓词转换器语义是用程序验证技术来定义程序语言的一种方式.为描述程序的语义,在稳定模糊谓词的基础上建立完全相容稳定模糊谓词转换器,讨论完全相容稳定模糊谓词转换器的拓扑语义. 同时给出它与状态转换器之间的一个保序关系,说明完全相容稳定模糊谓词转换器一定是状态转换器.     

L—Fuzzy拓扑空间中的可数SR—紧性

从层次结构入手引入L－fuzzy拓扑空间中的可数SR－紧性,证明了可数SR－紧性对强半闭子集遗传,可数SR－紧子集在S－不定映射 像保持,给出了可数SR－紧性的几何刻画与有限交性质的刻画。     

一种新的Fuzzifying拓扑空间中的半开集

利用不同于文献[7]的方法引入了Fuzzifying拓扑空间中的半开集的概念,通过实例说明本文定义的半开集概念不同于文献[7]中的相应的概念,且有明显优点.此外,利用新定义的半开集概念引入Fuzzifying拓扑空间中的半领域系,半闭包及半内部,最后作为应用定义了映射的Fuzzying半连续性并给出若干刻画条件.     

半粘合拓扑空间与商半拓扑空间

作者在文［１］中给出了半粘合拓扑空间以及半粘合映射的定义，并得到了它们的基本性质。中文进一步研究了与半枯合拓扑空间和半粘合映射有关的问题。另外也讨论了商空间成为Ｓ_２－拓扑空间的条件．最后给出了一个半同胚定理。     

广义近似空间的粗糙同胚与拓扑同胚

对广义近似空间之间的映射引入并刻画了粗糙连续性和拓扑连续性,探讨了他们的性质及相互关系.证明了两个粗糙连续映射的复合还是粗糙连续的,每个粗糙连续的映射都是拓扑连续的.在此基础上引入了粗糙同胚性质和拓扑同胚性质的概念,证明了拓扑同胚性质均为粗糙同胚性质并考察了广义近似空间的诸如分离性、连通性、紧性等的粗糙同胚不变性和拓扑同胚不变性.     

半广义不定映射

在L-拓扑空间中引入半广义不定映射,强半广义连续映射,全半广义连续映射,同时讨论它们一些性质。     

Fuzzifying拓扑空间中的强半开集

利用文献[3]中重新定义的半开集在Fuzzifying拓扑空间中引入了强半开集.此外,利用新定义的强半开集概念引入了强半邻域、强半闭包和强半内部,最后作为应用定义了映射的强半连续性并给出了若干等价刻画.     

强拟闭集与强拟连续

利用半闭集引入强拟闭集概念,研究了半开集、强拟开集、强拟闭集概念之间的关系,得到了强拟闭集是连续闭映射下的不变量及其相关性质;最后给出强拟连续概念并得到其等价刻画.     

模糊半开集和半分离性公理

本文改进了文[3]的模糊半开集定义，在本文定义的模糊半开集定义，不仅可以完全保留文[3]的结论，而且还能建立分明拓扑空间及其诱导拓扑空间关于半开集、半闭集等对应关系。此外，本文借助重域概念重新定义了半－R0，半－R1和半－T2空间，与[4]相比，本文定义的半分离性公理体系可以更自然地推广分明拓扑空间中的有关定理。     

半流的原像熵

本文对紧致度量空间上的连续半流引入了几类原像熵的定义,并对它们的性质进行了研究,证明了对于无不动点的连续半流而言,这些熵具有一定程度的拓扑共轭不变性,对这些熵的关系进行了研究并得到了联系这些熵的不等式,还证明了连续半流与其时刻1映射具有相同的拓扑熵和原像熵。     

Horn classes of predicate systems and varieties of partial algebras

We propound an approach through which techniques of the theory of quasivarieties of predicate systems are brought to bear on partial algebras. For every partial algebra A, two predicate representations are treated. The first is the graph of A whose basic operations are graphs of the basic operations on A. The second representation results from the graph of A by adding domains of the operations on A to its basic relations. Studying partial algebras from various perspectives makes it necessary to deal with different equality semantics. Here we present a general definition of semantics that stretches over such instances as weak semantics, Evans’ semantics. Kleene semantics, and strong semantics. On a set of all semantics, the preorder is induced in increasing “force,” and it is proved that certain of the properties of varieties of partial algebras in a given semantics are individuated by the position it takes in that set. We argue that every variety of partial algebras, in any semantics, is in correspondence with a Horn class of predicate systems which admits a generation operator and is closed under direct limits and retracts. For such classes we prove analogs of the Birkhoff theorem on subdirect decompositions and of the Taylor theorem on residual smallness. Therefore, these are also applicable to varieties of partial algebras in arbitrary semantics. Supported through the RF State Committee of Higher Education (1998 project), jointly by RFFR and DFG grants Nos. 96-01-00097 and 436113/2670, and also through FP “Integration” project No. 274. Translated fromAlgebra i Logika, Vol. 39, No. 1, pp. 23–46, January–February, 2000.     

Arithmetical realizability and basic logic

Absolute arithmetical realizability of predicate formulas is introduced. It is proved that the intuitionistic logic is not correct with this semantics, but the basic logic is correct.     

Separation of convex sets by extreme hyperplanes

The problem of separation of convex sets by extreme hyperplanes (functionals) in normed linear spaces is examined. The concept of a bar (a closed set of special form) is introduced; it is shown that a bar is characterized by the property that any point not lying in it can be separated from it by an extreme hyperplane. In two-dimensional spaces, in spaces with strictly convex dual, and in the space of continuous functions, any two bars are extremely separated. This property is shown to fail in the space of summable functions. A number of examples and generalizations are given.     

The Metaphysics of Mixed Inferences: Problems with Functionalist Accounts of Alethic Pluralism

Alethic pluralists argue truth is a metaphysically robust higher-order property that is multiply realized by a set of diverse and domain-specific subvening alethic properties. The higher-order truth property legitimizes mixed inferences and accounts for a univocal truth predicate. Absent of this higher-order property, pluralists lack an account of the validity of mixed inferences and an adequate semantics for the truth predicate and thereby appear forced to abandon the central tenets of alethic pluralism. I argue the use of many-valued logics to support pluralism fails to address the pluralist’s metaphysical problem regarding mixed inferences and mixed truth functional connectives. The high degree of heterogeneity of the alethic realizers (unlike the realizers for pain) challenges the plausibility of a single higher-order functional property. A functional property with such a heterogeneous base cannot be projectable at a theoretically significant level. The problem with mixed inferences and truth functions is but one symptom of the deeper projectability problem.     

Estimates for Elements of Inverse Matrices for a Class of Operators with Matrices of Special Structure

In this paper, we consider questions related to the structure of inverse matrices of linear bounded operators acting in infinite-dimensional complex Banach spaces. We obtain specific estimates of elements of inverse matrices for bounded operators whose matrices have a special structure. Matrices are introduced as special operator-valued functions on an index set. The matrix structure is described by the behavior of the given function on elements of a special partition of the index set. The method used for deriving the estimates is based on an analysis of Fourier series of strongly continuous periodic functions.     

Algebraic semantics for superintuitionistic predicate logics

We construct a unified algebraic semantics for superintuitionistic predicate logics. Assigned to each predicate logic is some deductive system of a propositional language which is kept fixed throughout all predicate superintuitionistic ones. Given that system, we build up a variety of algebras w.r.t. which a given logic is proved to be strongly complete. Supported by the Russian Arts Foundation (RAF), grant No. 97-03-04089a. Translated fromAlgebra i Logika, Vol. 38, No. 1, pp. 68–95, January–February, 1999.     

On the completeness and the decidability of strictly monadic second-order logic

Regarding strictly monadic second-order logic (SMSOL), which is the fragment of monadic second-order logic in which all predicate constants are unary and there are no function symbols, we show that a standard deductive system with full comprehension is sound and complete with respect to standard semantics. This result is achieved by showing that in the case of SMSOL, the truth value of any formula in a faithful identity-standard Henkin structure is preserved when the structure is “standardized”; that is, the predicate domain is expanded into the set of all unary relations. In addition, we obtain a simpler proof of the decidability of SMSOL.     

Arithmetical realizability and primitive recursive realizability

The semantics of the predicate logic based on the absolute arithmetical realizability is proved to differ from the semantics based on the primitive recursive realizability by Salehi.