Related papers: An approximate zero-one law via the Dialectica int…
We consider arbitrary discrete probability laws on the real line. We obtain a criterion of their belonging to a new class of quasi-infinitely divisible laws, which is a wide natural extension of the class of well known infinitely divisible…
A random permutation $\Pi_n$ of $\{1,\dots,n\}$ follows the $\DeclareMathOperator{\Mallows}{Mallows}\Mallows(n,q)$ distribution with parameter $q>0$ if $\mathbb{P} ( \Pi_n = \pi )$ is proportional to $\DeclareMathOperator{\inv}{inv}…
There are two main approach to probability, one of set-theoretic character where probability is the measure of a set, and another one of linguistic character where probability is the degree of confidence in a proposition. In this work we…
We establish zero-one laws and convergence laws for monadic second-order logic (MSO) (and, a fortiori, first-order logic) on a number of interesting graph classes. In particular, we show that MSO obeys a zero-one law on the class of…
Contingency and accident are two important notions in philosophy and philosophical logic. Their meanings are so close that they are mixed sometimes, in both everyday discourse and academic research. This indicates that it is necessary to…
Let us draw a graph R on {0,1,...,n-1} by having an edge {i,j} with probability p_(|i-j|), where sum_i p_i is finite and let M_n=(n,<,R). For a first order sentence psi let a^n_psi be the probability of ``M_n satisfies psi''. We prove that…
In this paper we obtain some possibilistic variants of the probabilistic laws of large numbers, different from those obtained by other authors, but very natural extensions of the corresponding ones in probability theory. Our results are…
We present a semantics for adding uncertainty to conditional logics for default reasoning and belief revision. We are able to treat conditional sentences as statements of conditional probability, and express rules for revision such as "If A…
We derive an analogue of the quantum total probability rule by constructing a probability theory based on paraconsistent logic. Bayesian probability theory is constructed upon classical logic and a desiderata, that is, a set of desired…
In this article, it is shown specifically that natural system chance events as represented by theory predicted (a priori) probabilistic statements used in such realms as modern particle physics, among others, are only random relative to the…
We study conditioning on null events, or surprises, and behaviorally characterize the Ordered Surprises (OS) representation of beliefs. For feasible events, our Decision Maker (DM) is Bayesian. For null events, our DM considers a hierarchy…
Let $\omega_0, \omega_1,\ldots, \omega_n$ be a full set of outcomes (letters, symbols) and let positive $p_i$, $i=0,\ldots,n$, be their probabilities ($\sum_{i=0}^n p_i=1$). Let us treat $\omega_0$ as a stop symbol; it can occur in…
We generalize, by a progressive procedure, the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. In our coherence-based approach, conjunctions and disjunctions are suitable conditional…
We address the question of why particular laws were selected for the universe, by proposing a mechanism for laws to evolve. Normally in physical theories, timeless laws act on time-evolving states. We propose that this is an approximation,…
This is the logical foundation for for Relativity Theory, Probability Theory, and for Quantum Theory. Contents is the following: 1 Introduction. 2 Classical logic. 3 Time and space. 3.1 Recorders. 3.2 Time. 3.3 Space. 3.4 Relativity. 4.…
We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is…
In this work we investigate the asymptotic behaviour of weighted partial sums of a particular class of random variables related to Oppenheim series expansions. More precisely, we verify convergence in probability as well as almost sure…
We make explicit the correspondence between syntax and syntactic categories for coherent first-order logic, providing a categorical characterization of bi-interpretability. This is done by creating a biequivalence between a bicategory of…
A given question can be defined in terms of the set of statements or assertions that answer it. Application of logical inference to these sets of assertions allows one to derive the logic of inquiry among questions. There are interesting…
The aim of this paper is to provide a new perspective on finite element accuracy. Starting from a geometrical reading of the Bramble-Hilbert lemma, we recall the two probabilistic laws we got in previous works that estimate the relative…