Multiple Polarization Encoding for Gray Image Encryption Based on Liquid Crystal Exclusive OR Logic

This work proposes and demonstrates the feasibility of gray image encryption using multiple polarization encoding, in which the cascaded twisted nematic liquid crystal devices sandwiched between a crossed polarizer pair are used to implement exclusive OR (XOR) logical encryption and decryption. The polarization encoding scheme provides a multichannel XOR logic operation to secure bit-plane images derived from a gray image, according to the adiabatic following properties of twisted nematic liquid crystal devices. Experimental data reveal that the multiple polarization encoding schemes for gray image encryption and decryption are performed with acceptable image quality by selecting appropriate polarization orientation and modulation conditions. Both analytic and experimental results are presented and discussed.     

A New View on Fuzzy Hypermodules

We describe the relationship between the fuzzy sets and the algebraic hyperstructures. In fact, this paper is a continuation of the ideas presented by Davvaz in （Fuzzy Sets Syst., 117： 477- 484, 2001） and Bhakat and Das in （Fuzzy Sets Syst., 80： 359-368, 1996）. The concept of the quasicoincidence of a fuzzy interval value with an interval-valued fuzzy set is introduced and this is a natural generalization of the quasi-coincidence of a fuzzy point in fuzzy sets. By using this new idea, the concept of interval-valued （α,β）-fuzzy sub-hypermodules of a hypermodule is defined. This newly defined interval-valued （α,β）-fuzzy sub-hypermodule is a We shall study such fuzzy sub-hypermodules and sub-hypermodules of a hypermodule. generalization of the usual fuzzy sub-hypermodule. consider the implication-based interval-valued fuzzy     

Interpreting Observables in a Quantum World from the Categorial Standpoint

We develop a relativistic perspective on structures of quantum observables, in terms of localization systems of Boolean coordinatizing charts. This perspective implies that the quantum world is comprehended via Boolean reference frames for measurement of observables, pasted together along their overlaps. The scheme is formalized categorically, as an instance of the adjunction concept. The latter is used as a framework for the specification of a categorical equivalence signifying an invariance in the translational code of communication between Boolean localizing contexts and quantum systems. Aspects of the scheme semantics are discussed in relation to logic. The interpretation of coordinatizing localization systems, as structure sheaves, provides the basis for the development of an algebraic differential geometric machinery suited to the quantum regime.     

Sequent calculi for propositional star-free likelihood logic

We consider classical, multisuccedent intuitionistic, and intuitionistic sequent calculi for propositional likelihood logic. We prove the admissibility of structural rules and cut rule, invertibility of rules, correctness of the calculi, and completeness of the classical calculus with respect to given semantics.__________Published in Lietuvos Matematikos Rinkinys, Vol. 45, No. 1, pp. 3–21, January–March, 2005.     

Tensor Products of Quantum Structures and Their Applications in Quantum Measurements

Tensor products of quantum logics and effect algebras with some known problems are reviewed. It is noticed that although tensor products of effect algebras having at least one state exist, in the category of complex Hilbert space effect algebras similar problems as with tensor products of projection lattices occur. Nevertheless, if one of the two coupled physical systems is classical, tensor product exists and can be considered as a Boolean power. Some applications of tensor products (in the form of Boolean powers) to quantum measurements are reviewed.     

MTL代数的特征定理

对于逻辑系统代数结构的研究,是一个十分重要的研究课题.近期提出的BL代数,R_0代数,MTL代数就是这个方向具有代表性的研究成果.本文讨论MTL代数的性质与结构,给出这种代数的几个特征定理,澄清这种代数与其它代数结构的关系.鉴于单位区间中由左连续t-范数诱导的剩余蕴涵与MTL代数的紧密联系,本文还考察了这种模糊蕴涵的特征性质.     

Reflection of Long Game Formulas

We study game formulas the truth of which is determined by a semantical game of uncountable length. The main theme is the study of principles stating reflection of these formulas in various admissible sets. This investigation leads to two weak forms of strict-II¹₁ reflection (or ∑₁-compactness). We show that admissible sets such as H(ω₂) and L_ω2 which fail to have strict-II¹₁ reflection, may or may not, depending on set-theoretic hypotheses satisfy one or both of these weaker forms. Mathematics Subject Classification : 03C70, 03C75.     

数学分析中的一题多解问题

通过两个积分 (一个是不定积分 ,一个是定积分 )及一个极限 ,说明如何灵活使用积分法解决积分问题 ,方法灵活、巧妙 ,适用范围广 .     

Twin Paradox and the Logical Foundation of Relativity Theory

We study the foundation of space-time theory in the framework of first-order logic (FOL). Since the foundation of mathematics has been successfully carried through (via set theory) in FOL, it is not entirely impossible to do the same for space-time theory (or relativity). First we recall a simple and streamlined FOL-axiomatization Specrel of special relativity from the literature. Specrel is complete with respect to questions about inertial motion. Then we ask ourselves whether we can prove the usual relativistic properties of accelerated motion (e.g., clocks in acceleration) in Specrel. As it turns out, this is practically equivalent to asking whether Specrel is strong enough to “handle” (or treat) accelerated observers. We show that there is a mathematical principle called induction (IND) coming from real analysis which needs to be added to Specrel in order to handle situations involving relativistic acceleration. We present an extended version AccRel of Specrel which is strong enough to handle accelerated motion, in particular, accelerated observers. Among others, we show that~the Twin Paradox becomes provable in AccRel, but it is not provable without IND.     

Decision methods for linearly ordered Heyting algebras

The decision problem for positively quantified formulae in the theory of linearly ordered Heyting algebras is known, as a special case of work of Kreisel, to be solvable; a simple solution is here presented, inspired by related ideas in Gödel-Dummett logic.