Results 251 to 260 of about 7,729,210 (329)

Weaving Political Identities: Jean‐Luc Nancy, Empedocles, and (the Later) Plato

Constellations, EarlyView.
Benjamin Hutchens
wiley   +1 more source

Application of GUHA data mining method in cohort data to explore paths associated with premature death: a 29-year follow-up study. [PDF]

BMC Med Res Methodol
Nosraty L, Turunen E, Kyrönlahti S, Nygård CH, Kc P, Neupane S.   +5 more
europepmc   +1 more source

The Firebrands Echo: National Fantasy as an Obstacle to Jean‐Luc Mélenchon's Populist Spectacle

Constellations, EarlyView.
Reid A. Kleinberg
wiley   +1 more source

Beyond the Populist Moment: Nationalism and the Democratic Chain of Conflict

Constellations, EarlyView.
Michaelangelo Anastasiou
wiley   +1 more source

Case in Complex Predicates

Case in Complex Predicates
openaire  

Some of the next articles are maybe not open access.

Related searches:

Complex predicates and predicate raising

Lingua, 2003
This paper discusses major issues that have arisen in the analysis of sentences with complex predicates in Japanese from early transformational grammar to the present minimalist program. Particular emphasis is placed on the treatment of the causative construction to assess the influence of the lexicalist hypothesis and its aftermath.
S. Kuroda
openaire   +2 more sources

Double-subject and complex-predicate constructions

Cognitive Linguistics, 2003
T. Kumashiro, R. Langacker
exaly   +2 more sources

On the complexity of join predicates

Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, 2001
We consider the complexity of join problems, focusing on equijoins, spatial-overlap joins, and set-containment joins. We use a graph pebbling model to characterize these joins combinatorially, by the length of their optimal pebbling strategies and computationally, by the complexity of discovering these strategies.
Jin-yi Cai, Venkatesan T. Chakaravarthy, Raghav Kaushik, Jeffrey F. Naughton   +3 more
openaire   +1 more source

Complex Predicate Phrases

2022
exaly   +2 more sources

Complexity in Predicative Arithmetic

2005
Complexity classes between Grzegorczyk's E2 and E3 are characterized in terms of provable recursion in a theory EA(I;O) formalising basic principles of Nelson's Predicative Arithmetic. Extensions by inductive definitions enable full arithmetic PA and higher systems to be recaptured in a setting where the natural bounding functions are “slow” rather ...
Geoffrey E. Ostrin, Stanley S. Wainer
openaire   +1 more source