Truth set algebra: a new way to prove undefinability
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.
cs.AI, cs.LO, math.LO
Knight, Sophia
b84253fe-7a36-4574-8c7a-481b9865150a
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Shi, Qi
58260d72-7f73-443f-a47a-99577e6b963e
Suntharraj, Vigasan
ab2711ee-da49-41f6-9ae5-5741a6c70f6e
8 August 2022
Knight, Sophia
b84253fe-7a36-4574-8c7a-481b9865150a
Naumov, Pavel
8b6c40fb-b199-44d5-a8e2-0ebd021566b0
Shi, Qi
58260d72-7f73-443f-a47a-99577e6b963e
Suntharraj, Vigasan
ab2711ee-da49-41f6-9ae5-5741a6c70f6e
[Unknown type: UNSPECIFIED]
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.
Text
2208.04422v2
- Author's Original
More information
Published date: 8 August 2022
Keywords:
cs.AI, cs.LO, math.LO
Identifiers
Local EPrints ID: 483759
URI: http://eprints.soton.ac.uk/id/eprint/483759
PURE UUID: 34d3b68c-2bd7-4785-bbc4-ea28122f253b
Catalogue record
Date deposited: 03 Nov 2023 18:32
Last modified: 17 Mar 2024 04:13
Export record
Altmetrics
Contributors
Author:
Sophia Knight
Author:
Pavel Naumov
Author:
Qi Shi
Author:
Vigasan Suntharraj
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics