This paper concerns the question of automatic reasoning for turnstyl. "" modal logical consequence in propositional modal logics K, K4, D, D4, T, S4. We have presented a method, called strong modal resolution, for proving turnstyle "" modal logical consequence, and proved correctness and completeness of the strong modal resolution.
This paper aims at a "boundary" result more general than both Segerberg's theorem and Nagle's theorem: all modal logics of finite depth have the finite model property, no matter they are transitive or not.
Analysis and numerical circuit-design modeling of the speed of current-mode logic devices, as well as complementary push-pull inverters built on scaled 0.2- to 0.1-μm transistor structures with the thin heavily doped base, were performed.
Several hundred functional and safety requirements for the mode logic of a typical flight guidance system were captured as natural language "shall" statements.
A formal model of the mode logic was written in the RSML-e language and translated into the NuSMV model checker and the PVS theorem prover using translators developed as part of the project.
A Wired-AND Current-Mode Logic Circuit Technique in CMOS for Low-Voltage, High-Speed and Mixed-Signal VLSIC
A wired-AND current-mode logic (WCML) circuit techniquein CMOS technology for low-voltage and high-speed VLSI circuitsis proposed, and a WCML cell library is developed using standard0.8 micron CMOS process.
The general problem can be formulated as follows: from two modal logics describing certain classes of Kripke modal lattices construct a logic describing all products of Kripke lattices from these classes.