Neuropsychological dissociations between regular and irregular past tense verb processing have been explained in two ways: (a) separate mechanisms of a rule-governed process for regular verbs and a lexical-associative process for irregular verbs; (b) a single system drawing on phonological and semantic knowledge. The latter account invokes phonological impairment as the basis of poorer performa...

We consider observational specifications of state-based systems which incorporate the declaration of a distinguished set of observer operations. These observers determine an indistinguishability relation for states which is called "observational equality". An important requirement for the non-observer operations is the compatibility with the observational equality. In the CafeOBJ language (and ...

A non-empty set X of a carrier A of an algebra A is called Q-independent if the equality of two term functions f and g of the algebra A on any finite system of elements a1, a2, . . . , an of X implies f(p(a1), p(a2), . . . , p(an)) = g(p(a1), p(a2), . . . , p(an)) for any mapping p ∈ Q. An algebra B is a retract of A if B is the image of a retraction (i.e. of an idempotent endomorphism of B). W...

We consider observational specifications of state-based systems which incorporate the declaration of a distinguished set of observer operations. These observers determine an indistinguishability relation for states which is called "observational equality". An important requirement for the non-observer operations is the compatibility with the observational equality. In the CafeOBJ language (and ...

Abstract Data Types (ADTs) can be specified by the Classified Model (CM) specification language—a first-order Horn language with equality and sort “classification” assertions. Sort assertions generalize the traditional syntactic signatures of ADT specifications, resulting in all of the specification capability of traditional equational specifications, but with the improved expressibility of the...

We study various well-known schemes for defining inductive and co-inductive types from a categorical perspective. Categorically, an inductive type is just an initial algebra and a coinductive type is just a terminal co-algebra. However, in category theory these notions are quite strong, requiring the existence of a certain map and its uniqueness. In a formal system like type theory one usually ...

Polysemy is a major characteristic of natural languages. Like words, syntactic forms can have several meanings. Understanding the correct meaning of a syntactic form is of great importance to many NLP applications. In this paper we address an important type of syntactic polysemy – the multiple possible senses of tense syntactic forms. We make our discussion concrete by introducing the task of T...

the study of internal structure and functions of pronouns across languages can be useful for typological, theoretical as well as descriptive studies. personal pronouns in iranian languages and dialects have been investigated in the present study. the study has indicated that the pronouns are in clitic as well as free morphemes. the study also indicated that the languages and dialects benefit fr...

We construct an infinite dimensional quasi-polyadic equality algebra A such that its cylindric reduct is representable, while A itself is not representable. 1 The most well known generic examples of algebraizations of first order logic are Tarski’s cylindric algebras (CA) and Halmos’ polyadic equality algebras (PEA). The theory of cylindric algebras is well developed in the treatise [10], [11],...

This paper promotes the hypothesis that central grammatical categories must be analysed as pragmatic rather than semantic entities, in order to explain their seemingly redundant typological distribution. A case is made of the relatively complex English past tense system versus the single Russian past tense, and it is shown how the distinctions within the former system can be analysed in terms o...