We present a corpus-based study of the sequential ordering among premodifiers in noun phrases. This information is important for the fluency of generated text in practical applications. We propose and evaluate three approaches to identify sequential order among premodifiers: direct evidence, transitive closure, and clustering. Our implemented system can make over 94% of such ordering decisions ...

As our proof depends only on the invariant subspace theorem for H1 [2, Theorem 7 ] ; see also [4 ], where Hl denotes the L1 closure of A, and the F. and M. Riesz theorem [3, p. 47], it works in any situation in which these two theorems are valid. Some algebras in which both theorems are valid were considered by Bishop [l]. Even though the proof extracted by Cohen [3, p. 94] from the proof of We...

Tarski’s algebra of binary relations is formalised along the lines of the standard textbooks of Maddux and Schmidt and Ströhlein. This includes relation-algebraic concepts such as subidentities, vectors and a domain operation as well as various notions associated to functions. Relation algebras are also expanded by a reflexive transitive closure operation, and they are linked with Kleene algebr...

The terminology and notation used in this paper have been introduced in the following articles: [29], [16], [12], [13], [11], [1], [2], [32], [18], [30], [24], [25], [26], [27], [3], [9], [34], [35], [33], [28], [15], [21], [37], [10], [31], [20], [23], [5], [14], [6], [22], [8], [4], [19], [36], and [7]. Let I be a set and let J be a relational structure yielding many sorted set indexed by I. ...

We study modal Lindström theorems from a coalgebraic perspective. We provide three different Lindström theorems for coalgebraic logic, one of which is a direct generalisation of de Rijke’s result for Kripke models. Both the other two results are based on the properties of bisimulation invariance, compactness, and a third property: ω-bisimilarity, and expressive closure at level ω, respectively....

We consider all positive fragments of Tarski’s representable relation algebras and determine whether the equational and quasiequational theories of these fragments are finitely axiomatizable in first-order logic. We also look at extending the signature with reflexive, transitive closure and the residuals of composition.

We study the middle convolution of local systems on the punctured affine line in the singular and the étale case. We give a motivic interpretation of the middle convolution which yields information on the occurring determinants. Finally, we use these methods to realize special linear groups regularly as Galois groups over Q(t). Introduction If K is a field, then we set GK := Gal(K/K), where K d...

In this paper, we introduce the class Ao (p,A,B, α ) of p-valent functions in the unit disc U = { z : | z | < 1 }. We obtain coefficient estimate, distortion and closure theorems, radii of close-to convexity, starlikeness and convexity of order δ ( 0 6 δ < 1 ) for this class. We also obtain class preserving integral operators for this class. Furthermore, various distortion inequalities for frac...

We consider IES(SQL), the incremental evaluation system over an SQL-like language with grouping, arithmetics, and aggregation. We show that every second order query is in IES(SQL) and that there are PSPACE-complete queries in IES(SQL). We further show that every PSPACE query is in IES(SQL) augmented with a deterministic transitive closure operator. Lastly, we consider ordered databases and prov...

ion Rules Abst1: Variable instantiations with essential ground terms of complexity r (using a modified version of our work [SMT’2013]) Abst2: φ := (l ∨ φrest), (¬l ∨ Crest) ∈ CNF (F ) =⇒ φ φ[Crest / l ] Abst3: φ := (¬φ(t) ∨ φrest), t := pg =⇒ φ φ[(∀x . x = t ∨ (t, x)d ∈ tcR → φ(x)) / φ(t)]