Ignorance and indifference

The epistemic state of complete ignorance is not a probability distribution. In it, we assign the same, unique, ignorance degree of belief to any contingent outcome and each of its contingent, disjunctive parts. That this is the appropriate way to represent complete ignorance is established by two instruments, each individually strong enough to identify this state. They are the principle of indifference (PI) and the notion that ignorance is invariant under certain redescriptions of the outcome space, here developed into the 'principle of invariance of ignorance' (PII). Both instruments are so innocuous as almost to be platitudes. Yet the literature in probabilistic epistemology has misdiagnosed them as paradoxical or defective since they generate inconsistencies when conjoined with the assumption that an epistemic state must be a probability distribution. To underscore the need to drop this assumption, I express PII in its most defensible form as relating symmetric descriptions and show that paradoxes still arise if we assume the ignorance state to be a probability distribution. Copyright 2008 by the Philosophy of Science Association. All rights reserved

Intonation and discourse : biased questions

This paper surveys a range of constructions in which prosody affects discourse function and discourse structure.We discuss English tag questions, negative polar questions, and what we call “focus” questions. We postulate that these question types are complex speech acts and outline an analysis in Segmented Discourse Representation Theory (SDRT) to account for the interactions between prosody and discourse

A Bridge from Semantic Value to Content

A common view relating compositional semantics and the objects of assertion holds the following: Sentences φ and ψ expresses the same proposition iff φ and ψ have the same modal profile. Following Dummett, Evans, and Lewis, Stanley argues that this view is fundamentally mistaken. According to Dummett, we must distinguish the semantic contribution a sentence makes to more complex expressions in which it occurs from its assertoric content. Stojnić insists that views which distinguish the roles of content and semantic value must nevertheless ensure a tight connection between the two. But, she contends, there is a crucial disanalogy between the views that follow Lewis and the views that follow Dummett. Stanley’s Dummettian view is argued to contain a fatal flaw: On such views, there is no way to secure an appropriate connection between semantic value and a theoretically motivated notion of assertoric content. I will review the background issues from Dummett, Evans, Lewis, and Stanley, and provide a principled way of bridging the gap between semantic value and a theoretically motivated notion of assertoric content

Typed feature structures, definite equivalences, greatest model semantics, and nonmonotonicity

Typed feature logics have been employed as description languages in modern type-oriented grammar theories like HPSG and have laid the theoretical foundations for many implemented systems. However, recursivity pose severe problems and have been addressed through specialized powerdomain constructions which depend on the particular view of the logician. In this paper, we argue that definite equivalences introduced by Smolka can serve as the formal basis for arbitrarily formalized typed feature structures and typed feature-based grammars/lexicons, as employed in, e.g., TFS or TDL. The idea here is that type definitions in such systems can be transformed into an equivalent definite program, whereas the meaning of the definite program then is identified with the denotation of the type system. Now, models of a definite program P can be characterized by the set of ground atoms which are logical consequences of the definite program. These models are ordered by subset inclusion and, for reasons that will become clear, we propose the greatest model as the intended interpretation of P, or equivalent, as the denotation of the associated type system. Our transformational approach has also a great impact on nonmonotonically defined types, since under this interpretation, we can view the type hierarchy as a pure transport medium, allowing us to get rid of the transitivity of type information (inheritance), and yielding a perfectly monotonic definite program

Comparative Analysis of Five XML Query Languages

XML is becoming the most relevant new standard for data representation and exchange on the WWW. Novel languages for extracting and restructuring the XML content have been proposed, some in the tradition of database query languages (i.e. SQL, OQL), others more closely inspired by XML. No standard for XML query language has yet been decided, but the discussion is ongoing within the World Wide Web Consortium and within many academic institutions and Internet-related major companies. We present a comparison of five, representative query languages for XML, highlighting their common features and differences.Comment: TeX v3.1415, 17 pages, 6 figures, to be published in ACM Sigmod Record, March 200