Completeness theorem for propositional probabilistic models whose measures have only finite ranges

A propositional logic is defined which in addition to propositional language contains a list of probabilistic operators of the form P_s (with the intended meaning the probability is at least s). The axioms and rules syntactically determine that ranges of probabilities in the corresponding models are always finite. The completeness theorem is proved. It is shown that completeness cannot be generalized to arbitrary theories.This research was supported by Ministarstvo za nauku, tehnologije i razvoj Republike Srbije, through Matematiki institut, under grant 1379Mathematics Subject Classification (2000): 03C70, 03B48     

Completeness and an extension theorem for continuous fuzzy linear order-homomorphisms

In this paper, the notions of λ-Cauchy net and completeness in L-topological vector spaces are introduced, and some of their properties are studied. An extension theorem for continuous fuzzy linear order homomorphisms is proved.     

Cut‐elimination Theorems for Some Infinitary Modal Logics

In this article, a cut‐free system TLM_ω1 for infinitary propositional modal logic is proposed which is complete with respect to the class of all Kripke frames.The system TLM_ω1 is a kind of Gentzen style sequent calculus, but a sequent of TLM_ω1 is defined as a finite tree of sequents in a standard sense. We prove the cut‐elimination theorem for TLM_ω1 via its Kripke completeness.     

A reduction theorem for the topological degree for mappings of class

The reduction theorem for the Leray-Schauder degree provides an efficient tool to calculate the value of the degree in a suitable invariant subspace. We shall prove how the calculation of the value of the topological degree for a mapping of class from a real separable reflexive Banach space into the dual space can be reduced into the calculation of degree of mapping from a closed subspace into Since the Leray-Schauder mappings are acting from to and we are dealing with mappings from to the standard `invariant subspace' condition must be replaced by a less obvious one.

     

强正则剩余格值逻辑系统（L）N及其完备性

正则剩余格是一类重要的模糊逻辑代数系统,而常见的模糊逻辑形式系统大多数带有非联接词,并且相应的Lindenbaum代数都是正则剩余格.本文以强正则剩余格为语义,建立了一个一般的命题演算形式系统LN,并且证明了这个系统的完备性.几种常见的带有非联接词的模糊逻辑形式系统都是系统LN的扩张.     

强正则剩余格值逻辑系统L~N及其完备性

正则剩余格是一类重要的模糊逻辑代数系统,而常见的模糊逻辑形式系统大多数带有非联接词,并且相应的Lindenbaum代数都是正则剩余格.本文以强正则剩余格为语义,建立了一个一般的命题演算形式系统LN,并且证明了这个系统的完备性.几种常见的带有非联接词的模糊逻辑形式系统都是系统LN的扩张.     

Analytic completeness theorem for singular biprobability models

The aim of the paper is to prove tha analytic completeness theorem for a logic L(∫₁, ∫₂)_A^s with two integral operators in the singular case. The case of absolute continuity was proved in [4]. MSC: 03B48, 03C70.     

Some Connections between Topological and Modal Logic

We study modal logics based on neighbourhood semantics using methods and theorems having their origin in topological model theory. We thus obtain general results concerning completeness of modal logics based on neighbourhood semantics as well as the relationship between neighbourhood and Kripke semantics. We also give a new proof for a known interpolation result of modal logic using an interpolation theorem of topological model theory.     

An Infinitary Graded Modal Logic (Graded Modalities VI)

We prove a completeness theorem for K, the infinitary extension of the graded version K⁰ of the minimal normal logic K, allowing conjunctions and disjunctions of countable sets of formulas. This goal is achieved using both the usual tools of the normal logics with graded modalities and the machinery of the predicate infinitary logics in a version adapted to modal logic.     

G—R型模糊命题逻辑系统完备的一个充分必要条件

引入基模糊公式的概念,在Gaines-Rescher蕴函算子下,给出模糊命题逻辑系统完备的一个充分必要条件。     

Completeness theorem for singular differential pencils

A theorem completeness theorem of special vector functions induced by the products of the so-called Weyl solutions of a fourth-order differential equation and by their derivatives on the semiaxis is presented. We prove that such nonlinear combinations of Weyl solutions and their derivatives constitute a linear subspace of decreasing (at infinity) solutions of a linear singular differential system of Kamke type. We construct and study the Green function of the corresponding singular boundary-value problems on the semiaxis for operator pencils defining differential systems of Kamke type. The required completeness theorem is proved by using the analytic and asymptotic properties of the Green function, operator spectral theory methods, and analytic function theory.     

Optimal shape design for fluid flow using topological perturbation technique

This paper is concerned with an optimal shape design problem in fluid mechanics. The fluid flow is governed by the Stokes equations. The theoretical analysis and the numerical simulation are discussed in two and three-dimensional cases. The proposed approach is based on a sensitivity analysis of a design function with respect to the insertion of a small obstacle in the fluid flow domain. An asymptotic expansion is derived for a large class of cost functions using small topological perturbation technique. A fast and accurate numerical algorithm is proposed. The efficiency of the method is illustrated by some numerical examples.     

随机指数系的完备性和极小性

得到了随机指数系在加权Banach空间C_α中完备和极小的充要条件,其中C_α是实直线R上的复连续函数在权α的一致范数下组成的Banach空间.这些结果可以看作是Malliavin经典结果的概率推广.     

（LF）-空间的完备性

设（E，ξ）=indlim（E．，ξn）为Frechel空间序列的诱导权限，我们证明了：若每个（Enξ|En）正速完备，则（E，ξ）=indlim（En，ξn）为完备，进而证明了；若对于每个自然数n，存在自然数m（n）使对于任意p≥m（n）有En；则（E，ξ）为完备．     

型空间中随机指数函数系的完备性

该文采用了新的方法来研究由整函数组成的满足 ( ∫∫_C| f(z)|^pe^-α(|z|)dm_z)^1/p <∞ (1 < p <∞) 的Fock型空间中随机指数函数系的完备性. 还对于实轴上的加权Banach 空间讨论了类似的问题     

Hamilton体系与辛正交系的完备性*

本文定义了一个Banach空间ZH,并证明了一类Hamilton体系的本征函数系(辛正交系)在ZH空间中具有完备性.还证明了如下结论ZH空间能连续嵌入到L₂[0,1]×L₂[0,1]但ZH≠L₂[0,1]×L₂[0,1].     

基于FI-代数的一个逻辑系统

建立一种基于FI-代数的模糊命题演算的形式演绎系统．并讨论了该系统语义的完备性。其目的在于使通常的众多模糊推理系统能够纳入该逻辑系统之中．以便在一个更加广泛的代数和逻辑框架下来研究模糊推理的逻辑基础问题。     

n维模糊度量空间及其完备性

定义了n维模糊向量的模糊距离、n维模糊度量空间及其完备性的概念,实现了用R上的模糊数度量模糊向量间距离的目的,不仅使得模糊距离的度量更加合理、更加贴切,也创立一套独立于实数的模糊数学分析理论打下了基础。