The predicate marker li in Mauritian Creole

There is a morpheme 'li' in Mauritian Creole (MC), which is homophonous with the 3sg pronoun, and which, in the early creole, occurs frequently between the subject and the predicate in affirmative, present tense clauses. I propose that that 'li' may have originated as a resumptive pronoun, co-referential with the subject, but following the grammaticalization of new determiner elements to mark the semantic contrasts of [±definite] and singular vs. plural, 'li' has now grammaticalized into a predicate marker. Its presence is sensitive to both the nature of the predicate, and to the definiteness and specificity features of the subject NP. My analysis is within the framework of Truth Conditional Semantics, where indefinite NPs are analyzed as variables that get introduced into the discourse, and must be bound by an operator to yield a closed proposition, with a truth value. Drawing on a comparison with a cognative morpheme 'i' in Seychellois Creole, I claim that its path to grammaticalization is linked to that of the specificity marking 'la'.

The Predicate-Argument Structure

Aquest article conté una proposta per a la representació de les estructures predicatives (és a dir, dels predicats amb els seus arguments) en els formalismes basats en estructures de trets tipificades. L’article comença amb una discussió dels objectius i del nivell de descripció de la representació que es proprosa; i després se centra en una exemplificació minuciosa de les estructures predicatives de totes les categories majors (verbs, adjectius, preposicions i noms), així com d’algunes relacions de modificació.

Predicate Dispatching in the Common Lisp Object System

I have added support for predicate dispatching, a powerful generalization of other dispatching mechanisms, to the Common Lisp Object System (CLOS). To demonstrate its utility, I used predicate dispatching to enhance Weyl, a computer algebra system which doubles as a CLOS library. My result is Dispatching-Enhanced Weyl (DEW), a computer algebra system that I have demonstrated to be well suited for both users and programmers.

The method of predicate least squares refinement

Parameters to be determined in a least squares refinement calculation to fit a set of observed data may sometimes usefully be `predicated' to values obtained from some independent source, such as a theoretical calculation. An algorithm for achieving this in a least squares refinement calculation is described, which leaves the operator in full control of the weight that he may wish to attach to the predicate values of the parameters.

Hiord: A type-free higher-order logic programming language with predicate abstraction

A new formalism, called Hiord, for defining type-free higherorder logic programming languages with predicate abstraction is introduced. A model theory, based on partial combinatory algebras, is presented, with respect to which the formalism is shown sound. A programming language built on a subset of Hiord, and its implementation are discussed. A new proposal for defining modules in this framework is considered, along with several examples.

Inductive inference in the variable valued predicate logic system VL 21 : methodology and computer implementation /

Vita.

Complete problems in the first-order predicate calculus /

"UILU-ENG 79 1726."

Homelie del R. padre F. Franceschino Visdomini da Ferrara ... : nelle quali vi sono molti vtili, e necessari essempi, e documenti, tratti dalle principali auttorità [sic!] della sacra Biblia, & de sacri Euangeli : predicate in Roma, in Vinegia, in Genoua, In Bologna, in Brescia [et] nel sacro santo Concilio di Trento /

Mode of access: Internet.