Spin-charge mixing effects on resonant tunneling in a polarized Luttinger Liquid

We investigate spin-charge mixing effect on resonant tunneling in spin-polarized Tomonaga-Luttinger liquid with double impurities. The mixing arises from Fermi velocity difference between two spin species due to Zeeman effect. Zero bias conductance is calculated as a function of gate voltage $V_{\rm g}$, gate magnetic field $B_{\rm g}$, temperature and magnetic field applied to the system. Mixing effect is shown to cause rotation of the lattice pattern of the conductance peaks in $(V_{\rm g},B_{\rm g})$ plane, which can be observed in experiments. At low temperatures, the contour shapes are classified into three types, reflecting the fact that effective barrier potential is renormalized towards ``perfect reflection'', ``perfect transmission'' and magnetic field induced ``spin-filtering'', respectively.Comment: 10 pages, 4 figures, Sec.I and references largely changed, results for a strong barrier limit added in a new section Sec.I

Bi-Classical Connexive Logic and its Modal Extension: Cut-elimination, completeness and duality

In this study, a new paraconsistent four-valued logic called bi-classical connexive logic (BCC) is introduced as a Gentzen-type sequent calculus. Cut-elimination and completeness theorems for BCC are proved, and it is shown to be decidable. Duality property for BCC is demonstrated as its characteristic property. This property does not hold for typical paraconsistent logics with an implication connective. The same results as those for BCC are also obtained for MBCC, a modal extension of BCC

相互作用する1次元電子系の相転移と量子輸送に関する理論

制度:新 ; 文部省報告番号:甲2404号 ; 学位の種類:博士(理学) ; 授与年月日:2007/3/15 ; 早大学位記番号:新449

A Linear Logic Based Approach to Timed Petri Nets

1.1 Relationship between Petri net and linear logic Petri nets were first introduced by Petri in his seminal Ph.D. thesis, and both the theory and the applications of his model have flourished in concurrency theory (Reisig & Rozenberg, 1998a; Reisig & Rozenberg, 1998b)

Extended full computation-tree logics for paraconsistent model checking

It is known that the full computation-tree logic CTL * is an important base logic for model checking. The bisimulation theorem for CTL* is known to be useful for abstraction in model checking. In this paper, the bisimulation theorems for two paraconsistent four-valued extensions 4CTL* and 4LCTL* of CTL* are shown, and a translation from 4CTL* into CTL* is presented. By using 4CTL* and 4LCTL*, inconsistency-tolerant and spatiotemporal reasoning can be expressed as a model checking framework