On temporal logic S4Dbr

In this paper, we study the temporal logic S4Dbr with two temporal operators “always” and “eventually.” An equivalent sequent calculus is presented with formulae as modal clauses or modal clauses starting with operator “always.” An upper bound of deduction tree is given for propositional logic. A theorem prover for propositional logic is written in SWI-Prolog. Published in LietuvosMatematikos Rinkinys, Vol. 46, No. 2, pp. 203–214, April–June, 2006.     

Solutions of the Vlasov equation in Lagrange coordinates

We show that the method of “finite-size” particles is a discrete model of the Vlasov equation but in a different (effective) interaction potential. We calculate the effective potential explicitly in the most interesting case of the Coulomb interaction. We find the equations of motion of particles of “finite size” for the Gaussian form factor. __________ Translated from Teoreticheskaya i Matematicheskaya Fizika, Vol. 151, No. 1, pp. 138–148, April, 2007.     

Isomorphisms of fiber spaces over Teichmüller spaces

We will be mainly concerned with some important fiber spaces over Teichmüller spaces, including the Bers fiber space and Teichmüller curve, establishing an isomorphism theorem between “punctured” Teichmüller curves and determining the biholomorphic isomorphisms of these fiber spaces.     

Neaw β-delayed proton precursor121Ce near the proton drip-line

Unknown β-delayed proton precursor¹²¹Ce was produced via the reaction of⁹²Mo(³²S, 3n), and identified by an He-jet fast tape transport system with “P-γ” coincidence measurements. The half-life of¹²¹Ce decay was determined to be (1.1 ± 0. l)s. Its energy spectrum of β-delayed protons was measured and the β-delayed proton branching ratio for¹²¹decay was roughly estimated to be ∼ 1 %. After β-delayed proton decay of the precursors¹¹⁹Ba,¹²¹Ba and¹²²La, some of γ-transitions from low-lying states to the ground states in their “daughters” were observed for the first time. Project supported by the National Natural Science Foundation of China (Grant No. 19475055) and the Chinese Academy of Sciences.     

Sequent calculi for branching time temporal logics of knowledge and beliefwith awareness: Completeness and decidability

In this paper, we consider branching time temporal logic CT L with epistemic modalities for knowledge (belief) and with awareness operators. These logics involve the discrete-time linear temporal logic operators “next” and “until” with the branching temporal logic operator “on all paths”. In addition, the temporal logic of knowledge (belief) contains an indexed set of unary modal operators “agent i knows” (“agent i believes”). In a language of these logics, there are awareness operators. For these logics, we present sequent calculi with a restricted cut rule. Thus, we get proof systems where proof-search becomes decidable. The soundness and completeness for these calculi are proved. Published in Lietuvos Matematikos Rinkinys, Vol. 47, No. 3, pp. 328–340, July–September, 2007.     

3–global attractivity of the zero solution of the “food limited” type functional differential equation

We obtain 3/2-condition for global attractivity to occur in the “food-limited” type functional differential equationx′ (t) + [1 +x(t)][1 −cx(t)]F(t, x(·)) = 0. These results contain and improve all corresponding theorems in literature.     

A confidence voting process for ranking problems based on support vector machines

In this paper, we deal with ranking problems arising from various data mining applications where the major task is to train a rank-prediction model to assign every instance a rank. We first discuss the merits and potential disadvantages of two existing popular approaches for ranking problems: the ‘Max-Wins’ voting process based on multi-class support vector machines (SVMs) and the model based on multi-criteria decision making. We then propose a confidence voting process for ranking problems based on SVMs, which can be viewed as a combination of the SVM approach and the multi-criteria decision making model. Promising numerical experiments based on the new model are reported. The research of the last author was supported by the grant #R.PG 0048923 of NESERC, the MITACS project “New Interior Point Methods and Software for Convex Conic-Linear Optimization and Their Application to Solve VLSI Circuit Layout Problems” and the Canada Researcher Chair Program.     

Algebraic axiomatization of tense intuitionistic logic

We introduce two unary operators G and H on a relatively pseudocomplemented lattice which form an algebraic axiomatization of the tense quantifiers “it is always going to be the case that” and “it has always been the case that”. Their axiomatization is an extended version for the classical logic and it is in accordance with these operators on many-valued Łukasiewicz logic. Finally, we get a general construction of these tense operators on complete relatively pseudocomplemented lattice which is a power lattice via the so-called frame.     

On the Parameterized OWA Operators for Fuzzy MCDM Based on Vague Set Theory

The family of Ordered Weighted Averaging (OWA) operators, as introduced by Yager, appears to be very useful in multi-criteria decision-making (MCDM). In this paper, we extend a family of parameterized OWA operators to fuzzy MCDM based on vague set theory, where the characteristics of the alternatives are presented by vague sets. These families are specified by a few parameters to aggregate vague values instead of the intersection and union operators proposed by Chen. The proposed method provides a “soft” and expansive way to help the decision maker to make his decisions. Examples are shown to illustrate the procedure of the proposed method at the end of this paper.     

β-delayed proton decay of89Ru

⁸⁹Ru was synthesized in the reaction of⁵⁸Ni (³⁶Ar, 2p3n) on the basis of a “p-y” coincidence measurement by using a He-jet tape transport system, and its β-delayed proton emission with a half-life of (1.1 ± 0.2) s was investigated. The β-delayed proton spectrum of⁸⁹Ru populating the lowlying states in⁸⁸Mo was obtained, and the final state proton branching ratios to the low-lying 2⁺ and 4⁺ states in⁸⁸Mo were estimated to be 100:6. Based on the statistical model calculations, the ground state spin of⁸⁹Ru was preliminarily assigned to be 5/2⁺ or 7/2^±, and the mass excess of⁸⁹Ru was deduced to be -59.5 MeV.     

Dynamic effect algebras

We introduce the so-called tense operators in lattice effect algebras. Tense operators express the quantifiers “it is always going to be the case that” and “it has always been the case that” and hence enable us to express the dimension of time in the logic of quantum mechanics. We present an axiomatization of these tense operators and prove that every lattice effect algebra whose underlying lattice is complete can be equipped with tense operators. Such an effect algebra is called dynamic since it reflects changes of quantum events from past to future.     

How canonical is the canonical model? A comment on Aumann's interactive epistemology

Aumann (1989) argued that the natural partitions on the space of all maximally consistent sets of formulas in multi-player S5 logic are necessarily “commonly known” by the players. We show, however, that there are many other sets of partitions on this space that conform with the formulas that build the states – as many as there are subsets of the continuum! Thus, assuming a set of partitions on this space is “common knowledge” is an informal but meaningful meta-assumption.     

A geometric study of duality gaps, with applications

Lagrangian relaxation is often an efficient tool to solve (large-scale) optimization problems, even nonconvex. However it introduces a duality gap, which should be small for the method to be really efficient. Here we make a geometric study of the duality gap. Given a nonconvex problem, we formulate in a first part a convex problem having the same dual. This formulation involves a convexification in the product of the three spaces containing respectively the variables, the objective and the constraints. We apply our results to several relaxation schemes, especially one called “Lagrangean decomposition” in the combinatorial-optimization community, or “operator splitting” elsewhere. We also study a specific application, highly nonlinear: the unit-commitment problem. Received: June 1997 / Accepted: December 2000?Published online April 12, 2001     

On the infinite-valued Łukasiewicz logic that preserves degrees of truth

Łukasiewicz’s infinite-valued logic is commonly defined as the set of formulas that take the value 1 under all evaluations in the Łukasiewicz algebra on the unit real interval. In the literature a deductive system axiomatized in a Hilbert style was associated to it, and was later shown to be semantically defined from Łukasiewicz algebra by using a “truth-preserving” scheme. This deductive system is algebraizable, non-selfextensional and does not satisfy the deduction theorem. In addition, there exists no Gentzen calculus fully adequate for it. Another presentation of the same deductive system can be obtained from a substructural Gentzen calculus. In this paper we use the framework of abstract algebraic logic to study a different deductive system which uses the aforementioned algebra under a scheme of “preservation of degrees of truth”. We characterize the resulting deductive system in a natural way by using the lattice filters of Wajsberg algebras, and also by using a structural Gentzen calculus, which is shown to be fully adequate for it. This logic is an interesting example for the general theory: it is selfextensional, non-protoalgebraic, and satisfies a “graded” deduction theorem. Moreover, the Gentzen system is algebraizable. The first deductive system mentioned turns out to be the extension of the second by the rule of Modus Ponens.While writing this paper, the authors were partially supported by grants MTM2004-03101 and TIN2004-07933-C03-02 of the Spanish Ministry of Education and Science, including FEDER funds of the European Union.     

Weakly Implicative (Fuzzy) Logics I: Basic Properties

This paper presents two classes of propositional logics (understood as a consequence relation). First we generalize the well-known class of implicative logics of Rasiowa and introduce the class of weakly implicative logics. This class is broad enough to contain many “usual” logics, yet easily manageable with nice logical properties. Then we introduce its subclass–the class of weakly implicative fuzzy logics. It contains the majority of logics studied in the literature under the name fuzzy logic. We present many general theorems for both classes, demonstrating their usefulness and importance.The work was supported by grant A100300503 of the Grant Agency of the Academy of Sciences of the Czech Republic and by Institutional Research Plan AVOZ10300504.     

Distinguishing non-standard natural numbers in a set theory within Łukasiewicz logic

In , a set theory with the comprehension principle within Łukasiewicz infinite-valued predicate logic, we prove that a statement which can be interpreted as “there is an infinite descending sequence of initial segments of ω” is truth value 1 in any model of , and we prove an analogy of Hájek’s theorem with a very simple procedure.      

Abelian Logic and the Logics of Pointed Lattice-Ordered Varieties

We consider the class of pointed varieties of algebras having a lattice term reduct and we show that each such variety gives rise in a natural way, and according to a regular pattern, to at least three interesting logics. Although the mentioned class includes several logically and algebraically significant examples (e.g. Boolean algebras, MV algebras, Boolean algebras with operators, residuated lattices and their subvarieties, algebras from quantum logic or from depth relevant logic), we consider here in greater detail Abelian ℓ-groups, where such logics respectively correspond to: i) Meyer and Slaney’s Abelian logic [31]; ii) Galli et al.’s logic of equilibrium [21]; iii) a new logic of “preservation of truth degrees”. This paper was written while the second author was a Visiting Professor in the Department of Education at the University of Cagliari. The facilities and assistance provided by the University and by the Department are gratefully acknowledged.     

An Answer to S. Simons’ Question on the Maximal Monotonicity of the Sum of a Maximal Monotone Linear Operator and a Normal Cone Operator

The question whether or not the sum of two maximal monotone operators is maximal monotone under Rockafellar’s constraint qualification—that is, whether or not “the sum theorem” is true—is the most famous open problem in Monotone Operator Theory. In his 2008 monograph “From Hahn-Banach to Monotonicity”, Stephen Simons asked whether or not the sum theorem holds for the special case of a maximal monotone linear operator and a normal cone operator of a closed convex set provided that the interior of the set makes a nonempty intersection with the domain of the linear operator. In this note, we provide an affirmative answer to Simons’ question. In fact, we show that the sum theorem is true for a maximal monotone linear relation and a normal cone operator. The proof relies on Rockafellar’s formula for the Fenchel conjugate of the sum as well as some results featuring the Fitzpatrick function.      

Boundary value problems with continuous and special gluing conditions for parabolic-hyperbolic type equations

In the present paper we study the unique solvability of two non-local boundary value problems with continuous and special gluing conditions for parabolic-hyperbolic type equations. The uniqueness of the solutions of the considered problems are proven by the “abc” method. Existence theorems for the solutions of these problems are proven by the method of integral equations. The obtained results can be used for studying local and non-local boundary-value problems for mixed-hyperbolic type equations with two and three lines of changing type.      

The Geometry of Standard Deontic Logic

Whereas geometrical oppositions (logical squares and hexagons) have been so far investigated in many fields of modal logic (both abstract and applied), the oppositional geometrical side of “deontic logic” (the logic of “obligatory”, “forbidden”, “permitted”, . . .) has rather been neglected. Besides the classical “deontic square” (the deontic counterpart of Aristotle’s “logical square”), some interesting attempts have nevertheless been made to deepen the geometrical investigation of the deontic oppositions: Kalinowski (La logique des normes, PUF, Paris, 1972) has proposed a “deontic hexagon” as being the geometrical representation of standard deontic logic, whereas Joerden (jointly with Hruschka, in Archiv für Rechtsund Sozialphilosophie 73:1, 1987), McNamara (Mind 105:419, 1996) and Wessels (Die gute Samariterin. Zur Struktur der Supererogation, Walter de Gruyter, Berlin, 2002) have proposed some new “deontic polygons” for dealing with conservative extensions of standard deontic logic internalising the concept of “supererogation”. Since 2004 a new formal science of the geometrical oppositions inside logic has appeared, that is “n-opposition theory”, or “NOT”, which relies on the notion of “logical bi-simplex of dimension m” (m = n − 1). This theory has received a complete mathematical foundation in 2008, and since then several extensions. In this paper, by using it, we show that in standard deontic logic there are in fact many more oppositional deontic figures than Kalinowski’s unique “hexagon of norms” (more ones, and more complex ones, geometrically speaking: “deontic squares”, “deontic hexagons”, “deontic cubes”, . . ., “deontic tetraicosahedra”, . . .): the real geometry of the oppositions between deontic modalities is composed by the aforementioned structures (squares, hexagons, cubes, . . ., tetraicosahedra and hyper-tetraicosahedra), whose complete mathematical closure happens in fact to be a “deontic 5-dimensional hyper-tetraicosahedron” (an oppositional very regular solid).