On the quantifier complexity of Δ<Subscript> n+1</Subscript> (T)– induction

In this paper we continue the study of the theories I _n+1 (T), initiated in [7]. We focus on the quantifier complexity of these fragments and theirs (non)finite axiomatization. A characterization is obtained for the class of theories such that I _n+1 (T) is _n+2 –axiomatizable. In particular, I _n+1 (I _n+1 ) gives an axiomatization of Th _n+2 (I _n+1 ) and is not finitely axiomatizable. This fact relates the fragment I _n+1 (I _n+1 ) to induction rule for _n+1 –formulas. Our arguments, involving a construction due to R. Kaye (see [9]), provide proofs of Parsons conservativeness theorem (see [16]) and (a weak version) of a result of L.D. Beklemishev on unnested applications of induction rules for _n+2 and _n+1 formulas (see [2]).Research partially supported by grant PB96–1345 (Spanish Goverment)Mathematics Subject Classification (2000): 03F30, 03H15     

Monadic <Emphasis Type="Italic">GMV</Emphasis>-algebras

Monadic MV-algebras are an algebraic model of the predicate calculus of the Łukasiewicz infinite valued logic in which only a single individual variable occurs. GMV-algebras are a non-commutative generalization of MV-algebras and are an algebraic counterpart of the non-commutative Łukasiewicz infinite valued logic. We introduce monadic GMV-algebras and describe their connections to certain couples of GMV-algebras and to left adjoint mappings of canonical embeddings of GMV-algebras. Furthermore, functional MGMV-algebras are studied and polyadic GMV-algebras are introduced and discussed. The first author was supported by the Council of Czech Government, MSM 6198959214.     

An Application of Logic to Combinatorial Geometry: How Many Tetrahedra are Equidecomposable with a Cube?

It is known (see Rapp [9]) that elementary geometry with the additional quantifier “there exist uncountably many” is decidable. We show that this decidability helps in solving the following problem from combinatorial geometry: does there exist an uncountable family of pairwise non-congruent tetrahedra that are n-equidecomposable with a cube? Mathematics Subject Classification: 03B25, 03C80, 51M04, 52B05, 52B10.     

Derivation of conditions of complete contact for a beam on a tensionless Winkler elastic foundation with Mathematica

The classical problem of a beam on a tensionless Winkler elastic foundation is reconsidered for the derivation of the conditions of complete contact between the beam and the foundation. This is achieved through the application of modern quantifier elimination software included in the computer algebra system Mathematica together with Taylor–Maclaurin series approximations to the deflection of the beam. Four particular beam problems have been considered in detail and the related QFFs (quantifier-free formulae) have been obtained for several values of the order in the series approximations. Additional approximation possibilities have also been investigated with an emphasis put on the use of the Galerkin method based on weighted residuals. The present results seem to constitute one more interesting application of modern quantifier elimination algorithms and the related software (here in Mathematica) to applied and engineering mechanics.     

素数阶群理论的量词消去及复杂性

本文中我们将研究语言,上素数阶群理论Ｔ的量词消去及相应的复杂性．我们证明理论Ｔ有量词消去性质,并利用该性质给出理论Ｔ判定问题的一个复杂性上界．     

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.     

Compatible weighting method with rank order centroid: Maximum entropy ordered weighted averaging approach

In a situation where imprecise attribute weights such as a rank order are captured, various approximate weighting methods have been proposed to aid multiattribute decision analysis. Among others, it is well known that the rank order centroid (ROC) weights result in the highest performance in terms of the identification of the best alternative under the ranked attribute weights. In this paper, we aim to reinterpret the meaning of the ROC weights and to develop a compatible weighting method that is based on other well-established academic disciplines. The ordered weighted averaging (OWA) method is a nonlinear aggregation method in that the weights are associated with the objects reordered according to their magnitudes in the aggregation process. Some interesting semantics can be attached to the approximate weights in view of the measure developed in the OWA method. Furthermore, the weights generated by the maximum entropy method show equally compatible performance with the ROC weights under some condition, which is demonstrated by theoretical and simulation analysis.     

Quantifier elimination on some pseudo-algebraically closed valued fields

In this article, some theories of pseudo-algebraically closed non-trivially valued fields are shown to admit quantifier elimination in the language obtained by adjoining to the language of rings the function symbols for splitting coefficients, the function symbols for relative p-coordinate functions, and the division predicate for a valuation.     

Linguistic quantifiers based on Choquet integrals

The introduction of linguistic quantifiers has provided an important tool to model a large number of issues in intelligent systems. Ying [M.S. Ying, Linguistic quantifiers modeled by Sugeno integrals, Artificial Intelligence 170 (2006) 581–606] recently introduced a new framework for modeling quantifiers in natural languages in which each linguistic quantifier is represented by a family of fuzzy measures, and the truth value of a quantified proposition is evaluated by using Sugeno’s integral. Representing linguistic quantifiers by fuzzy measures, this paper evaluates linguistic quantified propositions by the Choquet integral. Some elegant logical properties of linguistic quantifiers are derived within this approach, including a prenex normal form theorem stronger than that in Ying’s model. In addition, our Choquet integral approach to the evaluation of quantified statements is compared with others, in particular with Ying’s Sugeno integral approach.