Formal semantics of language and the Richard-Berry paradox

Simple item page
dc.creatorReghizzi, Stefano Crespi
dc.date2008-07-24
dc.date.accessioned2026-07-07T09:52:35Z
dc.date.available2026-07-07T09:52:35Z
dc.descriptionThe 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.
dc.identifierhttps://arxiv.org/abs/0807.3845
dc.identifierhttp://arxiv.org/abs/0807.3845
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/165646
dc.subjectComputation and Language
dc.subjectComputational Complexity
dc.subjectLogic in Computer Science
dc.titleFormal semantics of language and the Richard-Berry paradox
dc.typetext

Files

Collections

arXiv