Truth Set Algebra: A New Way to Prove Undefinability
Artificial Intelligence
2023-07-04 v2 Logic in Computer Science
Logic
Abstract
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.
Cite
@article{arxiv.2208.04422,
title = {Truth Set Algebra: A New Way to Prove Undefinability},
author = {Sophia Knight and Pavel Naumov and Qi Shi and Vigasan Suntharraj},
journal= {arXiv preprint arXiv:2208.04422},
year = {2023}
}