Related papers: A type-theoretical approach to Universal Grammar
We give an algebraic characterization of the syntax and semantics of a class of simply-typed languages, such as the language PCF: we characterize simply-typed binding syntax equipped with reduction rules via a universal property, namely as…
Categorical compositional distributional semantics is a model of natural language; it combines the statistical vector space models of words with the compositional models of grammar. We formalise in this model the generalised quantifier…
Theory of representations of universal algebra is a natural development of the theory of universal algebra. In the book, I considered representation of universal algebra, diagram of representations and examples of representation. Morphism…
In his 1999 preprint "Universal Lie Algebra", P. Vogel put forward a hypothesis on the existence of a universal Lie algebra. Although this hypothesis remains open, it is known that many quantities in Lie theory admit universal descriptions.…
Following the classical approach of Birkhoff, we suggest an enriched version of enriched universal algebra. Given a suitable base of enrichment $\mathcal V$, we define a language $\mathbb L$ to be a collection of $(X,Y)$-ary function…
A Universal Mapping Property is generally described as a characterization of an object up to a unique isomorphism by considering its relation to every other object; however, the term "by considering its relation to every other object" is…
Semantic theories of natural language associate meanings with utterances by providing meanings for lexical items and rules for determining the meaning of larger units given the meanings of their parts. Meanings are often assumed to combine…
Motivated by potential applications to theoretical computer science, in particular those areas where the Curry-Howard correspondence plays an important role, as well as by the ongoing search in pure mathematics for feasible approaches to…
A prototypical example of categorial grammars are those based on Lambek calculus, i.e. noncommutative intuitionistic linear logic. However, it has been noted that purely noncommutative operations are often not sufficient for modeling even…
The Lambek calculus is a substructural logic known to be closely related to the formal language theory: on the one hand, it is used for generating formal languages by means of categorial grammars and, on the other hand, it has formal…
We introduce a topological approach to words. Words are approximated by Gauss words and then studied up to natural modifications inspired by homotopy transformations of curves on the plane.
In ontology-mediated query answering, access to incomplete data sources is mediated by a conceptual layer constituted by an ontology, which can be formulated in a description logic (DL) or using existential rules. In the literature, there…
We extend the notion of anti-unification to cover equational theories and present a method based on regular tree grammars to compute a finite representation of E-generalization sets. We present a framework to combine Inductive Logic…
Formal languages theory is useful for the study of natural language. In particular, it is of interest to study the adequacy of the grammatical formalisms to express syntactic phenomena present in natural language. First, it helps to draw…
We furnish any category of a universal (co)homology theory. Universal (co)homologies and universal relative (co)homologies are obtained by showing representability of certain functors and take values in $R$-linear abelian categories of…
Many type systems have been presented in the literature for variants of the pi-calculus, but none of them are able to handle composite subjects such as those found in the language epi, which features polyadic synchronisation. The purpose of…
We present a new approach to formal language theory using Kolmogorov complexity. The main results presented here are an alternative for pumping lemma(s), a new characterization for regular languages, and a new method to separate…
Lexical semantics theories differ in advocating that the meaning of words is represented as an inference graph, a feature mapping or a vector space, thus raising the question: is it the case that one of these approaches is superior to the…
The literature on word-representable graphs is quite rich, and a number of variations of the original definition have been proposed over the years. We are initiating a systematic study of such variations based on formal languages. In our…
We seize the opportunity of the publication of selected papers from the \emph{Logic, categories, semantics} workshop in the \emph{Journal of Applied Logic} to survey some current trends in logic, namely intuitionistic and linear type…