In this paper we consider conditional random quantities (c.r.q.’s) in the setting of coherence. Based on betting scheme, a c.r.q. X|H is not looked at as a restriction but, in a more extended way, as \({XH + \mathbb{P}(X|H)H^c}\) ; in particular (the indicator of) a conditional event E|H is looked at as EH + P(E|H)H c . This extended notion of c.r.q. allows algebraic developments among c.r.q.’s even if the conditioning events are different; then, for instance, (...) we can give a meaning to the sum X|H + Y|K and we can define the iterated c.r.q. (X|H)|K. We analyze the conjunction of two conditional events, introduced by the authors in a recent work, in the setting of coherence. We show that the conjoined conditional is a conditional random quantity, which may be a conditional event when there are logical dependencies. Moreover, we introduce the negation of the conjunction and by applying De Morgan’s Law we obtain the disjoined conditional. Finally, we give the lower and upper bounds for the conjunction and disjunction of two conditional events, by showing that the usual probabilistic properties continue to hold. (shrink)

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 random quantities. We define the notion of negation, by verifying De Morgan’s Laws. We also show that conjunction and disjunction satisfy the associative and commutative properties, and a monotonicity property. Then, we give some results on coherence of prevision assessments for some families (...) of compounded conditionals; in particular we examine the Fréchet-Hoeffding bounds. Moreover, we study the reverse probabilistic inference from the conjunction Cn+1 of n + 1 conditional events to the family {Cn,En+1|Hn+1}. We consider the relation with the notion of quasi-conjunction and we examine in detail the coherence of the prevision assessments related with the conjunction of three conditional events. Based on conjunction, we also give a characterization of p-consistency and of p-entailment, with applications to several inference rules in probabilistic nonmonotonic reasoning. Finally, we examine some non p-valid inference rules; then, we illustrate by an example two methods which allow to suitably modify non p-valid inference rules in order to get inferences which are p-valid. (shrink)

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 (...) class='Hi'>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 notions of disjunction and iterated conditioning and we show that the usual probabilistic properties still hold. (shrink)

We deepen the study of conjoined and disjoined conditional events in the setting of coherence. These objects, differently from other approaches, are defined in the framework of conditional random quantities. We show that some well known properties, valid in the case of unconditional events, still hold in our approach to logical operations among conditional events. In particular we prove a decomposition formula and a related additive property. Then, we introduce the set of conditional constituents (...) generated by $n$ conditional events and we show that they satisfy the basic properties valid in the case of unconditional events. We obtain a generalized inclusion-exclusion formula, which can be interpreted by introducing a suitable distributive property. Moreover, under logical independence of basic unconditional events, we give two necessary and sufficient coherence conditions. The first condition gives a geometrical characterization for the coherence of prevision assessments on a family F constituted by n conditional events and all possible conjunctions among them. The second condition characterizes the coherence of prevision assessments defined on $F\cup K$, where $K$ is the set of conditional constituents associated with the conditional events in $F$. Then, we give some further theoretical results and we examine some examples and counterexamples. Finally, we make a comparison with other approaches and we illustrate some theoretical aspects and applications. (shrink)

We reconsider briefly the relation between "physical quantity" and "physical reality in the light of recent interpretations of Quantum Mechanics. We argue, that these interpretations are conditioned from the epistemological relation between these two fundamental concepts. In detail, the choice as ontic level of the concept affect, the relative interpretation. We note, for instance, that the informational view of quantum mechanics (primacy of the subjectivity) is due mainly to the evidence of the "random" physical quantities as ontic element. (...) We will analyze four positions: Einstein, Rovelli, d'Espagnat and Zeilinger. (shrink)

There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P(if A then B), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that P(if A then B)=P(B|A) with de Finetti’s conditional event, B | A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of (...) class='Hi'>conditional events. In this paper, we illustrate how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities, which sometimes reduce to conditional events, given logical dependencies. We also show, for the first time, how to extend the inference of centering for conditional events, inferring B|A from the conjunction A ^ B, to compounds and iterations of both conditional events and biconditional events, B || A, and generalize it to n-conditional events. (shrink)

We analyze selected iterated conditionals in the framework of conditional random quantities. We point out that it is instructive to examine Lewis's triviality result, which shows the conditions a conditional must satisfy for its probability to be the conditional probability. In our approach, however, we avoid triviality because the import-export principle is invalid. We then analyze an example of reasoning under partial knowledge where, given a conditional if A then Cas information, the probability of (...) A should intuitively increase. We explain this intuition by making some implicit background information explicit. We consider several iterated conditionals, which allow us to formalize different kinds of latent information. We verify that for these iterated conditionals the prevision is greater than or equal to the probability of A. We also investigate the lower and upper bounds of the Affirmation of the Consequent inference. We conclude our study with some remarks on the supposed "independence" of two conditionals, and we interpret this property as uncorrelation between two random quantities. 2020 Elsevier Inc. All rights reserved. (shrink)

Modus ponens (from A and “if A then C” infer C) is one of the most basic inference rules. The probabilistic modus ponens allows for managing uncertainty by transmitting assigned uncertainties from the premises to the conclusion (i.e., from P(A) and P(C|A) infer P(C)). In this paper, we generalize the probabilistic modus ponens by replacing A by the conditional event A|H. The resulting inference rule involves iterated conditionals (formalized by conditional random quantities) and propagates previsions from (...) the premises to the conclusion. Interestingly, the propagation rules for the lower and the upper bounds on the conclusion of the generalized probabilistic modus ponens coincide with the respective bounds on the conclusion for the (non-nested) probabilistic modus ponens. (shrink)

In this paper we exploit the notions of conjoined and iterated conditionals, which are defined in the setting of coherence by means of suitable conditional random quantities with values in the interval [0,1]. We examine the iterated conditional (B|K)|(A|H), by showing that A|H p-entails B|K if and only if (B|K)|(A|H) = 1. Then, we show that a p-consistent family F={E1|H1, E2|H2} p-entails a conditional event E3|H3 if and only if E3|H3= 1, or (E3|H3)|QC(S) = 1 (...) for some nonempty subset S of F, where QC(S) is the quasi conjunction of the conditional events in S. Then, we examine the inference rules And, Cut, Cautious Monotonicity, and Or of System P and other well known inference rules (Modus Ponens, Modus Tollens, Bayes). We also show that QC(F)|C(F) = 1, where C(F) is the conjunction of the conditional events in F. We characterize p-entailment by showing that F p-entails E3|H3 if and only if (E3|H3)|C(F) = 1. Finally, we examine Denial of the antecedent and Affirmation of the consequent, where the p-entailment of (E3|H3) from F does not hold, by showing that (E3|H3)|C(F) is not equal to 1. (shrink)

There is wide support in logic, philosophy, and psychology for the hypothesis that the probability of the indicative conditional of natural language, P(if A then B), is the conditional probability of B given A, P(B|A). We identify a conditional which is such that P(if A then B)=P(B|A) with de Finetti's conditional event, B|A. An objection to making this identification in the past was that it appeared unclear how to form compounds and iterations of conditional events. (...) In this paper, we illustrate how to overcome this objection with a probabilistic analysis, based on coherence, of these compounds and iterations. We interpret the compounds and iterations as conditional random quantities which, given some logical dependencies, may reduce to conditional events. We show how the inference to B|A from A and B can be extended to compounds and iterations of both conditional events and biconditional events. Moreover, we determine the respective uncertainty propagation rules. Finally, we make some comments on extending our analysis to counterfactuals. (shrink)

We present two approaches to investigate the validity of connexive principles and related formulas and properties within coherence-based probability logic. Connexive logic emerged from the intuition that conditionals of the form if not-A, thenA, should not hold, since the conditional’s antecedent not-A contradicts its consequent A. Our approaches cover this intuition by observing that the only coherent probability assessment on the conditional event $${A| \overline{A}}$$ A | A ¯ is $${p(A| \overline{A})=0}$$ p ( A | A ¯ ) (...) = 0. In the first approach we investigate connexive principles within coherence-based probabilistic default reasoning, by interpreting defaults and negated defaults in terms of suitable probabilistic constraints on conditional events. In the second approach we study connexivity within the coherence framework of compound conditionals, by interpreting connexive principles in terms of suitable conditional random quantities. After developing notions of validity in each approach, we analyze the following connexive principles: Aristotle’s theses, Aristotle’s Second Thesis, Abelard’s First Principle, and Boethius’ theses. We also deepen and generalize some principles and investigate further properties related to connexive logic (like non-symmetry). Both approaches satisfy minimal requirements for a connexive logic. Finally, we compare both approaches conceptually. (shrink)

We present a Chinese word segmentation system submitted to the closed track of Sighan bakeoff 2005. Our segmenter was built using a conditional random field sequence model that provides a framework to use a large number of linguistic features such as character identity, morphological and character reduplication features. Because our morphological features were extracted from the training corpora automatically, our system was not biased toward any particular variety of Mandarin. Thus, our system does not overfit the variety of (...) Mandarin most familiar to the system's designers. Our final system achieved a F-score of.. (shrink)

Discriminative feature-based methods are widely used in natural language processing, but sentence parsing is still dominated by generative methods. While prior feature-based dynamic programming parsers have restricted training and evaluation to artificially short sentences, we present the first general, featurerich discriminative parser, based on a conditional random field model, which has been successfully scaled to the full WSJ parsing data. Our efficiency is primarily due to the use of stochastic optimization techniques, as well as parallelization and chart prefiltering. (...) On WSJ15, we attain a state-of-the-art F-score of 90.9%, a 14% relative reduction in error over previous models, while being two orders of magnitude faster. On sentences of length 40, our system achieves an F-score of 89.0%, a 36% relative reduction in error over a generative baseline. (shrink)

We present probabilistic approaches to check the validity of selected connexive principles within the setting of coherence. Connexive logics emerged from the intuition that conditionals of the form If ∼A, then A, should not hold, since the conditional’s antecedent ∼A contradicts its consequent A. Our approach covers this intuition by observing that for an event A the only coherent probability assessment on the conditional event A|~A is p(A|~A)=0 . Moreover, connexive logics aim to capture the intuition that conditionals (...) should express some “connection” between the antecedent and the consequent or, in terms of inferences, validity should require some connection between the premise set and the conclusion. This intuition is covered by a number of principles, a selection of which we analyze in our contribution. We present two approaches to connexivity within coherence-based probability logic. Specifically, we analyze connections between antecedents and consequents firstly, in terms of probabilistic constraints on conditional events (in the sense of defaults, or negated defaults) and secondly, in terms of constraints on compounds of conditionals and iterated conditionals. After developing different notions of negations and notions of validity, we analyze the following connexive principles within both approaches: Aristotle’s Theses, Aristotle’s Second Thesis, Abelard’s First Principle and selected versions of Boethius’ Theses. We conclude by remarking that coherence-based probability logic offers a rich language to investigate the validity of various connexive principles. (shrink)

We show a number of improvements in the use of Hidden Conditional Random Fields for phone classification on the TIMIT and Switchboard corpora. We first show that the use of regularization effectively prevents overfitting, improving over other methods such as early stopping. We then show that HCRFs are able to make use of non-independent features in phone classification, at least with small numbers of mixture components, while HMMs degrade due to their strong independence assumptions. Finally, we successfully apply (...) Maximum a Posteriori adaptation to HCRFs, decreasing the phone classification error rate in the Switchboard corpus by around 1% – 5% given only small amounts of adaptation data. (shrink)

Research on reasoning about consequential arguments has been an active but piecemeal enterprise. Previous research considered in depth some subclasses ofconsequential arguments, but further understanding of consequential arguments requires that we address their greater variety, avoiding the risk of over-generalisation from specific examples. Ideally we ought to be able to systematically generate the set of consequential arguments, and then engage in random sampling of stimuli within that set. The current article aims at making steps in that direction, using the (...) theory of utility conditionals as a way to generate a large set of consequential arguments, and offering one study illustrating how the theory can be used for the random sampling of stimuli. Itis expected that further use of this method will bring more diversity to experimental research on consequential arguments, and more robustness to models of argumentation from consequences. (shrink)

I introduce a mathematical account of expectation based on a qualitative criterion of coherence for qualitative comparisons between gambles (or random quantities). The qualitative comparisons may be interpreted as an agent’s comparative preference judgments over options or more directly as an agent’s comparative expectation judgments over random quantities. The criterion of coherence is reminiscent of de Finetti’s quantitative criterion of coherence for betting, yet it does not impose an Archimedean condition on an agent’s comparative judgments, it (...) does not require the binary relation reflecting an agent’s comparative judgments to be reflexive, complete or even transitive, and it applies to an absolutely arbitrary collection of gambles, free of structural conditions (e.g., closure, measurability, etc.). Moreover, unlike de Finetti’s criterion of coherence, the qualitative criterion respects the principle of weak dominance, a standard of rational decision making that obliges an agent to reject a gamble that is possibly worse and certainly no better than another gamble available for choice. Despite these weak assumptions, I establish a qualitative analogue of de Finetti’s Fundamental Theorem of Prevision, from which it follows that any coherent system of comparative expectations can be extended to a weakly ordered coherent system of comparative expectations over any collection of gambles containing the initial set of gambles of interest. The extended weakly ordered coherent system of comparative expectations satisfies familiar additivity and scale invariance postulates (i.e., independence) when the extended collection forms a linear space. In the course of these developments, I recast de Finetti’s quantitative account of coherent prevision in the qualitative framework adopted in this article. I show that comparative previsions satisfy qualitative analogues of de Finetti’s famous bookmaking theorem and his Fundamental Theorem of Prevision.The results of this article complement those of another article (Pedersen, Strictly coherent preferences, no holds barred, Manuscript, 2013). I explain how those results entail that any coherent weakly ordered system of comparative expectations over a unital linear space can be represented by an expectation function taking values in a (possibly non-Archimedean) totally ordered field extension of the system of real numbers. The ordered field extension consists of formal power series in a single infinitesimal, a natural and economical representation that provides a relief map tracing numerical non-Archimedean features to qualitative non-Archimedean features. (shrink)

There is an increasing interest in expanding the one-parameter Lindley distribution to two-parameter, three-parameter, and five-parameter. The univariate one-parameter Lindley distribution is still one of the most applicable distributions in data analysis especially in lifetime data. Modeling dependent random quantities required bivariate parametric probability distributions. This study presents a new bivariate three-parameter probability distribution called bivariate modified Lindley distribution. The one-parameter modified Lindley distribution is used as a base line to construct the new model. Its statistical properties including (...) cumulative function, density function, marginals, moments, conditional distributions, and copula are discussed. Simulation is constructed to declare theoretical properties, to show the flexibility of the new model and to investigate the goodness of fit. Two sets of real data, financial data and UEFA Champion’s League data, are used to show the applicability of the proposed model for different types of data. (shrink)

Reestablishing feelings of control after experiencing uncertainty has long been considered a fundamental motive for human behavior. We propose that rituals (i.e., socially stipulated, causally opaque practices) provide a means for coping with the aversive feelings associated with randomness due to the perception of a connection between ritual action and a desired outcome. Two experiments were conducted (one in Brazil [n = 40] and another in the United States [n = 94]) to evaluate how the perceived efficacy of rituals is (...) affected by feelings of randomness. In a between-subjects design, the Scramble Sentence Task was used as a priming procedure in three conditions (i.e., randomness, negativity, and neutral) and participants were then asked to rate the efficacy of rituals used for problem-solving purposes. The results demonstrate that priming randomness increased participants' perception of ritual efficacy relative to negativity and neutral conditions. Implications for increasing our understanding of the relationship between perceived control and ritualistic behavior are discussed. (shrink)

Random simulation of complex dynamical systems is generally used in order to obtain information about their asymptotic behaviour (i.e., when time or size of the system tends towards infinity). A fortunate and welcome circumstance in most of the systems studied by physicists, biologists, and economists is the existence of an invariant measure in the state space allowing determination of the frequency with which observation of asymptotic states is possible. Regions found between contour lines of the surface density of this (...) invariant measure are called confiners. An example of such confiners is given for a formal neural network capable of learning. Finally, an application of this methodology is proposed in studying dependency of the network's invariant measure with regard to: 1) the mode of neurone updating (parallel or sequential), and 2) boundary conditions of the network (searching for phase transitions). (shrink)

This paper deals with the metaphysics of the notion of quantity in the philosophy of Leibniz, and its aim is to defend the following bi-conditional: for any object x, x has a certain quantity if and only if x has a (metaphysical) limit or a bound. The direction from left to right is justified in §3, while in §4 I develop an argument to justify the direction from right to left. Since the bi-conditional links the metaphysical notion of (...) limit to the mathematical notion of quantity (and in this way it links Leibniz’s metaphysics with his conception of Mathesis Universalis), it allows the use of metaphysics to clarify the features of the mathematical notion of quantity. This task is accomplished in §5 and §6. Finally, §7 discusses a possible objection. (shrink)

Beginning with a review the logically first stages in the project of Random Dynamics, hoping for all laws nature being emergent, we also review what can be considered a consequence of Random Dynamics, a model—by myself and Masao Ninomiya—, which in principle predicts the initial conditions in such a way as to minimize a certain functional of the history of the Universe through both past and future. This functional is indeed the imaginary part of the action, which exists (...) (only) in our model of complex action. The main point of the present is to suggest this complex action model to be also helpfull in solving some problems for quantum mechanics. Especially as our model almost makes it possible in principle to calculate the full history of the universe, it even makes it in principle calculable, which one among several measurement results in a quantum experiment will actually be realized!Our “complex action model” thus is a special case of superdeterminism—in Bells way—and does not have true causality, but rather even in some cases true backward causation. In fact we claim in our model that the SSC(Superconducting Supercollider) were stopped by the US Congress due to the backward causation from the big amounts of Higgs particles, which it would have produced, if it had been allowed to run. The noumenon (“das Ding an sich”) in our model is the Feyman path integrand or better some fundamental quantities determined from second order effects of the latter integrand. The quantum mechanics interpretation here is strongly similar to the much criticized “transactional interpretation” by John Cramer (Rev. Mod. Phys. 58:647–688, 1986), but we might respond to some of the criticism. (shrink)

We give derivations of two formal models of Gricean Quantity implicature and strong exhaustivity in bidirectional optimality theory and in a signalling games framework. We show that, under a unifying model based on signalling games, these interpretative strategies are game-theoretic equilibria when the speaker is known to be respectively minimally and maximally expert in the matter at hand. That is, in this framework the optimal strategy for communication depends on the degree of knowledge the speaker is known to have concerning (...) the question she is answering. In addition, and most importantly, we give a game-theoretic characterisation of the interpretation rule Grice (formalising Quantity implicature), showing that under natural conditions this interpretation rule occurs in the unique equilibrium play of the signalling game. (shrink)

In quantity discrimination tasks, adults, infants and animals have been sometimes observed to process number only after all continuous variables, such as area or density, have been controlled for. This has been taken as evidence that processing number may be more cognitively demanding than processing continuous variables. We tested this hypothesis by training mosquitofish to discriminate two items from three in three different conditions. In one condition, continuous variables were controlled while numerical information was available; in another, the number was (...) kept constant and information relating to continuous variables was available; in the third condition, stimuli differed for both number and continuous quantities. Fish learned to discriminate more quickly when both number and continuous information were available compared to when they could use continuous information only or number only; there was no difference in the learning rate between the two latter conditions. Our results do not support the hypothesis that processing numbers imposes a higher cognitive load than processing continuous variables. Rather, they suggest that availability of multiple information sources may facilitate discrimination learning. (shrink)

We study finite ℓ‐colourable structures with an underlying pregeometry. The probability measure that is used corresponds to a process of generating such structures by which colours are first randomly assigned to all 1‐dimensional subspaces and then relationships are assigned in such a way that the colouring conditions are satisfied but apart from this in a random way. We can then ask what the probability is that the resulting structure, where we now forget the specific colouring of the generating process, (...) has a given property. With this measure we get the following results: (1) A zero‐one law. (2) The set of sentences with asymptotic probability 1 has an explicit axiomatisation which is presented. (3) There is a formula (not directly speaking about colours) such that, with asymptotic probability 1, the relation “there is an ℓ‐colouring which assigns the same colour to x and y” is defined by. (4) With asymptotic probability 1, an ℓ‐colourable structure has a unique ℓ‐colouring (up to permutation of the colours). (shrink)

We give derivations of two formal models of Gricean Quantity implicature and strong exhaustivity in bidirectional optimality theory and in a signalling games framework. We show that, under a unifying model based on signalling games, these interpretative strategies are game-theoretic equilibria when the speaker is known to be respectively minimally and maximally expert in the matter at hand. That is, in this framework the optimal strategy for communication depends on the degree of knowledge the speaker is known to have concerning (...) the question she is answering. In addition, and most importantly, we give a game-theoretic characterisation of the interpretation rule Grice (formalising Quantity implicature), showing that under natural conditions this interpretation rule occurs in the unique equilibrium play of the signalling game. (shrink)

Is Big Data science a whole new way of doing research? And what difference does data quantity make to knowledge production strategies and their outputs? I argue that the novelty of Big Data science does not lie in the sheer quantity of data involved, but rather in the prominence and status acquired by data as commodity and recognised output, both within and outside of the scientific community and the methods, infrastructures, technologies, skills and knowledge developed to handle data. These developments (...) generate the impression that data-intensive research is a new mode of doing science, with its own epistemology and norms. To assess this claim, one needs to consider the ways in which data are actually disseminated and used to generate knowledge. Accordingly, this article reviews the development of sophisticated ways to disseminate, integrate and re-use data acquired on model organisms over the last three decades of work in experimental biology. I focus on online databases as prominent infrastructures set up to organise and interpret such data and examine the wealth and diversity of expertise, resources and conceptual scaffolding that such databases draw upon. This illuminates some of the conditions under which Big Data needs to be curated to support processes of discovery across biological subfields, which in turn highlights the difficulties caused by the lack of adequate curation for the vast majority of data in the life sciences. In closing, I reflect on the difference that data quantity is making to contemporary biology, the methodological and epistemic challenges of identifying and analysing data given these developments, and the opportunities and worries associated with Big Data discourse and methods. (shrink)

Gundel, Hedberg and Zacharski propose a framework whereby different referring forms conventionally signal different cognitive statuses on an implica-tional 'givenness hierarchy'. Interaction of the hierarchy with Grice's Maxim of Quantity gives rise to scalar implicatures which further constrain the choice among forms and their interpretations when necessary conditions for more than one form are met. Wilson and Matsui show that reference assignment for NPs introduced by the definite article is constrained within Relevance Theory by the automatic selection of an interpretation (...) that yields adequate contextual effects for minimal processing effort. This paper proposes that an optimal account of how people understand the intended referent of an NP must appeal to both the Givenness Hierarchy and Relevance Theory. Such an account still requires the first part of the Quantity Maxim, however, either as a socially based assumption or as part of the Principle of Relevance itself. (shrink)

In this essay I propose a new measure of social welfare. It captures the intuitive idea that quantity, quality, and equality of individual welfare all matter for social welfare. More precisely, it satisfies six conditions: Equivalence, Dominance, Quality, Strict Monotonicity, Equality and Asymmetry. These state that i) populations equivalent in individual welfare are equal in social welfare; ii) a population that dominates another in individual welfare is better; iii) a population that has a higher average welfare than another population is (...) better, other things being equal; iv) the addition of a well-faring individual makes a population better, whereas the addition of an ill-faring individual makes a population worse; v) a population that has a higher degree of equality than another population is better, other things being equal; and vi) individual illfare matters more for social welfare than individual welfare. By satisfying the six conditions, the measure improves on previously proposed measures, such as the utilitarian Total and Average measures, as well as different kinds of Prioritarian measures. (shrink)

By pitting John Cage against Andy Warhol, Arthur Danto shows how the arts themselves were gripped by a progressive logic that aimed at only one goal: to overcome the gap between art and life. The non‐tautological reading preserves a fundamental, philosophical difference between commonplace and art objects. The semantical space accounts for the aboutness of the work and is thus the necessary condition for something to be an artwork. Together with other Pop artists, Rauschenberg transformed the Artworld, while Cage aimed (...) at a re‐enfranchisement of the commonplace. Danto writes that his Buddhist phase came to an end when he, as a philosopher, felt the need for theories. The works of Fluxus and Cage, in the end, accepted asylum within the sanctuary of the Artworld, where they became less radical, and perhaps less radical than Pop. (shrink)

Most theories and hypotheses in psychology are verbal in nature, yet their evaluation overwhelmingly relies on inferential statistical procedures. The validity of the move from qualitative to quantitative analysis depends on the verbal and statistical expressions of a hypothesis being closely aligned – that is, that the two must refer to roughly the same set of hypothetical observations. Here, I argue that many applications of statistical inference in psychology fail to meet this basic condition. Focusing on the most widely used (...) class of model in psychology – the linear mixed model – I explore the consequences of failing to statistically operationalize verbal hypotheses in a way that respects researchers' actual generalization intentions. I demonstrate that although the “random effect” formalism is used pervasively in psychology to model intersubject variability, few researchers accord the same treatment to other variables they clearly intend to generalize over. The under-specification of random effects imposes far stronger constraints on the generalizability of results than most researchers appreciate. Ignoring these constraints can dramatically inflate false-positive rates, and often leads researchers to draw sweeping verbal generalizations that lack a meaningful connection to the statistical quantities they are putatively based on. I argue that failure to take the alignment between verbal and statistical expressions seriously lies at the heart of many of psychology's ongoing problems, and conclude with a discussion of several potential avenues for improvement. (shrink)

The study of Martin‐Löf randomness on a computable metric space with a computable measure has seen much progress recently. In this paper we study Martin‐Löf randomness on a more general space, that is, a computable topological space with a computable measure. On such a space, Martin‐Löf randomness may not be a natural notion because there is no universal test, and Martin‐Löf randomness and complexity randomness (defined in this paper) do not coincide in general. We show that SCT3 is a sufficient (...) condition for the existence and coincidence, and study how much we can weaken this condition. (shrink)

Newton published his deduction of universal gravity in Principia (first ed., 1687). To establish the universality (the particle-to-particle nature) of gravity, Newton must establish the additivity of mass. I call ‘additivity’ the property a body's quantity of matter has just in case, if gravitational force is proportional to that quantity, the force can be taken to be the sum of forces proportional to each particle's quantity of matter. Newton's argument for additivity is obscure. I analyze and assess manuscript versions of (...) Newton's initial argument within his initial deduction, dating from early 1685. Newton's strategy depends on distinguishing two quantities of matter, which I call ‘active’ and ‘passive’, by how they are measured. These measurement procedures frame conditions on the additivity of each quantity so measured. While Newton has direct evidence for the additivity of passive quantity of matter, he does not for that of the active quantity. Instead, he tries to infer the latter from the former via conceptual analyses of the third law of motion grounded largely on analogies to magnetic attractions. The conditions needed to establish passive additivity frustrate Newton's attempted inference to active additivity. (shrink)

The way research is, and should be, funded by the public sphere is the subject of renewed interest for sociology, economics, management sciences, and more recently, for the philosophy of science. In this contribution, I propose a qualitative, epistemological criticism of the funding by lottery model, which is advocated by a growing number of scholars as an alternative to peer-review. This lottery scheme draws on the lack of efficiency and of robustness of the peer-review based evaluation to argue that the (...) majority of public resources for basic science should be allocated randomly. I first differentiate between two distinct arguments used to defend this alternative funding scheme based on considerations about the logic of scientific research. To assess their epistemological limits, I then present and develop a conceptual frame, grounded on the notion of “system of practice”, which can be used to understand what precisely it means, for a research project, to be interesting or significant. I use this epistemological analysis to show that the lottery model is not theoretically optimal, since it underestimates the integration of all scientific projects in densely interconnected systems of conceptual, experimental, or technical practices which confer their proper interest to them. I also apply these arguments in order to criticize the classical peer-review process. I finally suggest, as a discussion, that some recently proposed models that bring to the fore a principle of decentralization of the evaluation and selection process may constitute a better alternative, if the practical conditions of their implementation are adequately settled. (shrink)

A study is reported testing two hypotheses about a close parallel relation between indicative conditionals, if A then B , and conditional bets, I bet you that if A then B . The first is that both the indicative conditional and the conditional bet are related to the conditional probability, P(B|A). The second is that de Finetti's three-valued truth table has psychological reality for both types of conditional— true , false , or void for indicative (...) conditionals and win , lose , or void for conditional bets. The participants were presented with an array of chips in two different colours and two different shapes, and an indicative conditional or a conditional bet about a random chip. They had to make judgements in two conditions: either about the chances of making the indicative conditional true or false or about the chances of winning or losing the conditional bet. The observed distributions of responses in the two conditions were generally related to the conditional probability, supporting the first hypothesis. In addition, a majority of participants in further conditions chose the third option, “void”, when the antecedent of the conditional was false, supporting the second hypothesis. (shrink)

Immanuel Kant's Metaphysical Foundations of Natural Science (1786) provides metaphysical foundations for the application of mathematics to empirically given nature. The application that Kant primarily has in mind is that achieved in Isaac Newton's Principia (1687). Thus, Kant's first chapter, the Phoronomy, concerns the mathematization of speed or velocity, and his fourth chapter, the Phenomenology, concerns the empirical application of the Newtonian notions of true or absolute space, time, and motion. This paper concentrates on Kant's second and third chapters—the Dynamics (...) and the Mechanics, respectively—and argues that they are best read as providing a transcendental explanation of the conditions for the possibility of applying the (mathematical) concept of quantity of matter to experience. Kant again has in mind the empirical measures of this quantity that Newton fashions in the Principia, and he aims to make clear, in particular, how Newton achieves a universal measure for all bodies whatsoever by projecting the static quantity of terrestrial weight into the heavens by means of the theory of universal gravitation. Kant is not attempting to prove a priori what Newton has established empirically but, rather, to clarify the character of Newton's mathematization by building Newton's empirical measures into the very concept of matter that is articulated in the Metaphysical Foundations. (shrink)

I have argued that there is a philosophical problem posed by a need to determine the reference of expressions which seem to refer to kinds of stuff or matter and to make identity claims about it (e.g., ‘the gold’, ‘the same clay’). Ordinary sortal expressions such as ‘lump’, and ‘piece’ have been shown to be inadequate to the task of providing reference for the expressions in question. What is necessary is an expression which does not have an ordinary sortal use (...) and which meets certain other conditions which I have enumerated. There does not seem to be an expression in ordinary language which fits these conditions. The technical term, ‘quantity’, as defined by Helen Cartwright, meet the conditions. ‘Parcel’, suggested V. C. Chappell, fails to meet the conditions. Another technical term, ‘m-elements’, coined by Laycock, comes close to meeting the conditions, but has a number of difficulties. Mose of these difficulties stem from the fact that counting (rather than measuring, as with quantities) is behind the application of ‘m-elements’, and stuff is as a matter of fact measured, rather than counted, in most situations. I have also considered a possible difficulty with ‘quantity’ (that in most cases in which someone talks of ‘same stuff’ strictly speaking we don't have the same quantity of stuff) and shown it not to be a genuine difficulty. (shrink)

The connection between the probabilities of conditionals and the corresponding conditional probabilities has long been explored in the philosophical literature, but its implementation faces both technical obstacles and objections on empirical grounds. In this paper I ?rst outline the motivation for the probabilistic turn and Lewis’ triviality results, which stand in the way of what would seem to be its most straightforward implementation. I then focus on Richard Jeffrey’s ’random-variable’ approach, which circumvents these problems by giving up the (...) notion that conditionals denote propositions in the usual sense. Even so, however, the random-variable approach makes counterintuitive predictions in simple cases of embedded conditionals. I propose to address this problem by enriching the model with an explicit representation of causal dependencies. The addition of such causal information not only remedies the shortcomings of Jeffrey’s conditional, but also opens up the possibility of a uni?ed probabilistic account of indicative and counterfactual conditionals. (shrink)