If p and q are statements then ‘p not and q’, denoted by p ↑ q, is true unless both p and q are true. Since ‘not and’ is cumbersome language, this is often referred to as ‘nand’ in logic. The truth table is as follows:
| 单词 | not and |
| 释义 |
|
| 随便看 |
科学参考收录了60776条科技类词条，基本涵盖了常见科技类参考文献及英语词汇的翻译，是科学学习和研究的有利工具。