广义生灭最小Q过程的可配称性

研究全稳定广义生灭最小Q过程的可配称性,获得广义生灭最小Q过程是可配称的充分必要条件,以及最小Q过程是唯一的可配称Q过程的充分必要条件．     

Lemniscates and inequalities for the logarithmic capacities of continua

It is shown that if P(z) = z ⁿ + ? is a polynomial with connected lemniscate E(P) = {z: ¦P(z)¦ ≤ 1} and m critical points, then, for any n? m+1 points on the lemniscate E(P), there exists a continuum γ ? E(P) of logarithmic capacity cap γ ≤ 2^?1/n which contains these points and all zeros and critical points of the polynomial. As corollaries, estimates for continua of minimum capacity containing given points are obtained.     

The Maximal Closed Classes of Unary Functions in p-Valued Logic

In many-valued logic the decision of functional completeness is a basic and important problem, and the thorough solution to this problem depends on determining all maximal closed sets in the set of many-valued logic functions. It includes three famous problems, i.e., to determine all maximal closed sets in the set of the total, of the partial and of the unary many-valued logic functions, respectively. The first two problems have been completely solved ([1], [2], [8]), and the solution to the third problem boils down to determining all maximal subgroups in the k-degree symmetric group S_k, which is an open problem in the finite group theory. In this paper, all maximal closed sets in the set of unary p-valued logic functions are determined, where p is a prime. Mathematics Subject Classification: 03B50, 20B35.     

Optimality for set functions with values in ordered vector spaces

Let (X, , ) be a finite atomless measure space,L a convex subfamily of , andY andZ locally convex Hausdorff topological vector spaces which are ordered by the conesC andD, respectively. LetF:LY beC-convex andG:LZ beD-convex set functions. Consider the following optimization problem (P): minimizeF(), subject to L andG() _D . The paper generalizes the Moreau-Rockafellar theorem with set functions. By applying this theorem, a Kuhn-Tucker type optimality condition and a Fritz John type optimality condition for problem (P) are established. The duality theorem for problem (P) is also studied.This work was partially supported by National Science Council, Taipei, Taiwan. This paper was written while the first author was visiting at the University of Iowa, 1987-88.The authors would like to express their gratitude to the two anonymous referees for their valuable comments. Also, they would like to thank Professor P. L. Yu for his encouragement and suggestions which improved the material presented here considerably.     

A neuro-fuzzy system for X-ray spectra interpretation

A decision scheme for the interpretation of spectra from wavelength dispersive X-ray fluorescence spectrometry is described that encompasses elements from three areas of artificial intelligence: fuzzy logic, rule based expert systems and neural net technology.After transforming the recorded spectra to line spectra by appropriate background correction a reasoning scheme is applied that takes into account not only the observed spectra, but also the recording conditions and prior spectroscopic information regarding the relative emission probabilities and the usefulness of the different lines for the purpose of element identification. The latter is done on the basis of a previously described scheme to compute conditional a posteriori Bayes probabilities for a mean matrix. These different pieces of information are then assembled into a battery of fuzzy rules. The importance of the rules as well as the importance of the X-ray lines is determined in a training process, similar to the one in a feedforward back-propagation network.To further stabilize the results this network is pruned in a second training cycle. This, however, had little effect on the quality of interpretation.The advantages of this approach to the interpretation of X-ray spectra over older ones are numerous: the system adapts itself to better interpret spectra that are of greater importance to a laboratory as these are better represented in the training set; the fuzzy logic is capable of working with incomplete and uncertain knowledge, and the neural network results based on these fuzzy rules is readily interpretable by the X-ray spectroscopist as every rule can be expressed also in natural language as in any classical rule based system.On leave from Silesian University, Katowice, Poland     

某些子群介于正规与反正规之间的有限群北大核心CSCD

有限群G的子群H称为G的BNA子群,若对任意的x∈G有H^(x)=H或x∈.若有限群G的所有素数阶和4阶循环子群都是G的BNA子群,则称G为CBNA群.本文主要刻画CBNA群的结构,并且给出所有真子群都是CBNA群的完全分类.     

Tractability frontiers in probabilistic team semantics and existential second-order logic over the reals

Probabilistic team semantics is a framework for logical analysis of probabilistic dependencies. Our focus is on the axiomatizability, complexity, and expressivity of probabilistic inclusion logic and its extensions. We identify a natural fragment of existential second-order logic with additive real arithmetic that captures exactly the expressivity of probabilistic inclusion logic. We furthermore relate these formalisms to linear programming, and doing so obtain PTIME data complexity for the logics. Moreover, on finite structures, we show that the full existential second-order logic with additive real arithmetic can only express NP properties. Lastly, we present a sound and complete axiomatization for probabilistic inclusion logic at the atomic level.     

On intermediate inquisitive and dependence logics: An algebraic study

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete for all intermediate inquisitive and dependence logics. To this end, we define inquisitive and dependence algebras and we investigate their model-theoretic properties. We then focus on finite, core-generated, well-connected inquisitive and dependence algebras: we show they witness the validity of formulas true in inquisitive algebras, and of formulas true in well-connected dependence algebras. Finally, we obtain representation theorems for finite, core-generated, well-connected, inquisitive and dependence algebras and we prove some results connecting team and algebraic semantics.     

Infinite lexicographic products

We generalize the lexicographic product of first-order structures by presenting a framework for constructions which, in a sense, mimic iterating the lexicographic product infinitely and not necessarily countably many times. We then define dense substructures in infinite products and show that any countable product of countable transitive homogeneous structures has a unique countable dense substructure, up to isomorphism. Furthermore, this dense substructure is transitive, homogeneous and elementarily embeds into the product. This result is then utilized to construct a rigid elementarily indivisible structure.     

The fluted fragment with transitive relations

The fluted fragment is a fragment of first-order logic (without equality) in which, roughly speaking, the order of quantification of variables coincides with the order in which those variables appear as arguments of predicates. It is known that this fragment has the finite model property. We consider extensions of the fluted fragment with various numbers of transitive relations, as well as the equality predicate. In the presence of one transitive relation (together with equality), the finite model property is lost; nevertheless, we show that the satisfiability and finite satisfiability problems for this extension remain decidable. We also show that the corresponding problems in the presence of two transitive relations (with equality) or three transitive relations (without equality) are undecidable, even for the two-variable sub-fragment.