Search results for " conjunction"
showing 10 items of 30 documents
Canonical Extensions of Conditional Probabilities and Compound Conditionals
2022
In this paper we show that the probability of conjunctions and disjunctions of conditionals in a recently introduced framework of Boolean algebras of conditionals are in full agreement with the corresponding operations of conditionals as defined in the approach developed by two of the authors to conditionals as three-valued objects, with betting-based semantics, and specified as suitable random quantities. We do this by first proving that the canonical extension of a full conditional probability on a finite algebra of events to the corresponding algebra of conditionals is compatible with taking subalgebras of events.
Algebraic aspects and coherence conditions for conjunctions among conditional events
2018
We deepen the study of a notion of conjunction among conditional events, introduced in previous papers in theframework of coherence. This notion of conjunction, differently from other approaches, is given in the setting ofconditional random quantities. We show that some well known properties which are satisfied by conjunctionsof unconditional events are also satisfied by conjunctions of conditional events. In particular we examine anadditive property and a decomposition formula, by also obtaining a generalized inclusion-exclusion formula. Then,by exploiting the notion of conjunction, we introduce the set of constituents generated bynconditional events.Moreover, under logical independence, w…
Logical Operations among Conditional Events: theoretical aspects and applications
2019
We generalize the notions of conjunction and disjunction of two conditional events to the case of $n$ conditional events. These notions are defined, in the setting of coherence, by means of suitable conditional random quantities with values in the interval $[0,1]$. We also define the notion of negation, by verifying De Morgan's Laws. Then, we give some results on coherence of prevision assessments for some families of compounded conditionals and we show that some well known properties which are satisfied by conjunctions and disjunctions of unconditional events are also satisfied by conjunctions and disjunction of conditional events. We also examine in detail the coherence of the prevision a…
On compound and iterated conditionals
2021
We illustrate the notions of compound and iterated conditionals introduced, in recent papers, as suitable conditional random quantities, in the framework of coherence. We motivate our definitions by examining some concrete examples. Our logical operations among conditional events satisfy the basic probabilistic properties valid for unconditional events. We show that some, intuitively acceptable, compound sentences on conditionals can be analyzed in a rigorous way in terms of suitable iterated conditionals. We discuss the Import-Export principle, which is not valid in our approach, by also examining the inference from a material conditional to the associated conditional event. Then, we illus…
Quasi conjunction and p-entailment in nonmonotonic reasoning
2010
We study, in the setting of coherence, the extension of a probability assessment defined on n conditional events to their quasi conjunction. We consider, in particular, two special cases of logical dependencies; moreover, we examine the relationship between the notion of p-entailment of Adams and the inclusion relation of Goodman and Nguyen. We also study the probabilistic semantics of the QAND rule of Dubois and Prade; then, we give a theoretical result on p-entailment.
An improved quantum query algorithm for computing AND Boolean function
2010
We consider the quantum query model for computing Boolean functions. The definition of the function is known, but a black box contains the input X = (x 1 , x 2 , …, x n ). Black box can be accessed by querying x i values. The goal is to develop an algorithm, which would compute the function value for arbitrary input using as few queries to the black box as possible. We present two different quantum query algorithms for computing the basic Boolean function — logical AND of two bits. Both algorithms use only one query to determine the function value. Correct answer probability for the first algorithm is 80%, but for the second algorithm it is 90%. To compute this function with the same probab…
Conjunction, Disjunction and Iterated Conditioning of Conditional Events
2013
Starting from a recent paper by S. Kaufmann, we introduce a notion of conjunction of two conditional events and then we analyze it in the setting of coherence. We give a representation of the conjoined conditional and we show that this new object is a conditional random quantity, whose set of possible values normally contains the probabilities assessed for the two conditional events. We examine some cases of logical dependencies, where the conjunction is a conditional event; moreover, we give the lower and upper bounds on the conjunction. We also examine an apparent paradox concerning stochastic independence which can actually be explained in terms of uncorrelation. We briefly introduce the…
Sakārtojuma saiklis “un” emuāros
2016
Emuāru rakstīšana pēdējo gadu laikā guvusi plašu popularitāti dažādās jomās un nozarēs. Lai gan valodas īpatnības emuāros nav plaši pētītas, valoda emuāros tiek raksturota kā nepastarpināta un tās lietojums tiek salīdzināts ar runas pierakstīšanu, kad domu plūdumu ir grūti sadalīt teikumos. Līdz ar to šī darba mērķis ir izzināt un analizēt sakārtojuma saikļa “un” lietojumu saliktos sakārtotos teikumos emuāros, kas ir uzskatīti par jaunu, vēl attīstības procesā esošu, žanru. Iegūtie rezultāti liecina, ka, lai gan tiek izšķirti astoņi sakārtojuma saikļa “ un” papildus nozīmju veidi, lielākajā daļā teikumu sakārtojuma saiklis “un” tiek lietots ar tā pamatnozīmi.
Aportació a l'estudi de la conjunció concessiva «jatsia»
2007
Concessive connectors are the focal point of grammaticalization processes, based on several types of lexical sources. In Catalan, «jatsia» (that) is the result of a grammaticalization process based on an aspectual temporary adverb (or phase adverb), which is comparable to the process that produced «encara que». The case of «encara que» has already been studied specifically by Pérez Saldanya & Salvador (1995), while Klesper (1930), Badia (1982) and Cuenca & Massip (2005) have focused on «jatsia» (that). The interest of the study of these processes is increased in the case of «jatsia»(that) by the polymorphism it shows and by the displacement it has experimented in its use, since it has gone …
Universal Restrictions in Reading: What Do French Beginning Readers (Mis)perceive?
2020
International audience; Despite the many reports that consider statistical distribution to be vitally important in visual identification tasks in children, some recent studies suggest that children do not always rely on statistical properties to help them locate syllable boundaries. Indeed, sonority-a universal phonological element-might be a reliable source for syllable segmentation. More specifically, are children sensitive to a universal phonological sonority-based markedness continuum within the syllable boundaries for segmentation (e.g., from marked, illegal intervocalic clusters, "jr," to unmarked, legal intervocalic clusters, "rj"), and how does this sensitivity progress with reading…