Formal semantics of language and the Richard-Berry paradox
Computation and Language
2008-07-25 v1 Computational Complexity
Logic in Computer Science
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.
Keywords
Cite
@article{arxiv.0807.3845,
title = {Formal semantics of language and the Richard-Berry paradox},
author = {Stefano Crespi Reghizzi},
journal= {arXiv preprint arXiv:0807.3845},
year = {2008}
}