Modeling Uncertain Self-Referential Semantics with Infinite-Order Probabilities
نویسنده
چکیده
The notion of a “second-order probability” (a probability distribution defined over a space of probability distributions), while not exactly commonplace, has become less obscure in recent decades due to the advent of imprecise probability theory as developed by Peter Walley [1] and others [2]. It is straightforward to generalize the notion further to thirdorder probabilities and so forth; and the reason these notions are rarely discussed is not so much that there are mathematical difficulties, but rather that no one has seen much use for them. However, so far as we have been able to tell, the notion of infinite-order probabilities has not been previously discussed. Intuitively, the notion of an infinite-order probability is simply “a probability distribution of probability distributions of probability distributions of ... of probability distributions.” The goal of this paper is to briefly introduce these novel mathematical objects; and then to explain their apparent importance in the domain of semantics, via their ability to synthesize uncertain semantics with self-referential semantics.
منابع مشابه
Domain Theory for Modeling OOP: A Summary (Domain Theory for The Construction of NOOP, and The Construction of COOP as a Step Towards Constructing NOOP)
Domain theory is ‘a mathematical theory that serves as a foundation for the semantics of programming languages’ [AJ94]. Domains form the basis of a theory of partial information, which extends the familiar notion of partial function to encompass a whole spectrum of “degrees of definedness”, so as to model incremental higher-order computation (i.e., computing with infinite data values, such as f...
متن کاملDomain Theory for Modeling OOP: A Summary (Domain Theory for The Construction of NOOP, and The Construction of COOP as a Step Towards Constructing NOOP)
Domain theory is ‘a mathematical theory that serves as a foundation for the semantics of programming languages’ [AJ94]. Domains form the basis of a theory of partial information, which extends the familiar notion of partial function to encompass a whole spectrum of “degrees of definedness”, so as to model incremental higher-order computation (i.e., computing with infinite data values, such as f...
متن کاملProbabilistic Model Checking of Biological Systems with Uncertain Kinetic Rates
We present an abstraction of the probabilistic semantics of Multiset Rewriting to formally express systems of reactions with uncertain kinetic rates. This allows biological systems modelling when the exact rates are not known, but are supposed to lie in some intervals. On these (abstract) models we perform probabilistic model checking obtaining lower and upper bounds for the probabilities of re...
متن کاملHow to Express Self-Referential Probability. A Kripkean Proposal
We present a semantics for a language that includes sentences that can talk about their own probabilities. This semantics applies a fixed point construction to possible world style structures. One feature of the construction is that some sentences only have their probability given as a range of values. We develop a corresponding axiomatic theory and show by a canonical model construction that i...
متن کاملPointing and reference reconsidered
Current semantic theory on indexical expressions claims that demonstratively used indexicals such as this lack a referent-determining meaning but instead rely on an accompanying demonstration act like a pointing gesture. While this view allows to set up a sound logic of demonstratives, the direct-referential role assigned to pointing gestures has never been scrutinized thoroughly in semantics o...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008