The topology of syntax relations of a formal language

Simple item page
dc.creatorLapshin, Vladimir
dc.date2008-02-28
dc.date.accessioned2026-07-07T09:23:46Z
dc.date.available2026-07-07T09:23:46Z
dc.descriptionThe method of constructing of Grothendieck's topology basing on a neighbourhood grammar, defined on the category of syntax diagrams is described in the article. Syntax diagrams of a formal language are the multigraphs with nodes, signed by symbols of the language's alphabet. The neighbourhood grammar allows to select correct syntax diagrams from the set of all syntax diagrams on the given alphabet by mapping an each correct diagram to the cover consisted of the grammar's neighbourhoods. Such the cover gives rise to Grothendieck's topology on category of correct syntax diagrams extended by neighbourhoods' diagrams. An each object of the category may be mapped to the set of meanings (abstract senses) of this syntax construction. So, the contrvariant functor from category of correct syntax diagrams to category of sets is defined. The given category of contravariant functors likes to be seen as the convenient means to think about relations between syntax and semantic of a formal language. The sheaves of set defined on category of contravariant functors are the objects that satisfy of compositionality principle defined in the semantic analysis.
dc.description11 pages
dc.identifierhttps://arxiv.org/abs/0802.4181
dc.identifierhttp://arxiv.org/abs/0802.4181
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/155853
dc.subjectCategory Theory
dc.subject18F10; 18F20
dc.titleThe topology of syntax relations of a formal language
dc.typetext

Files

Collections

arXiv