Class (philosophy)

About: Class (philosophy) is a research topic. Over the lifetime, 821 publications have been published within this topic receiving 28000 citations.

3: Have You Noticed that Your Belly Button Lint Color is Related to the Color of Your Clothing?

Abstract: This chapter focuses on the interaction between pre-suppositions and implicatures triggered by factive verbs. It is concerned with cognitive factives, which is the class of factive verbs used primarily to indicate what information the subject has or how information is acquired or lost. Members of this class in English include "know", "realize", "discover", "notice", "recognize", "find out", "remember", "forget", "be aware", "be unaware", "admit", "intuit", and a subclass of sensory factives "sense", "see", "smell", "hear", "detect", "observe". The chapter considers naturally occurring data. It consists of examples occurring on world wide web located using Google search engine. The logic behind using internet rather than a more structured linguistic corpus is simple: first, author's goal is to show existence proofs; second, there is a huge difference of scale. In many cases the patterns author has searched for are quite rare, and existing linguistic corpora are not large enough to be useful. Keywords: cognitive factives; factive verbs; implicatures; linguistic corpus; sensory factives; world wide web

Outline of a Revised Formulation of the Logic of Sense and Denotation (Part II)

Abstract: 3. MODEL 2-0. In Model 2-0, we must distinguish in every type the members and the antimembers. In the types o, 0 1 0 ?2, ... the members and the antimembers are the same, and are the same as in Model 2-2. In the type l the members are 1 and 2; and there are no antimembers. In the type n+1 -the members are all the ordered pairs (aLn, bLn) where aLn may be 0 or any member of the type Ln and bL may be 0 or any antimember of the type 1n; and the antimembers are the same as the members. In any type cu3 the members are all functions from the members of the type ,3 to the members of the type ax; and the antimembers are all functions from the antimembers of the type f3 to the antimembers of the type a. As an example, the type Lo therefore has no antimembers, but the type oL has one antimember, the null function from antimembers of the type X to antimembers of the type o. This latter function is identified, under the original program of A Formulation [4], with the null class of individuals (i.e., of antimembers of the type i). Then we make the following recursive definition. Let (0, 0),yi be the ordered pair (0, 0) if yI is a simple type; and let (0, 0)al,, be the function , which is both a member and an antimember of the type (x I PI , such that I I as I = (0, 0)0j for every member (or antimember) a.1 of the type I3* Where is a member of the type af3 and .. is an antimember of the type cat, let (4 ) be the function k. I Iwhich is both a member and an antimember of the type a1 I3 , such that, if a. is any member of the type ,3 and by is any antimember of the type I, we have 4cLII (ad,

Cross-document event coreference: annotations, experiments, and observations

Abstract: We have developed cross document event tracking technology that extends our earlier efforts in cross document person coreference. The software takes class of events, like "resignations" and clusters documents that mention resignations into equivalence classes. Documents belong to the same equivalence class if they mention the same "resignation" event, i.e. resignations involving the same person, time, and organization. Other events evaluated include "elections" and "espionage" events. Results range from 45--90% F-measure scores and we present a brief interannotator study for the "elections" data set.

Relational transducers for declarative networking

Abstract: Motivated by a recent conjecture concerning the expressiveness of declarative networking, we propose a formal computation model for "eventually consistent" distributed querying, based on relational transducers. A tight link has been conjectured between coordination-freeness of computations, and monotonicity of the queries expressed by such computations. Indeed, we propose a formal definition of coordination-freeness and confirm that the class of monotone queries is captured by coordination-free transducer networks. Coordination-freeness is a semantic property, but the syntactic class of "oblivious" transducers we define also captures the same class of monotone queries. Transducer networks that are not coordination-free are much more powerful.

Obvious logical inferences

Abstract: A precise definition is given of a class of inferences in predicate logic which it is proposed to Identify with the class of "obvious" Inferences. A mechanism for Implementing "obvious inference" as a rule of Inference in proof checking systems is discussed.