scholarly journals The Whole Truth about Partial Truth Tables

2020 ◽  
Vol 10 (02) ◽  
pp. 192-219
Author(s):  
Keith Burgess-Jackson
Keyword(s):  
1997 ◽  
Vol 31 (4) ◽  
pp. 593-608 ◽  
Author(s):  
Gerald J. Massey

Briefly, the following things are done in this paper. An informal exposition of the significance of partial truth tables in modal logic is presented. The intuitive concept of a truth tabular sentence connective is examined and made precise. From among a vast assortment of truth tabular connectives, the semantically well-behaved ones (called regular connectives) are singled out for close investigation. The familiar concept of functional completeness is generalized to all sets of regular connectives, and the functional completeness (or incompleteness) of selected sets of connectives is established. Some modal analogues of Sheffer's stroke are presented, i.e., single connectives are introduced which serve to define not only the truth functional connectives but all the regular modal connectives as well. The notion of duality is extended to all regular connectives and a general duality theorem is proved. Lastly, simplified proofs are given of several metatheorems about the system S5.


Author(s):  
Curtis G. Northcutt

The recent proliferation of embedded cyber components in modern physical systems [1] has generated a variety of new security risks which threaten not only cyberspace, but our physical environment as well. Whereas earlier security threats resided primarily in cyberspace, the increasing marriage of digital technology with mechanical systems in cyber-physical systems (CPS), suggests the need for more advanced generalized CPS security measures. To address this problem, in this paper we consider the first step toward an improved security model: detecting the security attack. Using logical truth tables, we have developed a generalized algorithm for intrusion detection in CPS for systems which can be defined over discrete set of valued states. Additionally, a robustness algorithm is given which determines the level of security of a discrete-valued CPS against varying combinations of multiple signal alterations. These algorithms, when coupled with encryption keys which disallow multiple signal alteration, provide for a generalized security methodology for both cyber-security and cyber-physical systems.


1969 ◽  
Vol 69 (6) ◽  
pp. 553-560
Author(s):  
Lee E. Boyer
Keyword(s):  

1988 ◽  
Vol 29 (2) ◽  
pp. 42-47
Author(s):  
J K Reddy
Keyword(s):  

Author(s):  
Sheh-Yi Sheu ◽  
Hua-Yi Hsu ◽  
Dah-Yen Yang

This Supporting Information includes the extended description of the superposition state of the asymmetric double-well system in vacuum system and in solution, truth tables for the residue pairs and their corresponding quantum logic gates, and figures for the double well potential energy surfaces and transmission spectra of the residue pairs. Corresponding Authors Email: [email protected] and [email protected]


1998 ◽  
Vol 6 (2) ◽  
pp. 295-303 ◽  
Author(s):  
I.B. Turksen ◽  
A. Kandel ◽  
Yan-Qing Zhang

Sign in / Sign up

Export Citation Format

Share Document