Truth Set Algebra: A New Way to Prove Undefinability
classification
💻 cs.AI
cs.LOmath.LO
keywords
techniqueundefinabilityalgebraarticleconnectivesexamplesexistingillustrates
read the original 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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.