The authors state a Shannon-style rate bound for communication with deductive reasoning, governed by a function they call logical semantic entropy, but provide no proof in this text.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.IT 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Breaking through the classical Shannon entropy limit: A new frontier through logical semantics
The authors state a Shannon-style rate bound for communication with deductive reasoning, governed by a function they call logical semantic entropy, but provide no proof in this text.