The starting point of this paper is the empirically determined ability to reason in natural language by employing probable sentences. A sentence is understood to be logically probable if its schema, expressed as a formula in the language of classical propositional calculus, takes the logical value of truth for the majority of Boolean valuations, i.e., as a logically probable formula. Then, the formal system P is developed to encode the set of these logically probable formulas. Based on natural semantics, (...) a strong completeness theorem for P is proved. Alternative notions of consequence for logically probable sentences are also considered. (shrink)

The logical interpretation of probability, or "objective Bayesianism'' – the theory that (some) probabilities are strictly logical degrees of partial implication – is defended. The main argument against it is that it requires the assignment of prior probabilities, and that any attempt to determine them by symmetry via a "principle of insufficient reason" inevitably leads to paradox. Three replies are advanced: that priors are imprecise or of little weight, so that disagreement about them does not matter, within (...) limits; that it is possible to distinguish reasonable from unreasonable priors on logical grounds; and that in real cases disagreement about priors can usually be explained by differences in the background information. It is argued also that proponents of alternative conceptions of probability, such as frequentists, Bayesians and Popperians, are unable to avoid committing themselves to the basic principles of logical probability. (shrink)

In this paper I want to discuss some basic problems of inductive logic, i.e. of the attempt to solve the problem of induction by means of a calculus of logical probability. I shall try to throw some light upon these problems by contrasting inductive logic, based on logical probability, and working with undefined samples of observations, with mathematical statistics, based on statistical probability, and working with representative random samples.

The aim of this paper is to present and discuss a probabilistic framework that is adequate for the formulation of quantum theory and faithful to its applications. Contrary to claims, which are examined and rebutted, that quantum theory employs a nonclassical probability theory based on a nonclassical "logic," the probabilistic framework set out here is entirely classical and the "logic" used is Boolean. The framework consists of a set of states and a set of quantities that are interrelated in (...) a specified manner. Each state induces a classical probability space on the values of each quantity. The quantities, so considered, become statistical variables (not random variables). Such variables need not have a "joint distribution." For the quantum theoretic application, there is a uniform procedure that defines and determines the existence of such "joint distributions" for statistical variables. A general rule is provided and it is shown to lead to the usual compatibility-commutivity requirements of quantum theory. The paper concludes with a brief discussion of interference and the misunderstandings that are involved in the false move from interference to nonclassical probability. (shrink)

How does deductive logic constrain probability? This question is difficult for subjectivistic approaches, according to which probability is just strength of (prudent) partial belief, for this presumes logical omniscience. This paper proposes that the way in which probability lies always between possibility and necessity can be made precise by exploiting a minor theorem of de Finetti: In any finite set of propositions the expected number of truths is the sum of the probabilities over the set. This (...) is generalized to apply to denumerable languages. It entails that the sum of probabilities can neither exceed nor be exceeded by the cardinalities of all consistent and closed (within the set) subsets. In general any numerical function on sentences is said to be logically coherent if it satisfies this condition. Logical coherence allows the relativization of necessity: A function p on a language is coherent with respect to the concept T of necessity iff there is no set of sentences on which the sum of p exceeds or is exceeded by the cardinality of every T-consistent and T-closed (within the set) subset of the set. Coherence is easily applied as well to sets on which the sum of p does not converge. Probability should also be relativized by necessity: A T-probability assigns one to every T-necessary sentence and is additive over disjunctions of pairwise T-incompatible sentences. Logical T-coherence is then equivalent to T-probability: All and only T-coherent functions are T-probabilities. (shrink)

A new direction in philosophy Between 1920 and 1940 logical empiricism reset the direction of philosophy of science and much of the rest of Anglo-American philosophy. It began as a relatively organized movement centered on the Vienna Circle, and like-minded philosophers elsewhere, especially in Berlin. As Europe drifted into the Nazi era, several important figures, especially Carnap and Neurath, also found common ground in their liberal politics and radical social agenda. Together, the logical empiricists set out to reform (...) traditional philosophy with a new set of doctrines more firmly grounded in logic and science. Criticism and decline Because of Nazi persecution, most of the European adherents of logical empiricism moved to the United States in the late 1930s. During the 1940s, many of their most cherished tenets became targets of criticism from outsiders as well as from within their own ranks. Philosophers of science in the late 1950s and 1960s rejected logical empiricism and, starting in the 1970s, presented such alternative programs such as scientific realism with evolutionary epistemology. A resurgence of interest During the early 1980s, philosophers and historians of philosophy began to study logical empiricism as an important movement. Unlike their predecessors in the 1960s-for whom the debate over logical empiricism now seems to have been largely motivated by professional politics-these philosopher no longer have to take positions for or against logical empiricism. The result has been a more balanced view of that movement, its achievements, its failures, and its influence. Hard-to-find core writings now available This collection makes available a selection of the most influential and representative writings of the logical empiricists, important contemporary criticisms of their doctrines, their responses, as well as the recent reappraisals. Introductions to each volume examine the articles in historical context and provide importantbackground information that is vital to a full understanding of the issues discussed. They outline prevalent trends, identifying leading figures and summarize their positions and reasoning, as well as those of opposing thinkers. (shrink)

Illuminates legal reasoning -- and its justification At least since plato and Aristotle, thinkers have pondered the relationship between philosophical arguments and the "sophistical" arguments offered by the Sophists -- who were the first professional lawyers. Judges wield substantial political power, and the justifications they offer for their decisions are a vital means by which citizens can assess the legitimacy of how that power is exercised. However, to evaluate judicial justifications requires close attention to the method of reasoning behind decisions. (...) This new collection illuminates and explains the political and moral importance in justifying the exercise of judicial power. Explores enduring questions Focusing on work over the past century, the essays address important recurring questions, such as: When a judge or a lawyer reasons to a conclusion about what is legally required in a given case, must he also ask what is morally required? To what extent do a judge's personal, political, or moral biases affect his legal reasoning? What is the impact of such biases? Can all such biases be avoided? Is legal reasoning similar to reasoning in mathematics, logic, and linguistics, the physical sciences, the social sciences, or literature and history? Do formal logical modes of argument play any roles in legal reasoning? Solid coverage, well organized The articles were chosen to present some of the most influential works on the topic, as well as less familiar works that are thought provoking and informative. Each volume also offers a representative range of theoretical approaches to its topic, contains an introduction that locates the subject within the larger framework oftheories of legal reasoning and jurisprudence, and includes bibliographical notes on further readings. Many 19th century legal theorists argued that deduction is the central mode of legal reasoning, and that legal argument is like a deductive proof in mathematics or logic. They were attracted to this "deductivist" concept because it suggested that legal reasoning could be politically and morally neutral. This volume brings together some of the most thought-provoking articles on both sides of the debate. It also contains several leading articles that explain the role of probabilistic judgments and presumptions in various types of legal arguments, including the laws of evidence and criminal procedure. The collection is a solid introduction to the basic modes of logical argument in legal reasoning. (shrink)

Otdvio Bueno, Empiricism, Mathematical Truth and Mathematical Knowledge 219 Commentary by Chuang Liu. Reply by Bueno. Chuang Liu, Coins and Electrons: A ...

Topics in Cognitive Science, Volume 14, Issue 3, Page 574-601, July 2022.

This paper seeks to defend the following conclusions: The program advanced by Carnap and other necessarians for probability logic has little to recommend it except for one important point. Credal probability judgments ought to be adapted to changes in evidence or states of full belief in a principled manner in conformity with the inquirer’s confirmational commitments—except when the inquirer has good reason to modify his or her confirmational commitment. Probability logic ought to spell out the constraints on (...) rationally coherent confirmational commitments. In the case where credal judgments are numerically determinate confirmational commitments correspond to Carnap’s credibility functions mathematically represented by so—called confirmation functions. Serious investigation of the conditions under which confirmational commitments should be changed ought to be a prime target for critical reflection. The necessarians were mistaken in thinking that confirmational commitments are immune to legitimate modification altogether. But their personalist or subjectivist critics went too far in suggesting that we might dispense with confirmational commitments. There is room for serious reflection on conditions under which changes in confirmational commitments may be brought under critical control. Undertaking such reflection need not become embroiled in the anti inductivism that has characterized the work of Popper, Carnap and Jeffrey and narrowed the focus of students of logical and methodological issues pertaining to inquiry. (shrink)

Pondering the question of free will in the context of probability allows us to take a fresh look at a number of old problems. We are able to avoid deterministic entrapments and attempt to look at free will as an outcome of the entire decision-making system. In my paper, I will argue that free will should be considered in the context of a complex system of decisions, not individual cases. The proposed system will be probabilistic in character, so it (...) will be embedded in the calculus of probability. To achieve the stated goal, I will refer to two areas of Carnap’s interest: the relationship between free will and determinism, and the probability-based decision-making system. First, I will present Carnap’s compatibilist position. On this basis, I will show how free will can be examined on deterministic grounds. Then I will present Carnap’s probabilistic project—the so-called logical interpretation of probability. In addition to presenting its characteristics and functionality, I will argue for its usefulness in the context of decision analysis and its immunity to problems associated with determinism. Finally, I will show how the two mentioned elements can be combined, as a result of which I will present a concept for a probabilistic analysis of free will. In this context, I will identify free will with the individual characteristics of the system. My main aim is to present the theme of free will in the light of a formal analysis based on probability rather than metaphysical assumptions. (shrink)

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)

Probability logics have been an active topic of investigation of beliefs in type spaces in game theoretical economics. Beliefs are expressed as subjective probability measures. Savage’s postulates in decision theory imply that subjective probability measures are not necessarily countably additive but finitely additive. In this paper, we formulate a probability logic Σ + that is strongly complete with respect to this class of type spaces with finitely additive probability measures, i.e. a set of formulas is (...) consistent in Σ + iff it is satisfied in a finitely additive type space. Although we can characterize Σ + -theories satisfiable in the class as maximally consistent sets of formulas, we prove that any canonical model of maximally consistent sets is not universal in the class of type spaces with finitely additive measures, and, moreover, it is not a type space. At the end of this paper, we show that even a minimal use of probability indices causes the failure of compactness in probability logics. (shrink)

APA PsycNET abstract: This is the first volume of a two-volume work on Probability and Induction. Because the writer holds that probability logic is identical with inductive logic, this work is devoted to philosophical problems concerning the nature of probability and inductive reasoning. The author rejects a statistical frequency basis for probability in favor of a logical relation between two statements or propositions. Probability "is the degree of confirmation of a hypothesis (or conclusion) on (...) the basis of some given evidence (or premises)." Furthermore, all principles and theorems of inductive logic are analytic, and the entire system is to be constructed by means of symbolic logic and semantic methods. This means that the author confines himself to the formalistic procedures of word and symbol systems. The resulting sentence or language structures are presumed to separate off logic from all subjectivist or psychological elements. Despite the abstractionism, the claim is made that if an inductive probability system of logic can be constructed it will have its practical application in mathematical statistics, and in various sciences. 16-page bibliography. (PsycINFO Database Record (c) 2016 APA, all rights reserved). (shrink)

This book compares various approaches to the interpretation of quantum mechanics, in particular those which are related to the key words "the Copenhagen interpretation", "the antirealist view", "quantum logic" and "hidden variable theory". Using the concept of "correlation" carefully analyzed in the context of classical probability and in quantum theory, the author provides a framework to compare these approaches. He also develops an extension of probability theory to construct a local hidden variable theory. The book should be of (...) interest for physicists and philosophers of science interested in the foundations of quantum theory. (shrink)

According to a popular interpretation, Carnap’s interpretation of probability had evolved from a logical towards a subjective conception. However Carnap himself insisted that his basic philosophical view of probability was always the same. I address this apparent clash between Carnap's self-identification and the subsequent interpretations of his work. Following its original intentions, I reconstruct inductive logic as an explication. The emerging picture is of a versatile linguistic framework, whose main function is not the discovery of objective (...) class='Hi'>logical relations in the object language, but the stipulation of conceptual possibilities. Within this representation, I map out the changes that the project went through. Seen from such an explication-based perspective, inductive logic becomes quite hard to categorize using the standard labels. (shrink)

As a survey of many technical results in probability theory and probability logic, this monograph by two widely respected scholars offers a valuable compendium of the principal aspects of the formal study of probability. Hugues Leblanc and Peter Roeper explore probability functions appropriate for propositional, quantificational, intuitionistic, and infinitary logic and investigate the connections among probability functions, semantics, and logical consequence. They offer a systematic justification of constraints for various types of probability functions, (...) in particular, an exhaustive account of probability functions adequate for first-order quantificational logic. The relationship between absolute and relative probability functions is fully explored and the book offers a complete account of the representation of relative functions by absolute ones. The volume is designed to review familiar results, to place these results within a broad context, and to extend the discussions in new and interesting ways. Authoritative, articulate, and accessible, it will interest mathematicians and philosophers at both professional and post-graduate levels. (shrink)

THE INDICATIVE CONDITIONAL. A PROBABILISTIC CRITERION OF SOUNDNESS FOR DEDUCTIVE INFERENCES Our objective in this section is to establish a prima facie case ...

A Logical Introduction to Probability and Induction starts with elementary logic and uses it as basis for a philosophical discussion of probability and induction. Throughout the book results are carefully proved using the inference rules introduced at the beginning. The textbook is suitable for undergraduate courses in philosophy and logic.

This chapter presents probability logic as a rationality framework for human reasoning under uncertainty. Selected formal-normative aspects of probability logic are discussed in the light of experimental evidence. Specifically, probability logic is characterized as a generalization of bivalent truth-functional propositional logic (short “logic”), as being connexive, and as being nonmonotonic. The chapter discusses selected argument forms and associated uncertainty propagation rules. Throughout the chapter, the descriptive validity of probability logic is compared to logic, which was used (...) as the gold standard of reference for assessing the rationality of human reasoning in the 20th century. (shrink)

This is an introductory 2001 textbook on probability and induction written by one of the world's foremost philosophers of science. The book has been designed to offer maximal accessibility to the widest range of students and assumes no formal training in elementary symbolic logic. It offers a comprehensive course covering all basic definitions of induction and probability, and considers such topics as decision theory, Bayesianism, frequency ideas, and the philosophical problem of induction. The key features of this book (...) are a lively and vigorous prose style; lucid and systematic organization and presentation of ideas; many practical applications; a rich supply of exercises drawing on examples from such fields as psychology, ecology, economics, bioethics, engineering, and political science; numerous brief historical accounts of how fundamental ideas of probability and induction developed; and a full bibliography of further reading. (shrink)

‘Probability logic’ might seem like an oxymoron. Logic traditionally concerns matters immutable, necessary and certain, while probability concerns the uncertain, the random, the capricious. Yet our subject has a distinguished pedigree. Ramsey begins his classic “Truth and Probability” with the words: “In this essay the Theory of Probability is taken as a branch of logic. … “speaks of “the logic of the probable.” And more recently, regards probabilities as estimates of truth values, and thus probability (...) theory as a natural outgrowth of two‐valued logic—what he calls “probability logic.” However the point is put, probability theory and logic are clearly intimately related. This chapter explores some of the multifarious connections between probability and logic, and focuses on various philosophical issues in the foundations of probability theory. (shrink)

By supplying propositional calculus with a probability semantics we showed, in our 1996, that finite stochastic problems can be treated by logic-theoretic means equally as well as by the usual set-theoretic ones. In the present paper we continue the investigation to further the use of logical notions in probability theory. It is shown that quantifier logic, when supplied with a probability semantics, is capable of treating stochastic problems involving countably many trials.

Once upon a time, some thought that indicative conditionals could be effectively analyzed as material conditionals. Later on, an alternative theoretical construct has prevailed and received wide acceptance, namely, the conditional probability of the consequent given the antecedent. Partly following critical remarks recently ap- peared in the literature, we suggest that evidential support—rather than conditional probability alone—is key to understand indicative conditionals. There have been motivated concerns that a theory of evidential conditionals (unlike their more tra- ditional counterparts) (...) cannot generate a sufficiently interesting logical system. Here, we will describe results dispelling these worries. Happily, and perhaps surprisingly, appropriate technical variations of Ernst Adams’s classical approach allow for the construction of a logic of evidential conditionals with distinctive fea- tures, which is also well-behaved and reasonably strong. (shrink)

During the academic years 1972-1973 and 1973-1974, an intensive sem inar on the foundations of quantum mechanics met at Stanford on a regular basis. The extensive exploration of ideas in the seminar led to the org~ization of a double issue of Synthese concerned with the foundations of quantum mechanics, especially with the role of logic and probability in quantum meChanics. About half of the articles in the volume grew out of this seminar. The remaining articles have been so licited (...) explicitly from individuals who are actively working in the foun dations of quantum mechanics. Seventeen of the twenty-one articles appeared in Volume 29 of Syn these. Four additional articles and a bibliography on -the history and philosophy of quantum mechanics have been added to the present volume. In particular, the articles by Bub, Demopoulos, and Lande, as well as the second article by Zanotti and myself, appear for the first time in the present volume. In preparing the articles for publication I am much indebted to Mrs. Lillian O'Toole, Mrs. Dianne Kanerva, and Mrs. Marguerite Shaw, for their extensive assistance. (shrink)

Classic work by one of the most brilliant figures in post-war analytic philosophy.

Today philosophical discussion on indicative conditionals is dominated by the so called Lewis Triviality Results, according to which, tehere is no binary connective '-->' (let alone truth-functional) such that the probability of p --> q equals the probability of q conditionally on p, so that P(p --> q)= P(q|p). This tenet, that suggests that conditonals lack truth-values, has been challenged in 1991 by Goodman et al. who show that using a suitable three-valued logic the above equation may be (...) restored. In this paper it is first analysed a long neglected paper by Bruno de Finetti, written in 1935, where the essentials of Goodman's theory was clearly outlined. It is also stressed that de Finetti anticipated Kleene's as well as Bochvar and Blamey ideas. In the second part of the paper it is argued that the de Finetti-Goodman's original theory is defective and leads to absurd results. However, a new semantics, called semantics of hypervaluations, is here defined, that avoids the defects of the original theory. This appears to be a powerful challenge to Lewis Triviality results and to the thesis by which conditionals lack truth-values as well. (shrink)

This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work. This work is in the public domain (...) in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant. (shrink)

Dynamic update of information states is a new paradigm in logicalsemantics. But such updates are also a traditional hallmark ofprobabilistic reasoning. This note brings the two perspectives togetherin an update mechanism for probabilities which modifies state spaces.

We discuss the relationship between logic, geometry and probability theory under the light of a novel approach to quantum probabilities which generalizes the method developed by R. T. Cox to the quantum logical approach to physical theories.

Provided here is a characterisation of absolute probability functions for intuitionistic (propositional) logic L, i.e. a set of constraints on the unary functions P from the statements of L to the reals, which insures that (i) if a statement A of L is provable in L, then P(A) = 1 for every P, L's axiomatisation being thus sound in the probabilistic sense, and (ii) if P(A) = 1 for every P, then A is provable in L, L's axiomatisation being (...) thus complete in the probabilistic sense. As there are theorems of classical (propositional) logic that are not intuitionistic ones, there are unary probability functions for intuitionistic logic that are not classical ones. Provided here because of this is a means of singling out the classical probability functions from among the intuitionistic ones. (shrink)

Abstract.This paper is devoted to a logical and algebraic treatment of conditional probability. The main ideas are the use of non-standard probabilities and of some kind of standard part function in order to deal with the case where the conditioning event has probability zero, and the use of a many-valued modal logic in order to deal probability of an event φ as the truth value of the sentence φ is probable, along the lines of Hájek’s book (...) [H98] and of [EGH96]. To this purpose, we introduce a probabilistic many-valued logic, called FP(SŁΠ), which is sound and complete with respect a class of structures having a non-standard extension [0,1]⋆ of [0,1] as set of truth values. We also prove that the coherence of an assessment of conditional probabilities is equivalent to the coherence of a suitably defined theory over FP(SŁΠ) whose proper axioms reflect the assessment itself. (shrink)

Automated reasoning about uncertain knowledge has many applications. One difficulty when developing such systems is the lack of a completely satisfactory integration of logic and probability. We address this problem directly. Expressive languages like higher-order logic are ideally suited for representing and reasoning about structured knowledge. Uncertain knowledge can be modeled by using graded probabilities rather than binary truth-values. The main technical problem studied in this paper is the following: Given a set of sentences, each having some probability (...) of being true, what probability should be ascribed to other (query) sentences? A natural wish-list, among others, is that the probability distribution (i) is consistent with the knowledge base, (ii) allows for a consistent inference procedure and in particular (iii) reduces to deductive logic in the limit of probabilities being 0 and 1, (iv) allows (Bayesian) inductive reasoning and (v) learning in the limit and in particular (vi) allows confirmation of universally quantified hypotheses/sentences. We translate this wish-list into technical requirements for a prior probability and show that probabilities satisfying all our criteria exist. We also give explicit constructions and several general characterizations of probabilities that satisfy some or all of the criteria and various (counter) examples. We also derive necessary and sufficient conditions for extending beliefs about finitely many sentences to suitable probabilities over all sentences, and in particular least dogmatic or least biased ones. We conclude with a brief outlook on how the developed theory might be used and approximated in autonomous reasoning agents. Our theory is a step towards a globally consistent and empirically satisfactory unification of probability and logic. (shrink)

ABSTRACTThe general assumption that people fail to notice discrepancy between their answer and the normative answer in the conjunction fallacy task has been challenged by the theory of Logical Intuition. This theory suggests that people can detect the conflict between the heuristic and normative answers even if they do not always manage to inhibit their intuitive choice. This theory gained support from the finding that people report lower levels of confidence in their choice after they commit the conjunction fallacy (...) compared to when their answer is not in conflict with logic. In four experiments we asked the participants to give probability estimations to the options of the conflict and no-conflict versions of the tasks in the original set-up of the experiment or in a three-option design. We found that participants perceive probabilities for the options of the conflict version less similar than for the no-conflict version. As people are less confident when choosing between more similar options, this simil.. (shrink)

We propose a nonmonotonic Description Logic of typicality able to account for the phenomenon of the combination of prototypical concepts. The proposed logic relies on the logic of typicality ALC + TR, whose semantics is based on the notion of rational closure, as well as on the distributed semantics of probabilistic Description Logics, and is equipped with a cognitive heuristic used by humans for concept composition. We first extend the logic of typicality ALC + TR by typicality inclusions of the (...) form p :: T(C) v D, whose intuitive meaning is that “we believe with degree p about the fact that typical Cs are Ds”. As in the distributed semantics, we define different scenarios containing only some typicality inclusions, each one having a suitable probability. We then exploit such scenarios in order to ascribe typical properties to a concept C obtained as the combination of two prototypical concepts. We also show that reasoning in the proposed Description Logic is EXPTIME-complete as for the underlying standard Description Logic ALC. (shrink)

Directed acyclic graphs (DAGs) constitute a qualitative representation for conditional independence (CI) properties of a probability distribution. It is known that every CI statement implied by the topology of a DAG is witnessed over it under a graph-theoretic criterion of d-separation. Alternatively, all such implied CI statements are derivable from the local independencies encoded by a DAG using the so-called semi-graphoid axioms. We consider Labeled Directed Acyclic Graphs (LDAGs) modeling graphically scenarios exhibiting context-specific independence (CSI). Such CSI statements are (...) modeled by labeled edges, where labels encode contexts in which the edge vanishes. We study the problem of identifying all independence statements implied by the structure and the labels of an LDAG. We show that this problem is coNP-hard for LDAGs and formulate a sound extension of the semi-graphoid axioms for the derivation of such implied independencies. Finally we connect our study to certain qualitative versions of independence ubiquitous in database theory and teams semantics. (shrink)