Results 1 to 10 of about 4,834,513 (114)
Discrete & Computational Geometry, 2017 ISSN:0179 ...
Alexander Pilz, Emo Welzl
openaire +4 more sources
French order without order [PDF]
Proceedings of the fourth conference on European chapter of the Association for Computational Linguistics -, 1989 To account for the semi-free word order of French, Unification Categorial Grammar is extended in two ways. First, verbal valencies are contained in a set rather than in a list. Second, type-raised NP's are described as two-sided functors. The new framework does not overgenerate i.e., it accepts all and only the sentences which are grammatical.
Bès, Gabriel G., Gardent, Claire
openaire +3 more sources
Languages Ordered by the Subword Order [PDF]
, 2019 Abstract We consider a language together with the subword relation, the cover relation, and regular predicates. For such structures, we consider the extension of first-order logic by threshold- and modulo-counting quantifiers. Depending on the language, the used predicates, and the fragment of the logic, we determine four new combinations ...
Kuske, D., Zetzsche, G.
openaire +3 more sources
Ordered chaining for total orderings [PDF]
, 1994 We design new inference systems for total orderings by applying rewrite techniques to chaining calculi. Equality relations may either be specified axiomatically or built into the deductive calculus via paramodulation or superposition. We demonstrate that our inference systems are compatible with a concept of (global) redundancy for clauses and ...
Bachmair, L., Ganzinger, H.
openaire +3 more sources
Weak-order extensions of an order
Theoretical Computer Science, 1997 In this paper, at first we describe a graph representing all the weak-order extensions of a partially ordered set and an algorithm generating them. Then we present a graph representing all of the minimal weak-order extensions of a partially ordered set, and implying a generation algorithm. Finally, we prove that the number of weak-order extensions of a
Bertet, Karell +2 more
openaire +4 more sources
The Journal of Symbolic Logic, 2021 AbstractExtending Aanderaa’s classical result that $\pi ^{1}_{1} < \sigma ^{1}_{1}$ , we determine the order between any two patterns of iterated $\Sigma ^{1}_{1}$ - and $\Pi ^{1}_{1}$ -reflection on ordinals. We show that this order of linear reflection is a prewellordering of length $\omega ^{\omega }$ .
openaire +3 more sources
ORDERED CATEGORIES AND ORDERED SEMIGROUPS [PDF]
Communications in Algebra, 2002 We use ordered categories to study semidirect decompositions of finite ordered semigroups. We obtain ordered analogues of the derived semigroupoid theorem and of the delay theorem. Next we prove that the ordered analogues of semilattices and of J-trivial monoids constitute local varieties, and we derive some decomposition theorems from these results.
Pin, Jean-Eric +2 more
openaire +2 more sources
Language Sciences, 2017 This paper discuss the two orders of language as introduced by Nigel Love. Focussing on the methodological problem of their being presented as (at least in theory) distinct from one another, I argue that they would be better construed as classifications the analyst might use, as opposed to being presented as a distinction borne out when one looks at ...
openaire +2 more sources
The order of thought and the order of words [PDF]
Kalbotyra, 2007 Šiame straipsnyje pateikiama vertimo analizė, atsižvelgiant į kalbų struktūrinius skirtingumus ir galimybes, kurias suteikia funkcinės sakinio perspektyvos (FSP) realizavimas. Pateikiami lietuvių grožinės literatūros tekstai ir jų angliškieji vertimai, siekiant nustatyti, kokią rolę funkcinės sakinio perspektyvos perteikime vaidina žodžių tvarka ...
openaire +4 more sources