Kinds Of Predicates Research Articles

Sur Une Construction N0N1-Ita en Coreen

The purpose of this study is to describe a class of sentences containing a noun in -ita, which are equivalent to an adjectival predicate. This set of sentences is of the form N0 W N1-ita (where -ita can be translated as one of the uses of être in French). Indeed, for this type of sentence: Léa-nín motín il-e (yôlsông + pulman)-ita Léa-Top everything-Pc (passion + discontent)-ita (Léa is (passionate about + discontented with) everything) we observe that N1-ita answers to the question ôtôha-(how), and not to nuku(who)/muôs(what). Further, N1-ita allows for an indication of intensity or comparison, but N1 can take no modifiers. This kind of predicate, with a human subject (noted Nsp-ita), shares some fundamental properties with an adjectival predicate. From this point of view, it is different from other types of N -ita predicates, such as: Max-nîn (haksäng + honsu-sangthä)-ita Max-Top (student + coma-state)-ita (Max is (a student + in a coma)) i congi-nîn (semo-k'ol + pola-säk)-ita this paper-Top (triangle-form + violet-color)-ita This paper is of (triangular form + violet color)) The fact that Nsp-ita (like SC-cok-ita) resembles the derived adjectives N1-hata or N1-sîlôpta puts into question the current definition of -ita: if -ita, in Nsp-ita, is analyzed as a particle attached to a noun, we would have no adjective in -ita, but only nouns. Under the hypothesis of a support term (here, the adjective supporting the predicative noun), we whould have only the adjective (ita). Finally, if we analyze this kind of -ita as an adjectival suffix, the data Nsp-ita and SC-côk-ita would all make up the entire corpus of adjectives. We underline the fact that this problem is not a simple question of terminology when one is trying to set up a corpus of adjectives for constructing a lexicon-grammar, even though the present study is limited to the classification and description of the nouns that make up the predicate Nsp-ita.

R* optimizer validation and performance evaluation for local queries

Few database query optimizer models have been validated against actual performance. This paper presents the methodology and results of a thorough validation of the optimizer and evaluation of the performance of the experimental distributed relational database management system R * , which inherited and extended to a distributed environment the optimization algorithms of System R. Optimizer estimated costs and actual R * resources consumed were written to database tables using new SQL commands, permitting automated control from SQL application programs of test data collection and reduction. A number of tests were run over a wide variety of dynamically-created test databases, SQL queries, and system parameters. The results for single-table access, sorting, and local 2-table joins are reported here. The tests confirmed the accuracy of the majority of the I/O cost model, the significant contribution of CPU cost to total cost, and the need to model CPU cost in more detail than was done in System R. The R * optimizer now retains cost components separately and estimates the number of CPU instructions, including those for applying different kinds of predicates. The sensitivity of I/O cost to buffer space motivated the development of more detailed models of buffer utilization unclustered index scans and nested-loop joins often benefit from pages remaining in the buffers, whereas concurrent scans of the data pages and the index pages for multiple tables during joins compete for buffer share. Without an index on the join column of the inner table, the optimizer correctly avoids the nested-loop join, confirming the need for merge-scan joins. When the join column of the inner is indexed, the optimizer overestimates the cost of the nested-loop join, whose actual performance is very sensitive to three parameters that are extremely difficult to estimate (1) the join (result) cardinality, (2) the outer table's cardinality, and (3) the number of buffer pages available to store the inner table. Suggestions are given for improved database statistics, prefetch and page replacement strategies for the buffer manager, and the use of temporary indexes and Bloom filters (hashed semijoins) to reduce access of unneeded data.

Nombres y predicados

Nombres y predicados

Plato's Timaeus: Mass Terms, Sortal Terms, and Identity through Time in the Phenomenal World

Several recent papers dealing with Plato's position on the imperfection of the phenomenal world draw heavily on the differences between two kinds of predicates in order to show the following: (1) In the middle dialogues, Plato posits Forms only (or primarily) as referents of what the writers call incomplete predicates (e.g., relational or attributive ones). He does not posit Forms as referents for complete predicates (e.g., sortal or mass predicates). (2) When interpreters ignore the differences between these kinds of predicates, they ascribe too radical a view regarding the imperfection of the phenomenal world to the middle dialogues. (3) The ontology of these dialogues includes sensible particulars which retain their identity over time even though they are continually changing in some respect or other.

A second order logic of existence

A. N. Prior in [9] has suggested an approach towards a second order logic of existence where, following medieval logicians, we distinguish “between predicates (like ‘is red’, ‘is hard’, etc.) which entail existence, and predicates (like ‘is thought to be red’, ‘is thought of’, etc.) which do not.”2 Let us refer to attributes (including relational attributes) which are designated by the former kind of predicate as existence attributes, or for brevity, e-attributes.

Some Remarks on Second Order Logic with Existence Attributes

In Past, Present and Future A. N. Prior has suggested an approach towards the concept of existence where, following medieval logicians, we are to distinguish between predicates (like 'is red', 'is hard', etc.) which entail existence, and predicates (like 'is thought to be red', 'is thought of', etc.) which do not (p. 161). Let us refer to attributes (including relational attributes) which are designated by the former kind of predicate as existence attributes, or for brevity, e-attributes. It is suggested then that exists is to be defined as there is some e-attribute which x possesses. A formalization of this (at least) second order logic of existence was recently brought about and reported on by the present author in [6]. The formalization was shown to be complete in the sense corresponding to the completeness of standard second order logic, i.e., in the sense which encompasses normal, non-standard as well as standard models. (Cf. [1], ? 54). I should like in the present paper to discuss some of the philosophical issues involved in this formalization as well as some issues concerning the general notion of e-attribute.