This paper presents a method to compute a posteriori probability intervals when the initial conditional information is also given with probability intervals. The right way to make an exact computation is with the associated convex set of probabilities. Probability trees are used to represent these initial conditional convex sets because they greatly save the space required. This paper proposes a simulated annealing algorithm, which uses probability trees to represent the convex sets in order to compute the (...) a posteriori intervals. (shrink)

There is a trade-off between specificity and accuracy in existing models of belief. Descriptions of agents in the tripartite model, which recognizes only three doxastic attitudes—belief, disbelief, and suspension of judgment—are typically accurate, but not sufficiently specific. The orthodox Bayesian model, which requires real-valued credences, is perfectly specific, but often inaccurate: we often lack precise credences. I argue, first, that a popular attempt to fix the Bayesian model by using sets of functions is also inaccurate, since it requires us to (...) have interval-valued credences with perfectly precise endpoints. We can see this problem as analogous to the problem of higher order vagueness. Ultimately, I argue, the only way to avoid these problems is to endorse Insurmountable Unclassifiability. This principle has some surprising and radical consequences. For example, it entails that the trade-off between accuracy and specificity is in-principle unavoidable: sometimes it is simply impossible to characterize an agent’s doxastic state in a way that is both fully accurate and maximally specific. What we can do, however, is improve on both the tripartite and existing Bayesian models. I construct a new model of belief—the minimal model—that allows us to characterize agents with much greater specificity than the tripartite model, and yet which remains, unlike existing Bayesian models, perfectly accurate. (shrink)

Adverbial modification is probably one of the least understood areas of linguistics. The essays in this volume all address the problem of how to give an analysis of adverbial modifiers within truth-conditional semantics. Chapters I-VI provide analyses of particular modifiers within a possible worlds framework, and were written between 1974 and 1981. Original publication details of these chapters may be found on p. vi. Of these, all but Chapter I make essential use of the idea that the time reference involved (...) in tensed sentences should be a time interval rather than a single instant. The final chapter (Chapter VII) was written especially for this volume and investigates the question of how the 'situation semantics' recently devised by Jon Barwise and John Perry, as a rival to possible-worlds semantics, might deal with adverbs. In addition I have included an appendix to Chapter III and an introduction which links all the chapters together. (shrink)

Probabilistic inference forms lead from point probabilities of the premises to interval probabilities of the conclusion. The probabilistic version of Modus Ponens, for example, licenses the inference from \({P(A) = \alpha}\) and \({P(B|A) = \beta}\) to \({P(B)\in [\alpha\beta, \alpha\beta + 1 - \alpha]}\) . We study generalized inference forms with three or more premises. The generalized Modus Ponens, for example, leads from \({P(A_{1}) = \alpha_{1}, \ldots, P(A_{n})= \alpha_{n}}\) and \({P(B|A_{1} \wedge \cdots \wedge A_{n}) = \beta}\) to an according (...) class='Hi'>interval for P(B). We present the probability intervals for the conclusions of the generalized versions of Cut, Cautious Monotonicity, Modus Tollens, Bayes’ Theorem, and some SYSTEM O rules. Recently, Gilio has shown that generalized inference forms “degrade”—more premises lead to less precise conclusions, i.e., to wider probability intervals of the conclusion. We also study Adam’s probability preservation properties in generalized inference forms. Special attention is devoted to zero probabilities of the conditioning events. These zero probabilities often lead to different intervals in the coherence and the Kolmogorov approach. (shrink)

Photovoltaic power forecasting can provide strong support for the safe operation of the power system. Existing forecasting methods are ineffective for grid scheduling decisions or risk analysis. The novel multicluster interval prediction method is proposed to consider the volatility and randomness of PV power output. First, this method utilizes the sparse autoencoder and Bayesian regularized NARX network for point forecasting of PV power. Second, density peak clustering improved by kernel Mahalanobis distance is applied to classify the dataset into multiple (...) clusters, including forecasting error and meteorological factors. Finally, the joint probability density is established by multivariate kernel density estimation to accomplish the PV power interval prediction. The proposed hybrid method is applied for the interval prediction of PV power at Yulara, Australia. Comparative research of point forecasting is implemented to evaluate the machine learning and deep learning methods, with the proposed SAE-BRNARX under four different periods. Results shows that the average values of nRMSE, MRE, nMAE, and R2 for the four periods are 4.45%, 0.90%, −0.15%, 3.39%, and 95.93%, respectively. Moreover, the results of interval prediction obtained by the other interval prediction approaches are compared with the proposed KMDDPC-MKDE. It shows that the average values of PICP, PINAW, ACE, and nMPICD for four periods are 93.93%, 9.50%, 3.93%, and 7.10% at 90% confidence level, respectively. Outcomes demonstrate that the proposed method can obtain more accuracy, a higher coverage rate, narrower average bandwidth, and a closer distance between the middle of interval and actual value than other methods. (shrink)

Many have claimed that unspecific evidence sometimes demands unsharp, indeterminate, imprecise, vague, or interval-valued probabilities. Against this, a variant of the diachronic Dutch Book argument shows that perfectly rational agents always have perfectly sharp probabilities.

Understanding probabilities as something other than point values has often been motivated by the need to find more realistic models for degree of belief, and in particular the idea that degree of belief should have an objective basis in “statistical knowledge of the world.” I offer here another motivation growing out of efforts to understand how chance evolves as a function of time. If the world is “chancy” in that there are non-trivial, objective, physical probabilities at the macro-level, then the (...) chance of an event e that happens at a given time is \ until it happens. But whether the chance of e goes to one continuously or not is left open. Discontinuities in such chance trajectories can have surprising and troubling consequences for probabilistic analyses of causation and accounts of how events occur in time. This, coupled with the compelling evidence for quantum discontinuities in chance’s evolution, gives rise to a “continuity bind” with respect to chance probability trajectories. I argue that a viable option for circumventing the continuity bind is to understand the probabilities “imprecisely,” that is, as intervals rather than point values. I then develop and motivate an alternative kind of continuity appropriate for interval-valued chance probability trajectories. (shrink)

Precise global solar radiation data are indispensable to the design, planning, operation, and management of solar radiation utilization equipment. Some examples prove that the uncertainty of the prediction of solar radiation provides more value than deterministic ones in the management of power systems. This study appraises the potential of random forest, V-support vector regression, and a resilient backpropagation artificial neural network for daily global solar radiation point prediction from average relative humidity, daily average temperature, and daily sunshine duration. To acquire (...) more accurate predictions of DGSR and examine the influence of historical DGSR on the performance of point prediction models, two different model inputs are considered: three meteorological variables and the lags of DGSR and three meteorological variables. Then, two interval prediction methods are developed by introducing the KDE to out-of-bag, introducing kernel density estimation to split conformal based on the three machine learning models. The two methods for interval prediction are denoted as OOB-KDE and SC-KDE. The mean absolute error, mean relative error, and Kendall rank correlation are used to assess the point prediction models. The performance of interval prediction methods is evaluated by the prediction interval coverage probability, prediction interval normalized average width, and coverage width criteria. The following conclusions are drawn from this study. First, the V-SVR model performs best with the lowest mean absolute error of 0.016 and mean relative error of 0.001. Second, the lags of DGSR improve the prediction accuracy by about 30%. Third, the OOB-KDE and SC-KDE methods improved the quality of the prediction interval. OOB-KDE improved CWC by 81%, and SC-KDE improved CWC by 99.99%. Fourth, the best interval prediction result is obtained using the SC-KDE method using the V-SVR model. The average difference between its PICP and prediction interval nominal coverage is only 3% of the PINC, and its PINAW is less than 0.007. (shrink)

Intervals in boolean algebras enter into the study of conditional assertions (or events) in two ways: directly, either from intuitive arguments or from Goodman, Nguyen and Walker's representation theorem, as suitable mathematical entities to bear conditional probabilities, or indirectly, via a representation theorem for the family of algebras associated with de Finetti's three-valued logic of conditional assertions/events. Further representation theorems forge a connection with rough sets. The representation theorems and an equivalent of the boolean prime ideal theorem yield an algebraic (...) completeness theorem for the three-valued logic. This in turn leads to a Henkin-style completeness theorem. Adequacy with respect to a family of Kripke models for de Finetti's logic, Łukasiewicz's three-valued logic and Priest's Logic of Paradox is demonstrated. The extension to first-order yields a short proof of adequacy for Körner's logic of inexact predicates. (shrink)

Proponents of the Fine-Tuning Argument frequently assume that the narrowness of the life-friendly range of fundamental physical constants implies a low probability for the origin of the universe ‘by chance’. We cast this argument in a more rigorous form than is customary and conclude that the narrow intervals do not yield a probability at all because the resulting measure function is non-normalizable. We then consider various attempts to circumvent this problem and argue that they fail.

An important field of probability logic is the investigation of inference rules that propagate point probabilities or, more generally, interval probabilities from premises to conclusions. Conditional probability logic (CPL) interprets the common sense expressions of the form “if . . . , then . . . ” by conditional probabilities and not by the probability of the material implication. An inference rule is probabilistically informative if the coherent probability interval of its conclusion is not (...) necessarily equal to the unit interval [0, 1]. Not all logically valid inference rules are probabilistically informative and vice versa. The relationship between logically valid and probabilistically informative inference rules is discussed and illustrated by examples such as the modus ponens or the affirming the consequent. We propose a method to evaluate the strength of CPL inference. (shrink)

Analyses of singular causation often make use of the idea that a cause increases the probability of its effect. Of particular salience in such accounts are the values of the probability function of the effect, conditional on the presence and absence of the putative cause, analysed around the times of the events in question: causes are characterized by the effect’s probability function being greater when conditionalized upon them. Put this way, it becomes clearer that the ‘behaviour’ of (...) probability functions in small intervals about the times in question ought to be of concern. In this article, I make an extended case that causal theorists employing the ‘probability raising’ idea should pay attention to the continuity question. Specifically, if the probability functions are ‘jumping about’ in ways typical of discontinuous functions, then the stability of the relevant probability increase is called into question. The rub, however, is that sweeping requirements for either continuity or discontinuity are problematic and, as I argue, this constitutes a ‘continuity bind’. Hence more subtle considerations and constraints are needed, two of which I consider: utilizing discontinuous first derivatives of continuous probability functions, and abandoning point probability for imprecise probability. _1_ Introduction _2_ Probability Trajectories and Continuity _2.1_ Probability trajectories _2.2_ Causation as discontinuous jumps _2.3_ Against systematic discontinuity _3_ Broader Discontinuity Concerns _4_ The Continuity Bind _4.1_ Retaining continuity with discontinuous first derivatives _4.2_ Imprecise probability trajectories _5_ Concluding Remarks Appendix. (shrink)

We discuss O&C's probabilistic approach from a probability logical point of view. Specifically, we comment on subjective probability, the indispensability of logic, the Ramsey test, the consequence relation, human nonmonotonic reasoning, intervals, generalized quantifiers, and rational analysis.

The phenomenon of probability backflow, previously quantified for a free nonrelativistic particle, is considered for a free particle obeying Dirac's equation. It is shown that probability backflow can occur in the opposite direction to the momentum; that is to say, there exist positive-energy states in which the particle certainly has a positive momentum in a given direction, but for which the component of the probability flux vector in that direction is negative. It is shown that the maximum (...) possible amount of probability that can flow “backwards,” over a given time interval of duration T, depends on the dimensionless parameter ε = (4ℏ/mc2T)1/2, where m is the mass of the particle and c is the speed of light. At ε = 0, the nonrelativistic value of approximately 0.039 for this maximum is recovered. Numerical studies suggest that the maximum decreases monotonically as ε increases from 0, and show that it depends on the size of m, ℏ, and T, unlike the nonrelativistic case. (shrink)

The objective of this study is to propose a new operation method based on the universal grey number to overcome the shortcomings of typical interval operation in solving system fault trees. First, the failure probability ranges of the bottom events are described according to the conversion rules between the interval number and universal grey number. A more accurate system reliability calculation is then obtained based on the logical relationship between the AND gates and OR gates of a (...) fault tree and universal grey number arithmetic. Then, considering an aircraft landing gear retraction system as an example, the failure probability range of the top event is obtained through universal grey operation. Next, the reliability of the aircraft landing gear retraction system is evaluated despite insufficient statistical information describing failures. The example demonstrates that the proposed method provides many advantages in resolving the system reliability problem despite poor information, yielding benefits for the function of the interval operation, and overcoming the drawback of solution interval enlargement under different orders of interval operation. (shrink)

Probability logic studies the properties resulting from the probabilistic interpretation of logical argument forms. Typical examples are probabilistic Modus Ponens and Modus Tollens. Argument forms with two premises usually lead from precise probabilities of the premises to imprecise or interval probabilities of the conclusion. In the contribution, we study generalized inference forms having three or more premises. Recently, Gilio has shown that these generalized forms ``degrade'' -- more premises lead to more imprecise conclusions, i. e., to wider intervals. (...) We distinguish different forms of degradation. We analyse Predictive Inference, Modus Ponens, Bayes' Theorem, and Modus Tollens. Special attention is devoted to the case where the conditioning events have zero probabilities. Finally, we discuss the relation of degradation to monotonicity. (shrink)

There are a number of reasons for being interested in uncertainty, and there are also a number of uncertainty formalisms. These formalisms are not unrelated. It is argued that they can all be reflected as special cases of the approach of taking probabilities to be determined by sets of probability functions defined on an algebra of statements. Thus, interval probabilities should be construed as maximum and minimum probabilities within a set of distributions, Glenn Shafer's belief functions should be (...) construed as lower probabilities, etc. Updating probabilities introduces new considerations, and it is shown that the representation of belief as a set of probabilities conflicts in this regard with the updating procedures advocated by Shafer. The attempt to make subjectivistic probability plausible as a doctrine of rational belief by making it more flowery — i.e., by adding new dimensions — does not succeed. But, if one is going to represent beliefs by sets of distributions, those sets of distributions might as well be based in statistical knowledge, as they are in epistemological or evidential probability. (shrink)

We show that the 0-1 law does not hold for the class Σ 1 1 (∀∃∀ without =) by finding a sentence in this class which almost surely expresses parity. We also show that every recursive real in the unit interval is the asymptotic probability of a sentence in this class. This expands a result by Lidia Tendera, who in 1994 proved that every rational number in the unit interval is the asymptotic probability of a sentence (...) in the class Σ 1 1 ∀∃∀ with equality. (shrink)

Probability as understood today, namely as a quantitative notion expressible by means of a function ranging in the interval between 0–1, took shape in the mid-17th century, and presents both a mathematical and a philosophical aspect. Of these two sides, the second is by far the most controversial, and fuels a heated debate, still ongoing. After a short historical sketch of the birth and developments of probability, its major interpretations are outlined, by referring to the work of (...) their most prominent representatives. The final section addresses the question of whether any of such interpretations can presently be considered predominant, which is answered in the negative. (shrink)

There are a number of reasons for being interested in uncertainty, and there are also a number of uncertainty formalisms. These formalisms are not unrelated. It is argued that they can all be reflected as special cases of the approach of taking probabilities to be determined by sets of probability functions defined on an algebra of statements. Thus, interval probabilities should be construed as maximum and minimum probabilities within a set of distributions, Glenn Shafer's belief functions should be (...) construed as lower probabilities, etc. Updating probabilities introduces new considerations, and it is shown that the representation of belief as a set of probabilities conflicts in this regard with the updating procedures advocated by Shafer. The attempt to make subjectivistic probability plausible as a doctrine of rational belief by making it more flowery -- i.e., by adding new dimensions -- does not succeed. But, if one is going to represent beliefs by sets of distributions, those sets of distributions might as well be based in statistical knowledge, as they are in epistemological or evidential probability. (shrink)

Sometimes different partitions of the same space each seem to divide that space into propositions that call for equal epistemic treatment. Famously, equal treatment in the form of equal point-valued credence leads to incoherence. Some have argued that equal treatment in the form of equal interval-valued credence solves the puzzle. This paper shows that, once we rule out intervals with extreme endpoints, this proposal also leads to incoherence.

The purpose of this paper is to improve on the logical and measure-theoretic foundations for the notion of probability in the law of evidence, which were given in my contributions Åqvist [ (1990) Logical analysis of epistemic modality: an explication of the Bolding–Ekelöf degrees of evidential strength. In: Klami HT (ed) Rätt och Sanning (Law and Truth. A symposium on legal proof-theory in Uppsala May 1989). Iustus Förlag, Uppsala, pp 43–54; (1992) Towards a logical theory of legal evidence: semantic (...) analysis of the Bolding–Ekelöf degrees of evidential strength. In: Martino AA (ed) Expert systems in law. Elsevier Science Publishers BV, Amsterdam, North-Holland, pp 67–86]. The present approach agrees with the one adopted in those contributions in taking its main task to be that of providing a semantic analysis, or explication, of the so called Bolding–Ekelöf degrees of evidential strength (“proof-strength”) as applied to the establishment of matters of fact in law-courts. However, it differs from the one advocated in our earlier work on the subject in explicitly appealing to what is known as “Pro-et-Contra Argumentation”, after the famous Norwegian philosopher Arne Naess. It tries to bring out the logical form of that interesting kind of reasoning, at least in the context of the law of evidence. The formal techniques used here will be seen to be largely inspired by the important work done by Patrick Suppes, notably Suppes [(1957) Introduction to logic. van Nostrand, Princeton and (1972) Finite equal-interval measurement structures. Theoria 38:45–63]. (shrink)

Turing’s famous 1936 paper “On computable numbers, with an application to the Entscheidungsproblem” defines a computable real number and uses Cantor’s diagonal argument to exhibit an uncomputable real. Roughly speaking, a computable real is one that one can calculate digit by digit, that there is an algorithm for approximating as closely as one may wish. All the reals one normally encounters in analysis are computable, like π, √2 and e. But they are much scarcer than the uncomputable reals because, as (...) Turing points out, the computable reals are countable, whilst the uncomputable reals have the power of the continuum. Furthermore, any countable set of reals has measure zero, so the computable reals have measure zero. In other words, if one picks a real at random in the unit interval with uniform probability distribution, the probability of obtaining an uncomputable real is unity. One may obtain a computable real, but that is in- finitely improbable. But how about individual examples of uncomputable reals? We will show two: H and the halting probability Ω, both contained in the unit interval. Their construction was anticipated in.. (shrink)

In many real-life situations, we are interested in the value of a physical quantity y that is difficult or impossible to measure directly. To estimate y, we find some easier-to-measure quantities x1, … , xn which are related to y by a known relation y = f. Measurements are never 100% accurate; hence, the measured values equation image are different from xi, and the resulting estimate equation image is different from the desired value y = f. How different can it (...) be? Traditional engineering approach to error estimation in data processing assumes that we know the probabilities of different measurement errors equation image. In many practical situations, we only know the upper bound Δi for this error; hence, after the measurement, the only information that we have about xi is that it belongs to the interval equation image. In this case, it is important to find the range y of all possible values of y = f when xi ∈ xi. We start the paper with a brief overview of the computational complexity of the corresponding interval computation problems: Most of the related problems turn out to be, in general, at least NP-hard. In this paper, we show how the use of quantum computing can speed up some computations related to interval and probabilistic uncertainty. We end the paper with speculations on whether “hypothetic” physical devices can compute NP-hard problems faster than in exponential time. Most of the paper's results were first presented at NAFIPS'2003 [30]. (shrink)

In this paper we show that Neutrosophic Statistics is an extension of Interval Statistics, since it deals with all kinds of indeterminacy (with respect to data, inferential procedures, probability distributions, graphical representations, etc.), allows for indeterminacy reduction, and uses neutrosophic probability which is more general than imprecise and classical probabilities, and has more detailed corresponding probability density functions. Whereas Interval Statistics only deals with indeterminacy that can be represented by intervals. And we respond to the (...) arguments of Woodall et al [1]. We show that not all indeterminacies (uncertainties) can be represented by intervals. Moreover, in some applications, we should use hesitant sets (which have less indeterminacy) instead of intervals. We redirect the authors to Plitogenic Probability and Plitogenic Statistics which are the most general forms of Multivariate Probability and Multivariate Statistics respectively (including, of course, Imprecise Probability and Interval Statistics as subclasses). (shrink)

In this paper, we prove that Neutrosophic Statistics is more general than Interval Statistics, since it may deal with all types of indeterminacies (with respect to the data, inferential procedures, probability distributions, graphical representations, etc.), it allows the reduction of indeterminacy, and it uses the neutrosophic probability that is more general than imprecise and classical probabilities and has more detailed corresponding probability density functions. While Interval Statistics only deals with indeterminacy that can be represented by (...) intervals. And we respond to the arguments by Woodall et al. [1]. We show that not all indeterminacies (uncertainties) may be represented by intervals. Also, in some cases, we should better use hesitant sets (that have less indeterminacy) instead of intervals. We redirect the authors to the Plithogenic Probability and Plithogenic Statistics which are the most general forms of MultiVariate Probability and Multivariate Statistics respectively (including, of course, the Imprecise Probability and Interval Statistics as subclasses). (shrink)

Decision analysts sometimes use the results of clinical trials in order to evaluate treatment alternatives. I discuss some problems associated with this, and in particular I point out that it is not valid to use the estimates from clinical trials as the probabilities of events which are needed for decision analysis. I also attempt to show that an approach based on objective statistical theory may have advantages over commonly used methods based on decision theory. These advantages include the recognition of (...) uncertain data, the introduction of a third alternative, namely suspension of judgement, and the possibility of modifying the choice of probabilities based on a clinical trial with reference to other available knowledge. I have not, however, shown in detail how this modification is done, but I think the concept is sufficiently promising to be applied to an actual clinical decision problem. (shrink)

In the traditional decision theories the role of forecasts is to a large extent swept under the carpet. I believe that a recognition of the connections between forecasts and decisions will be of benefit both for decision theory and for the art of forecasting.In this paper I have tried to analyse which factors, apart from the utilities of the outcomes of the decision alternatives, determine the value of a decision. I have outlined two answers to the question why a decision (...) which is made on the basis of a forecast is better than a decision which is based on a guess. Neither of these answers is universally valid. An assumption which is necessary for the first answer, i.e. Good's result, is that Bayes' rule is accepted as a correct and generally applicable decision principle. The second answer, which was given with the aid of probability intervals, departed from a more general decision principle, the maximin criterion for expected utilities, which was formulated in order to evade some of the criticism against Bayes' rule. However, the argument leading to the ansser is based on the assumption that the probability intervals associated with the states of nature represent certain knowledge. For this reason this answer is only approximatively valid.As a number of quotations in the section on “the weight of evidence” show, it is not sufficient to describe the knowledge about the states of nature by a single number, representing the (subjective) probability of the state, but something else has to be invoked which measures the amount of information on which a decision is based. Several authors have tried to characterize this mysterious quantity, which here was called the weight of evidence. However, there seems to be little agreement as to how this quantity should be measured. (shrink)

In a recent paper, probabilistic processes are used to generate Borel probability measures on topological spaces X that are equipped with a representation in the sense of type-2 theory of effectivity. This gives rise to a natural representation of the set of Borel probability measures on X. We compare this representation to a canonically constructed representation which encodes a Borel probability measure as a lower semicontinuous function from the open sets to the unit interval. We show (...) that this canonical representation is admissible with respect to the weak topology on Borel probability measures. Moreover, we prove that for countably-based topological spaces the representation via probabilistic processes is equivalent to the canonical representation and thus admissible with respect to the weak topology. (shrink)

Motivated by problems that arise in computing degrees of belief, we consider the problem of computing asymptotic conditional probabilities for first-order sentences. Given first-order sentences φ and θ, we consider the structures with domain {1,..., N} that satisfy θ, and compute the fraction of them in which φ is true. We then consider what happens to this fraction as N gets large. This extends the work on 0-1 laws that considers the limiting probability of first-order sentences, by considering asymptotic (...) conditional probabilities. As shown by Liogon'kii [24], if there is a non-unary predicate symbol in the vocabulary, asymptotic conditional probabilities do not always exist. We extend this result to show that asymptotic conditional probabilities do not always exist for any reasonable notion of limit. Liogon'kii also showed that the problem of deciding whether the limit exists is undecidable. We analyze the complexity of three problems with respect to this limit: deciding whether it is well-defined, whether it exists, and whether it lies in some nontrivial interval. Matching upper and lower bounds are given for all three problems, showing them to be highly undecidable. (shrink)

The quantum mechanical transition probability is symmetric. A probabilistically motivated and more general quantum logical definition of the transition probability was introduced in two preceding papers without postulating its symmetry, but in all the examples considered there it remains symmetric. Here we present a class of binary models where the transition probability is not symmetric, using the extreme points of the unit interval in an order unit space as quantum logic. We show that their state spaces (...) are strictly convex smooth compact convex sets and that each such set _K_ gives rise to a quantum logic of this class with the state space _K_. The transition probabilities are symmetric iff _K_ is the unit ball in a Hilbert space. In this case, the quantum logic becomes identical with the projection lattice in a spin factor which is a special type of formally real Jordan algebra. (shrink)

We consider the question of randomness of the probability ΩU[X] that an optimal Turing machine U halts and outputs a string in a fixed set X. The main results are as follows: ΩU[X] is random whenever X is $\Sigma _{n}^{0}$-complete or $\Pi _{n}^{0}$-complete for some n ≥ 2. However, for n ≥ 2, ΩU[X] is not n-random when X is $\Sigma _{n}^{0}$ or $\Pi _{n}^{0}$ Nevertheless, there exists $\Delta _{n+1}^{0}$ sets such that ΩU[X] is n-random. There are $\Delta _{2}^{0}$ (...) sets X such that ΩU[X] is rational. Also, for every n ≥ 1, there exists a set X which is $\Delta _{n+1}^{0}$ and $\Sigma _{n}^{0}$-hard such that ΩU[X] is not random. We also look at the range of ΩU as an operator. We prove that the set {ΩU[X]: X ⊆ 2<ω} is a finite union of closed intervals. It follows that for any optimal machine U and any sufficiently small real r, there is a set X ⊆ 2<ω recursive in ∅′ ⊕ r, such that ΩU[X] = r. The same questions are also considered in the context of infinite computations, and lead to similar results. (shrink)

Alan Hájek has recently argued that certain assignments of vague probability defeat Pascals Wager. In particular, he argues that skeptical agnostics – those whose probability for God''s existence is vague over an interval containing zero – have nothing to fear from Pascal. In this paper, I make two arguments against Hájek: (1) that skeptical agnosticism is a form of dogmatism, and as such should be rejected; (2) that in any case, choice situations with vague probability assignments (...) ought to be treated as second-order cases of choice under uncertainty, with the result that belief in God is the favored option in a very wide range of cases. (shrink)

A SEM-based approach using likelihood-based confidence interval has been proposed to form confidence intervals for unstandardized and standardized indirect effect in mediation models. However, when used with the maximum likelihood estimation, this approach requires that the variables are multivariate normally distributed. This can affect the LBCIs of unstandardized and standardized effect differently. In the present study, the robustness of this approach when the predictor is not normally distributed but the error terms are conditionally normal, which does not violate the (...) distributional assumption of ordinary least squares estimation, is compared to four other approaches: nonparametric bootstrapping, two variants of LBCI, LBCI assuming the predictor is fixed and LBCI based on ADF estimation, and Monte Carlo. A simulation study was conducted using a simple mediation model and a serial mediation model, manipulating the distribution of the predictor. The Monte Carlo method performed worst among the methods. LBCI and LBCI-Fixed-X had suboptimal performance when the distributions had high kurtosis and the population indirect effects were medium to large. In some conditions, the problem was severe even when the sample size was large. LBCI-ADF and nonparametric bootstrapping had coverage probabilities close to the nominal value in nearly all conditions, although the coverage probabilities were still suboptimal for the serial mediation model when the sample size was small with respect to the model. Implications of these findings in the context of this special case of nonnormal data were discussed. (shrink)

Objective interpretations of probability are usually discussed in two varieties: frequency and propensity accounts. But there is a third, neglected possibility, namely, probabilities as deriving from ranges in suitably structured initial state spaces. Roughly, the probability of an event is the proportion of initial states that lead to this event in the space of all possible initial states, provided that this proportion is approximately the same in any not too small interval of the initial state space. This (...) idea can also be expressed by saying that in the types of situations that give rise to probabilistic phenomena we may expect to find an initial state space such that any "reasonable" density function over this space leads to the same probabilities for the possible outcomes. This "method of arbitrary functions" was introduced by Poincaré, studied and extended by Hopf and more recently by Eduardo Engel, Jan von Plato and Michael Strevens. The natural-range, or method-of-arbitrary-functions approach to probabilities is usually treated as an explanation for the occurrence of probabilistic patterns, whereas I examine its prospects for an objective interpretation of probability, in the sense of providing truth conditions for probability statements that do not depend on our state of mind or information. The main objection to such a proposal is that it is circular, i.e. presupposes the concept of probability, because a measure on the initial state has to be introduced, and density functions over the space are considered. I try to argue that this objection can be successfully met. (shrink)

In standard Bayesian probability revision, the adoption of full beliefs (propositions with probability 1) is irreversible. Once an agent has full belief in a proposition, no subsequent revision can remove that belief. This is an unrealistic feature, and it also makes probability revision incompatible with belief change theory, which focuses on how the set of full beliefs is modified through both additions and retractions. This problem in probability theory can be solved in a model that (i) (...) lets the codomain of the probability function be a hyperreal-valued rather than the real-valued closed interval [0, 1], and (ii) identifies the full beliefs as the propositions whose probability is either 1 or infinitesimally smaller than 1. In this model, changes in the probability function will result in changes in the set of full beliefs (belief set), which constitutes a submodel that can be conceived as the “tip of the iceberg” within the larger model that also contains beliefs on lower levels of probability. The patterns of change in the set of full beliefs in this modified Bayesian model coincides with the corresponding pattern in a slightly modified version of AGM revision, which is commonly conceived as the gold standard of (dichotomous) belief change. The modification only concerns the marginal case of revision by an inconsistent input sentence. These results show that probability revision and dichotomous belief change can be unified in one and the same framework, or – if we so wish – that belief change theory can be subsumed under a modified version of probability revision that allows for iterated change and for the removal of full beliefs. (shrink)

This study examines the delay between first marriage and first live birth in China among a sample of women who married between 1980 and 1992. Most couples in China only use contraception after the first child is born. Most sample women had their first child within 2 years of marriage. However, there are significant rural–urban differences in the first birth interval, indicating that there was most probably deliberate fertility regulation after marriage among many urban couples. Survival analysis shows that (...) place of residence, level of education, age at first marriage and marriage cohort affect the first birth interval. (shrink)

Close connections between probability theory and the theory of belief change emerge if the codomain of probability functions is extended from the real-valued interval [0, 1] to a hyperreal interval with the same limits. Full beliefs are identified as propositions with a probability at most infinitesimally smaller than 1. Full beliefs can then be given up, and changes in the set of full beliefs follow a pattern very close to that of AGM revision. In this (...) contribution, iterated revision is investigated. The iterated changes in the set of full beliefs generated by repeated revisions of a hyperreal probability function can, semantically, be modelled with the same basic structure as the sphere models of belief change theory. The changes on the set of full beliefs induced by probability revision satisfy the Darwiche–Pearl postulates for iterated belief change. (shrink)

We report two issues concerning diverging sets of Bayesian (conditional) probabilities-divergence of "posteriors"-that can result with increasing evidence. Consider a set P of probabilities typically, but not always, based on a set of Bayesian "priors." Fix E, an event of interest, and X, a random variable to be observed. With respect to P, when the set of conditional probabilities for E, given X, strictly contains the set of unconditional probabilities for E, for each possible outcome X = x, call this (...) phenomenon dilation of the set of probabilities (Seidenfeld and Wasserman 1993). Thus, dilation contrasts with the asymptotic merging of posterior probabilities reported by Savage (1954) and by Blackwell and Dubins (1962). (1) In a wide variety of models for Robust Bayesian inference the extent to which X dilates E is related to a model specific index of how far key elements of P are from a distribution that makes X and E independent. (2) At a fixed confidence level, (1-α), Classical interval estimates A n for, e.g., a Normal mean θ have length O(n -1/2 ) (for sample size n). Of course, the confidence level correctly reports the (prior) probability that θ ∈ A n ,P(A n )=1-α , independent of the prior for θ . However, as shown by Pericchi and Walley (1991), if an ε -contamination class is used for the prior on the parameter θ , there is asymptotic (posterior) dilation for the A n , given the data. If, however, the intervals A ′ n are chosen with length $O(\sqrt{\log (\text{n})/\text{n})}$ , then there is no asymptotic dilation. We discuss the asymptotic rates of dilation for ClassClassical and Bayesian interval estimates and relate these to Bayesian hypothesis testing. (shrink)

We offer an alternative approach to the existing methods for intuitionistic formalization of reasoning about probability. In terms of Kripke models, each possible world is equipped with a structure of the form $$\langle H, \mu \rangle $$ that needs not be a probability space. More precisely, though H needs not be a Boolean algebra, the corresponding monotone function (we call it measure) $$\mu : H \longrightarrow [0,1]_{\mathbb {Q}}$$ satisfies the following condition: if $$\alpha $$, $$\beta $$, $$\alpha \wedge (...) \beta $$, $$\alpha \vee \beta \in H$$, then $$\mu (\alpha \vee \beta ) = \mu (\alpha ) + \mu (\beta ) - \mu (\alpha \wedge \beta )$$. Since the range of $$\mu $$ is the set $$[0,1]_{\mathbb {Q}}$$ of rational numbers from the real unit interval, our logic is not compact. In order to obtain a strong complete axiomatization, we introduce an infinitary inference rule with a countable set of premises. The main technical results are the proofs of strong completeness and decidability. (shrink)

We study the model-theoretic aspects of a probability logic suited for talking about measure spaces. This nonclassical logic has a model theory rather different from that of classical predicate logic. In general, not every satisfiable set of sentences has a countable model, but we show that one can always build a model on the unit interval. Also, the probability logic under consideration is not compact. However, using ultraproducts we can prove a compactness theorem for a certain class (...) of weak models. (shrink)

Kyburg goes half-way towards objective Bayesianism. He accepts that frequencies constrain rational belief to an interval but stops short of isolating an optimal degree of belief within this interval. I examine the case for going the whole hog.

Neutrosophic Over-/Under-/Off-Set and -Logic were defined for the first time by Smarandache in 1995 and published in 2007. They are totally different from other sets/logics/probabilities. He extended the neutrosophic set respectively to Neutrosophic Overset {when some neutrosophic component is > 1}, Neutrosophic Underset {when some neutrosophic component is < 0}, and to Neutrosophic Offset {when some neutrosophic components are off the interval [0, 1], i.e. some neutrosophic component > 1 and other neutrosophic component < 0}. This is no surprise (...) with respect to the classical fuzzy set/logic, intuitionistic fuzzy set/logic, or classical/imprecise probability, where the values are not allowed outside the interval [0, 1], since our real-world has numerous examples and applications of over-/under-/off-neutrosophic components. (shrink)

Spontaneous eye blinks are modulated around perceptual events. Our previous study, using a visual ambiguous stimulus, indicated that blink probability decreases before a reported perceptual switch. In the current study, we tested our hypothesis that an absence of blinks marks a time in which perceptual switches are facilitated in‐ and outside the visual domain. In three experiments, presenting either a visual motion quartet in light or darkness or a bistable auditory streaming stimulus, we found a co‐occurrence of blink rate (...) reduction with increased perceptual switch probability. In the visual domain, perceptual switches induced by a short interruption of visual input (blank) allowed an estimate of the timing of the perceptual event with respect to the motor response. This provided the first evidence that the blink reduction was not a consequence of the perceptual switch. Importantly, by showing that the time between switches and the previous blink was significantly longer than the inter‐blink interval, our studies allowed to conclude that perceptual switches did not happen at random but followed a prolonged period of nonblinking. Correspondingly, blink rate and switch rate showed an inverse relationship. Our study supports the idea that the absence or presence of blinks maps perceptual processes independent of the sensory modality. (shrink)