Formal semantics of language and the Richard-Berry paradox
Stefano Crespi Reghizzi
TL;DR
This paper explores how formalizing language using Turing machines can lead to contradictions, highlighting limitations in formal semantic systems due to the Richard-Berry paradox.
Contribution
It combines the Richard-Berry paradox with assumptions about Turing machine complexity to demonstrate inherent contradictions in formal language semantics.
Findings
Formalization of language can lead to contradictions.
The Richard-Berry paradox impacts the consistency of formal semantic systems.
Complexity assumptions about Turing machines are central to the argument.
Abstract
The classical logical antinomy known as Richard-Berry paradox is combined with plausible assumptions about the size i.e. the descriptional complexity of Turing machines formalizing certain sentences, to show that formalization of language leads to contradiction.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSyntax, Semantics, Linguistic Variation