Regular Subgraphs in Graphs and Rooted Graphs and Definability in Monadic Second - Order Logic

We investigate the definability in monadic ∑₁¹ and monadic Π₁¹ of the problems REG_k, of whether there is a regular subgraph of degree k in some given graph, and XREG_k, of whether, for a given rooted graph, there is a regular subgraph of degree k in which the root has degree k, and their restrictions to graphs in which every vertex has degree at most k, namely REG_k^k and XREG_k^k, respectively, for k ≥ 2 (all our graphs are undirected). Our motivation partly stems from the fact (which we prove here) that REG_k^k and XREG_k^k are logspace equivalent to CONN and REACH, respectively, for k ≥ 3, where CONN is the problem of whether a given graph is connected and REACH is the problem of whether a given graph has a path joining two given vertices. We use monadic first - order reductions, monadic ∑₁¹ games and a recent technique due to Fagin, Stockmeyer and Vardi to almost completely classify whether these problems are definable in monadic ∑₁¹ and monadic Π₁¹, and we compare the definability of these problems (in monadic ∑₁¹ and monadic Π₁¹ with their computational complexity (which varies from solvable using logspace to NP - complete).     

About membership functions estimation

A logical approach to fuzzy sets method originated by Giles is developed. The infinitely many-valued logic t_ω is taken as basic. We accept, it is correct to use the strong conjunction by the logical analysis of the summation of fuzzy items. Under some broad conditions it is proved. that the sum of many fuzzy variables is a variable whose membership function is approximately equal to $\text{?(x) =}\text{max}\text{{1 ?}\text{1}\text{2}\text{c(x ? α)}{}^2\text{, 0}}$, where a and c are some constant parameters. A method of estimation of the unknown parameters is developed in a general case. The proposed fuzzy method coincides with the method of maximum likelihood if used in problems of classical mathematical statistics.     

On the polynomial-space completeness of intuitionistic propositional logic

We present an alternative, purely semantical and relatively simple, proof of the Statman's result that both intuitionistic propositional logic and its implicational fragment are PSPACE-complete.This paper was supported by grant 401/01/0218 of the Grant Agency of the Czech Republic. % Mathematics Subject Classification (2000):     

电流控阈技术及三值电流型 CMOS施密特电路

本文以开关信号理论为指导 ,对电流型 CM OS电路中如何实现阈值控制进行研究. 建立实现阈 值控制电路的电流传输开关运算 ,并用于指导电流型 CMOS施密特电路的开关级设计 .用 PSPICE程序 模拟证明了所设计的电路具有理想的施密特电路特性.     

Galois averages

In this paper, we introduce a notion of “Galois average” which allows us to give a suitable answer to the question: how can one extend a finite Galois extension E/F by a prime degree extension N/E to get a Galois extension N/F? Here, N/E is not necessarily a Kummer extension.     

电流镜及其在多值I2L电路开关级设计中的应用

运用开关信号理论和有界算术运算理论，对电流镜的多种性质进行了讨论，并系统研究了利用电流镜实现电流信号的各种算术运算，其中倍除运算属于初次提出，最后通过N进制半加电路和N值比较电路等两个设计实例介绍了电流镜技术在I^2L电路开关级设计中的应用。     

多值逻辑与多值数字运算的光学实现

提出利用光学符号代换法则实现POST代数和GALOIS代数两种基本的多值逻辑函数,并给出了Max(x,y)运算、Min(x,y)运算以及数字加法和乘法运算的实验结果。     

Paul阱中共面两离子系统的能量本征态

通过对Paul阱中共面两离子体系的研究，考虑共面两离子在Paul阱中库仑关联，得到了两离子系统Schrdinger方程的精确解；椐方程的精确解，分析了质心能级简并情况，计算了两离子的平衡距离和低能级的几个态函数，设计程序作出了质心径向概率分布图. 关键词： Paul阱 两离子 共面 量子逻辑操作     

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.     

PNIPAM Copolymers Containing Light‐Responsive Chromophores: A Method Toward Molecular Logic Gates

A series of thermo‐responsive PNIPAM copolymers containing different amounts of fulgimide moieties has been synthesized via a polymer analogous reaction of poly(pentafluorophenyl acrylate). All copolymers were designed to exhibit a lower critical solution temperature (LCST) in water, which was only weakly dependent on the amount of incorporated chromophoric fulgimide groups. The copolymers showed a photocyclization of the fulgimide side groups upon irradiation with UV‐light accompanied with a color change. The closed form of the chromophore had a halftime of 136 min for the visible reisomerization and did not affect the LCST of the polymer. This led to the realization of a logic “NOT A” for the fulgimide containing PNIPAM, while a corresponding azobenzene containing PNIPAM resulted in a different logic “A implies B”.