Results 11 to 20 of about 648 (264)
Models of nomination politics in the USA often find ‘gridlock’ in equilibrium because of the supermajority requirement in the Senate for the confirmation of presidential nominees. A blocking coalition often prefers to defeat any nominee. Yet empirically nominations are successful.
Console-Battilana, S., Shepsle, Kenneth
openaire +5 more sources
Examining the application of nominalization in segmented abstracts: a corpus-based study
The aim of this study was to explore the use of nominalizations in segmented abstracts, examining their distribution and characteristics and whether they differ from traditional non-segmented abstracts in terms of the use of nominalizations.
Yuan Yuwei
doaj +1 more source
As part of linguistic approaches to narrowing the gap between everyday words and mathematical representations in the mathematical modeling process of word problems as known to cause difficulties for students, this study examines the nominalization of the
doaj +1 more source
The paper provides a descriptively oriented analysis of morphosyntactic devices to create nouns from verbs in Mwan, a Southern Mande language. Three main strategies are under discussion: a) combination with a semantically empty word of the target class ...
Elena Perekhvalskaya
doaj +1 more source
English deadjectival nouns as models of knowledge representation about the world [PDF]
From the position of a cognitive approach the authors consider English deadjectival nouns, what involves identifying and describing knowledge domains represented by these language units in English language culture.
Liudmila V. Babina, Ksenia E. Lukina
doaj +1 more source
Nominalisierung in Abstracts deutscher und polnischer sprachwissenschaftlicher Artikel [PDF]
The aim of this study is to analyze and compare the use of nominalized verbs and adjectives in abstracts of research articles in linguistics written by German- and Polish-speaking scientists. The paper begins by describing academic texts as a subject of (
Adam Gołębiowski
doaj +1 more source
Recursive relational specifications are commonly used to describe the computational structure of formal systems. Recent research in proof theory has identified two features that facilitate direct, logic-based reasoning about such descriptions: the interpretation of atomic judgments through recursive definitions and an encoding of binding constructs via
Andrew, Gacek +2 more
openaire +5 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christian Urban +2 more
openaire +1 more source
The author develops an algebraic theory for languages of data words, i.e. words over an alphabet \(\Sigma\times \mathbb{D}\) where \(\Sigma\) is a finite set of labels and \(\mathbb{D}\) is an infinite set of data values. Some of the key notions of the paper are defined relative to a given data symmetry \((\mathbb{D},G)\) in which \(G\) is a subgroup ...
openaire +3 more sources

