This paper concerns the extent to which uncertain propositional reasoning can track probabilistic reasoning, and addresses kinematic problems that extend the familiar Lottery paradox. An acceptance rule assigns to each Bayesian credal state p a propositional belief revision method B p , which specifies an initial belief state B p (T) that is revised to the new propositional belief state B(E) upon receipt of information E. An acceptance rule tracks Bayesian conditioning when B p (E) = B p|E (T), for (...) every E such that p(E) > 0; namely, when acceptance by propositional belief revision equals Bayesian conditioning followed by acceptance. Standard proposals for uncertain acceptance and belief revision do not track Bayesian conditioning. The "Lockean" rule that accepts propositions above a probability threshold is subject to the familiar lottery paradox (Kyburg 1961), and we show that it is also subject to new and more stubborn paradoxes when the tracking property is taken into account. Moreover, we show that the familiar AGM approach to belief revision (Harper, Synthese 30(1-2):221-262, 1975; Alchourrón et al., J Symb Log 50:510-530, 1985) cannot be realized in a sensible way by any uncertain acceptance rule that tracks Bayesian conditioning. Finally, we present a plausible, alternative approach that tracks Bayesian conditioning and avoids all of the paradoxes. It combines an odds-based acceptance rule proposed originally by Levi (1996) with a non-AGM belief revision method proposed originally by Shoham (1987). (shrink)

“Since today is Saturday, the grocery store is open today and will be closed tomorrow; so let’s go today”. That is an example of everyday practical reasoning—reasoning directly with the propositions that one believes but may not be fully certain of. Everyday practical reasoning is one of our most familiar kinds of decisions but, unfortunately, some foundational questions about it are largely ignored in the standard decision theory: (Q1) What are the decision rules in everyday practical reasoning that connect qualitative (...) belief and desire to preference over acts? (Q2) What sort of logic should govern qualitative beliefs in everyday practical reasoning, and to what extent is that logic necessary for the purposes of qualitative decisions? (Q3) What kinds of qualitative decisions are always representable as results of everyday practical reasoning? (Q4) Under what circumstances do the results of everyday practical reasoning agree with the Bayesian ideal of expected utility maximization? This paper proposes a rigorous decision theory for answering all of those questions, which is developed in parallel to Savage’s (1954) foundation of expected utility maximization. In light of a new representation result, everyday practical reasoning provides a sound and complete method for a very wide class of qualitative decisions; and, to that end, qualitative beliefs must be allowed to be closed under classical logic plus a well-known nonmonotonic logic—the so-called system ℙ. (shrink)

History and Philosophy of Logic, Volume 32, Issue 2, Page 187-191, May 2011.

The Oxford Handbook of Philosophy and Race provides up-to-date explanation and analyses by leading scholars of contemporary issues in African American philosophy and philosophy of race. These original essays encompass the major topics and approaches in this emerging philosophical subfield that supports demographic inclusion and diversity while at the same time strengthening the conceptual arsenal of social and political philosophy. Over the course of the volume's ten topic-based sections, ideas about race held by Locke, Hume, Kant, Hegel, and Nietzsche are (...) supplemented by suppressed thought from the African diaspora, early twentieth-century African American perspectives and Native-, Asian-, and Latin-, American views. The contributors bring philosophical analysis to bear on the status of racial divisions as categories of humanity in the biological sciences, as well as within contemporary criticism and conceptual analysis. Essays present the special applications of American philosophy and continental philosophy to ideas of race as methodological alternatives to more analytic approaches. As a collection of analyses and assessments of 'race' in the real world, the volume pays trenchant and relevant attention to historical and contemporary racism and what it means to say that 'race' and racial identities are socially constructed. The essays analyze contemporary social issues including the importance of racial difference and identity in education, public health, medicine, IQ and other standardized tests, and sports. Additionally, the essays consider the societal limitations and structures provided by public policy and law. As a critical theory, the volume compares the study of race to feminism. Historical and contemporary, academic and popular, racisms pertaining to male and female gender receive special consideration throughout the volume. While this comprehensive collection may have the effect of a textbook, each of the original essays is a fresh and authentic development of important present thought. (shrink)

While the epistemic significance of disagreement has been a popular topic in epistemology for at least a decade, little attention has been paid to logical disagreement. This monograph is meant as a remedy. The text starts with an extensive literature review of the epistemology of (peer) disagreement and sets the stage for an epistemological study of logical disagreement. The guiding thread for the rest of the work is then three distinct readings of the ambiguous term ‘logical disagreement’. Chapters 1 and (...) 2 focus on the Ad Hoc Reading according to which logical disagreements occur when two subjects take incompatible doxastic attitudes toward a specific proposition in or about logic. Chapter 2 presents a new counterexample to the widely discussed Uniqueness Thesis. Chapters 3 and 4 focus on the Theory Choice Reading of ‘logical disagreement’. According to this interpretation, logical disagreements occur at the level of entire logical theories rather than individual entailment-claims. Chapter 4 concerns a key question from the philosophy of logic, viz., how we have epistemic justification for claims about logical consequence. In Chapters 5 and 6 we turn to the Akrasia Reading. On this reading, logical disagreements occur when there is a mismatch between the deductive strength of one’s background logic and the logical theory one prefers (officially). Chapter 6 introduces logical akrasia by analogy to epistemic akrasia and presents a novel dilemma. Chapter 7 revisits the epistemology of peer disagreement and argues that the epistemic significance of central principles from the literature are at best deflated in the context of logical disagreement. The chapter also develops a simple formal model of deep disagreement in Default Logic, relating this to our general discussion of logical disagreement. The monograph ends in an epilogue with some reflections on the potential epistemic significance of convergence in logical theorizing. (shrink)

This paper briefly outlines some advancements in paraconsistent logics for modelling knowledge representation and reasoning. Emphasis is given on the so-called Logics of Formal Inconsistency (LFIs), a class of paraconsistent logics that formally internalize the very concept(s) of consistency and inconsistency. A couple of specialized systems based on the LFIs will be reviewed, including belief revision and probabilistic reasoning. Potential applications of those systems in the AI area of KRR are tackled by illustrating some examples that emphasizes the importance of (...) a fine-tuned treatment of consistency in modelling reputation systems, preferences, argumentation, and evidence. (shrink)

Computational complexity is a discipline of computer science and mathematics which classifies computational problems depending on their inherent difficulty, i.e. categorizes algorithms according to their performance, and relates these classes to each other. P problems are a class of computational problems that can be solved in polynomial time using a deterministic Turing machine while solutions to NP problems can be verified in polynomial time, but we still do not know whether they can be solved in polynomial time as well. A (...) solution for the so-called NP-complete problems will also be a solution for any other such problems. Its artificial-intelligence analogue is the class of AI-complete problems, for which a complete mathematical formalization still does not exist. In this chapter we will focus on analysing computational classes to better understand possible formalizations of AI-complete problems, and to see whether a universal algorithm, such as a Turing test, could exist for all AI-complete problems. In order to better observe how modern computer science tries to deal with computational complexity issues, we present several different deep-learning strategies involving optimization methods to see that the inability to exactly solve a problem from a higher order computational class does not mean there is not a satisfactory solution using state-of-the-art machine-learning techniques. Such methods are compared to philosophical issues and psychological research regarding human abilities of solving analogous NP-complete problems, to fortify the claim that we do not need to have an exact and correct way of solving AI-complete problems to nevertheless possibly achieve the notion of strong AI. (shrink)

In researching presuppositions dealing with logic and dynamic of belief we distinguish two related parts. The first part refers to presuppositions and logic, which is not necessarily involved with intentional operators. We are primarily concerned with classical, free and presuppositonal logic. Here, we practice a well known Strawson’s approach to the problem of presupposition in relation to classical logic. Further on in this work, free logic is used, especially Van Fraassen’s research of the role of presupposition in supervaluations logical systems. (...) At the end of the first part, presuppositional logic, advocated by S.K. Thomason, is taken into consideration. The second part refers to the presuppositions in relation to the logic of the dynamics of belief. Here the logic of belief change is taken into consideration and other epistemic notions with immanent mechanism for the presentation of the dynamics. Three representative and dominant approaches are evaluated. First, we deal with new, less classical, situation semantics. Besides Strawson’s theory, the second theory is the theory of the belief change, developed by Alchourron, Gärdenfors, and Makinson (AGM theory). At the end, the oldest, universal, and dominant approach is used, recognized as Hintikka’s approach to the analysis of epistemic notions. (shrink)

This chapter has two main goals: to update philosophers on the state of the art in the scientific psychology of intelligence, and to explain and evaluate challenges to the measurement invariance of intelligence tests. First, we provide a brief history of the scientific psychology of intelligence. Next, we discuss the metaphysics of intelligence in light of scientific studies in psychology and neuroimaging. Finally, we turn to recent skeptical developments related to measurement invariance. These have largely focused on attributability: Where do (...) the mechanisms and dispositions that explain people’s performance on tests of intelligence inhere – in the agent, in the local testing environment, in the culture, or in the interactions among these? After explaining what measurement invariance is in the context of intelligence testing, we explore the phenomenon of stereotype threat as a challenge to measurement invariance, as well as more recent work on overcoming or buffering against stereotype threat. (shrink)

Turingin testi, interrogatiivimalli ja tekoäly.

This paper investigates how the simulation of intelligence, an activity that has been considered the notional task of Artificial Intelligence, does not comprise its duplication. Briefly touching on the distinction between conceivability and possibility, and commenting on Ryan’s approach to fiction in terms of the interplay between possible worlds and her principle of minimal departure, we specify verisimilitude in Artificial Intelligence as the accurate resemblance of intelligence by its simulation and, from this characterization, claim the metaphysical impossibility of duplicating intelligence, (...) as neither verisimilarly nor convincingly simulating intelligence involves its duplication. To this end, we argue by a representative case of simulation that, albeit conceivable, Turing’s test for machine intelligence wrongly equates the occurrence of indistinguishable intelligence performance to intelligence duplication, which is grounded in a prima facie conceivable but metaphysically impossible view that separates intelligence from its origin. Finally, we establish the following criterion for evaluating simulation in Artificial Intelligence: simulations succeed in AI if and only if they are able to epistemically persuade human beings that intelligence has been duplicated, that is, if and only if verisimilar simulations can convincingly minimally depart from actual intelligence. (shrink)