We explore the modal possibility operator and its dual necessity operator in qualitative data analysis , and show that it (quite literally) complements the derivation operator of formal concept analysis; we also propose a new generalisation of the rough set approximation operators. As an example for the applicability of the concepts we investigate the Morse data set which has been frequently st...

The temporal updating of an agent’s beliefs in response to a flow of information is modeled in a simple modal logic that, for every date t, contains a normal belief operator Bt and a non-normal information operator It which is analogous to the ‘only knowing’ operator discussed in the computer science literature. Soundness and completeness of the logic are proved and the relationship between the...

We present results of reanalysis on proton decay in the minimal SU(5) SUSY GUT model. Unlike previous analyses, we take into account a Higgsino dressing diagram of dimension 5 operator with right-handed matter fields (RRRR operator). It is shown that this diagram gives a significant contribution for p → Kντ . Constraints on the colored Higgs mass MC and the sfermion mass mf̃ from SuperKamiokande...

We develop a notion of spatial-behavioral typing suitable to discipline interactions in service-based systems modeled in a distributed object calculus. Our type structure reflects a resource aware model of behavior, where a parallel composition type operator expresses resource independence, a sequential composition type operator expresses implicit synchronization, and a modal operator expresses...

This paper shows how to uniformly associate Lie algebras to the simply-laced Dynkin diagrams excluding E8 by constructing explicit combinatorial models of minuscule representations using only graph-theoretic ideas. This involves defining raising and lowering operators in a space of ideals of certain distributive lattices associated to sequences of vertices of the Dynkin diagram.

Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibili...

Justification logics refine modal logics by replacing the usual necessity operator with a family of justification terms that embody reasons for the necessity of a formula, rather than simply recording the fact of necessity. Many common modal logics have justification counterparts. The connection between a modal logic and its justification counterpart is through a Realization Theorem, which says...

We introduce a new approach to analyze the phase diagram of QCD at finite chemical potential and temperature, test it in the Gross-Neveu model at finite baryon density, and apply it to the study of the chemical potential-temperature phase diagram of QCD with four degenerate flavors of Kogut-Susskind type.

An algebraic model of a kind of modal extension of de Morgan logic is described under the name MDS5 algebra. The main properties of this algebra can be summarized as follows: (1) it is based on a de Morgan lattice, rather than a Boolean algebra; (2) a modal necessity operator that satisfies the axioms N , K, T , and 5 (and as a consequence also B and 4) of modal logic is introduced; it allows o...

A lattice diagram is a finite list L = of lattice cells. The corresponding lattice diagram determinant is ∆ L (X; Y) = det x pj i y qj i. The space M L is the space spanned by all partial derivatives of ∆ L (X; Y). We describe here how a Schur function partial derivative operator acts on lattice diagrams with distinct cells in the positive quadrant.