Degrees of logics with Henkin quantifiers in poor vocabularies

We investigate some logics with Henkin quantifiers. For a given logic L, we consider questions of the form: what is the degree of the set of L–tautologies in a poor vocabulary (monadic or empty)? We prove that the set of tautologies of the logic with all Henkin quantifiers in empty vocabulary L* is of degree 0. We show that the same holds also for some weaker logics like L(H) and L(E). We show that each logic of the form L^(k)(Q), with the number of variables restricted to k, is decidable. Nevertheless – following the argument of M. Mostowski from [Mos89] – for each reasonable set theory no concrete algorithm can provably decide L^(k)(Q), for some (Q). We improve also some results related to undecidability and expressibility for logics L(H₄) and L(F₂) of Krynicki and M. Mostowski from [KM92].Mathematics Subject Classification (2000): 03C80, 03D35, 03B25Revised version: 28 August 2003     

无原子布氏代数理论的计算复杂性

研究无原子布氏代数的计算复杂性 .得到了下面的新定理 :定理 1　无原子布氏代数理论Δ具有完全的量词消去法 ,也就是说每一个式子都Δ等价于一个开式子 .定理 2　无原子布氏代数的初等型Γ (x1,… ,xn)是由型内的不含量词的全体开式子所唯一决定 .定理 3　无原子布氏代数的一个长度为 n的语句的判断过程所消耗的 Turing时间和空间都是属于 2 2 cn指数级 .     

A general model of parameterized OWA aggregation with given orness level

The paper proposes a general optimization model with separable strictly convex objective function to obtain the consistent OWA (ordered weighted averaging) operator family. The consistency means that the aggregation value of the operator monotonically changes with the given orness level. Some properties of the problem are discussed with its analytical solution. The model includes the two most commonly used maximum entropy OWA operator and minimum variance OWA operator determination methods as its special cases. The solution equivalence to the general minimax problem is proved. Then, with the conclusion that the RIM (regular increasing monotone quantifier) can be seen as the continuous case of OWA operator with infinite dimension, the paper further proposes a general RIM quantifier determination model, and analytically solves it with the optimal control technique. Some properties of the optimal solution and the solution equivalence to the minimax problem for RIM quantifier are also proved. Comparing with that of the OWA operator problem, the RIM quantifier solutions are usually more simple, intuitive, dimension free and can be connected to the linguistic terms in natural language. With the solutions of these general problems, we not only can use the OWA operator or RIM quantifier to obtain aggregation value that monotonically changes with the orness level for any aggregated set, but also can obtain the parameterized OWA or RIM quantifier families in some specific function forms, which can incorporate the background knowledge or the required characteristic of the aggregation problems.     

Monadic dynamic algebras

The main purpose of this work is to introduce the class of the monadic dynamic algebras (dynamic algebras with one quantifier). Similarly to a theorem of Kozen we establish that every separable monadic dynamic algebra is isomorphic to a monadic (possibly non‐standard) Kripke structure. We also classify the simple (monadic) dynamic algebras. Moreover, in the dynamic duality theory, we analyze the conditions under which a hemimorphism of a dynamic algebra into itself defines a quantifier. (© 2006 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

LP estimates for ?-equation on generalized complex ellipsoids

The estimate of a holomorphic supporting function for the generalized complex ellipsoid in ℂⁿ is given, This domain is not decoupled. By using this estimate, the best possibleL ^p estimates for the ∂-equation and some results of function theory on generalized complex ellipsoids are proved.     

A local normal form theorem for infinitary logic with unary quantifiers

We prove a local normal form theorem of the Gaifman type for the infinitary logic L_∞ω( Q _u)^ω whose formulas involve arbitrary unary quantifiers but finite quantifier rank. We use a local Ehrenfeucht‐Fraïssé type game similar to the one in [9]. A consequence is that every sentence of L_∞ω( Q _u)^ω of quantifier rank n is equivalent to an infinite Boolean combination of sentences of the form (?^≥iy)ψ(y), where ψ(y) has counting quantifiers restricted to the (2^n–1 – 1)‐neighborhood of y. (© 2005 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Lp‐Estimates for the ∂¯b‐equation on a class of infinite type domains

We prove $L^p$ estimates, $1\le p\le \infty$, for solutions to the tangential Cauchy–Riemann equations ${\overline{?}}_{b}u=?$ on a class of infinite type domains $\mathrm{\Omega }?{\mathbb{C}}^2$. The domains under consideration are a class of convex ellipsoids, and we show that if $?$ is a ${\overline{?}}_b$‐closed (0,1)‐form with coefficients in $L^p$, then there exists an explicit solution u satisfying ${\parallel u\parallel }_{L^p(b\mathrm{\Omega })}\le C{\parallel ?\parallel }_{L^p(b\mathrm{\Omega })}$. Moreover, when $p=\infty$, we show that there is a gain in regularity to an f‐Hölder space. We also present two applications. The first is a solution to the $\overline{?}$‐equation, that is, given a smooth (0,1)‐form ? on $b\mathrm{\Omega }$ with an L¹‐boundary value, we can solve the Cauchy–Riemann equation $\overline{?}u=?$ so that ${\parallel u\parallel }_{L^1(b\mathrm{\Omega })}\le C{\parallel ?\parallel }_{L^1(b\mathrm{\Omega })}$ where C is independent of $u$ and ?. The second application is a discussion of the zero sets of holomorphic functions with zero sets of functions in the Nevanlinna class within our class of domains.     

L-fuzzy quantifiers of type determined by fuzzy measures

The aim of this paper is, first, to introduce two new types of fuzzy integrals, namely, -fuzzy integral and →-fuzzy integral. The first integral is based on a fuzzy measure of L-fuzzy sets and the second one on a complementary fuzzy measure of L-fuzzy sets, where L is a complete residuated lattice. Some of their properties and a relation to the fuzzy (Sugeno) integral are investigated. Second, using these integrals, two classes of monadic L-fuzzy quantifiers of type 1 are defined. These L-fuzzy quantifiers can be used for modeling the semantics of natural language quantifiers like “all”, “some”, “many”, “none”, “at most half”, etc. Several semantic properties of these L-fuzzy quantifiers are studied.