GF (Grammatical Framework) is a grammar formalism based on the distinction between abstract and concrete syntax. An abstract syntax is a free algebra of trees, and a concrete syntax is a mapping from trees to nested records of strings and features. These mappings are naturally defined as functions in a functional programming language; the GF language provides the customary functional programmin...

some linguists believe that word in arabic language was initially based on one syllabus; orators have changed them according to the special countries, tribes and societies. they have contrived special acumen for any prefixes, suffixes and affixes addition. some other linguists believed that word was initially formed based on three letters, and thus different accents and languages were ramified ...

Bayaties attract attention with their poetic perfection reflecting the subtleties of national language, specific features phonetic, lexical and grammatical norms literary language Azerbaijan. The purity vernacular, richness vocabulary, fluency structure are also clearly felt in bayaties. As research work is called "Sentence its syntax bayaties Azerbaijan", sentences bayaty context will be studi...

calculus is a new calculus that integrates in a uniform and simple settings rst-order rewriting,-calculus and non-deterministic computations. This paper describes the calculus from its syntax to its basic properties in the untyped case. We show how it embeds rst-order rewriting and-calculus. Finally we shows how-calculus can be used to give an operational semantics to the rewrite based language...

This is perfect in mathematics, but wrong in real life, since real implication is causal. A causal implication cannot be iterated since the conditions are modified after its use ; this process of modification of the premises (conditions) is known in physics as reaction. For instance, if A is to spend $1 on a pack of cigarettes and B is to get them, you lose $1 in this process, and you cannot do...

In this paper, we present a propositional logic (called mixed logic) containing disjoint copies of minimal, intuitionistic and classical logics. We prove a completeness theorem for this logic with respect to a Kripke semantics. We establish some relations between mixed logic and minimal, intuitionistic and classical logics. We present at the end a sequent calculus version for this logic.