论文标题
真相集代数：证明不确定性的新方法
Truth Set Algebra: A New Way to Prove Undefinability
论文作者
论文摘要
本文提出了一种新技术，用于证明彼此之间的逻辑连接词的不可限制性，并用几个示例说明了该技术。某些获得的结果是现有定理的新证明，而另一些是这项工作的原始证明。
The article proposes a new technique for proving the undefinability of logical connectives through each other and illustrates the technique with several examples. Some of the obtained results are new proofs of the existing theorems, others are original to this work.
