The applicability of Bayesian conditionalization in setting one’s posterior probability for a proposition, α, is limited to cases where the value of a corresponding prior probability, PPRI(α|∧E), is available, where ∧E represents one’s complete body of evidence. In order to extend probability updating to cases where the prior probabilities needed for Bayesian conditionalization are unavailable, I introduce an inference schema, defeasible conditionalization, which allows one to update one’s personal probability in a proposition by conditioning on a proposition that represents a (...) proper subset of one’s complete body of evidence. While defeasible conditionalization has wider applicability than standard Bayesian conditionalization (since it may be used when the value of a relevant prior probability, PPRI(α|∧E), is unavailable), there are circumstances under which some instances of defeasible conditionalization are unreasonable. To address this difficulty, I outline the conditions under which instances of defeasible conditionalization are defeated. To conclude the article, I suggest that the prescriptions of direct inference and statistical induction can be encoded within the proposed system of probability updating, by the selection of intuitively reasonable prior probabilities. (shrink)

This article describes the Vaccine/Injury Project Corpus, a collection of legal decisions awarding or denying compensation for health injuries allegedly due to vaccinations, together with models of the logical structure of the reasoning of the factfinders in those cases. This unique corpus provides useful data for formal and informal logic theory, for natural-language research in linguistics, and for artificial intelligence research. More importantly, the article discusses lessons learned from developing protocols for manually extracting the logical structure and generating the logic (...) models. It identifies sub-tasks in the extraction process, discusses challenges to automation, and provides insights into possible solutions for automation. In particular, the framework and strategies developed here, together with the corpus data, should allow “top–down” and contextual approaches to automation, which can supplement “bottom-up” linguistic approaches. Illustrations throughout the article use examples drawn from the Corpus. (shrink)

Philosophical interest in the role of self-locating information in the confirmation of hypotheses has intensified in virtue of the Sleeping Beauty problem. If the correct solution to that problem is 1/3, various attractive views on confirmation and probabilistic reasoning appear to be undermined; and some writers have used the problem as a basis for rejecting some of those views. My interest here is in two such views. One of them is the thesis that self-locating information cannot be evidentially relevant to (...) a non-self-locating hypothesis. The other, a basic tenet of Bayesian confirmation theory, is the thesis that an ideally rational agent updates her credence in a non-self-locating hypothesis in response to new information only by conditionalization. I argue that we can disprove these two theses by way of cases that are much less puzzling than Sleeping Beauty. I present two such cases in this paper. (shrink)

The article begins by describing two longstanding problems associated with direct inference. One problem concerns the role of uninformative frequency statements in inferring probabilities by direct inference. A second problem concerns the role of frequency statements with gerrymandered reference classes. I show that past approaches to the problem associated with uninformative frequency statements yield the wrong conclusions in some cases. I propose a modification of Kyburg’s approach to the problem that yields the right conclusions. Past theories of direct inference have (...) postponed treatment of the problem associated with gerrymandered reference classes by appealing to an unexplicated notion of projectability . I address the lacuna in past theories by introducing criteria for being a relevant statistic . The prescription that only relevant statistics play a role in direct inference corresponds to the sort of projectability constraints envisioned by past theories. (shrink)

In a recent article, Joel Pust argued that direct inference based on reference properties of differing arity are incommensurable, and so direct inference cannot be used to resolve the Sleeping Beauty problem. After discussing the defects of Pust's argument, I offer reasons for thinking that direct inferences based on reference properties of differing arity are commensurable, and that we should prefer direct inferences based on logically stronger reference properties, regardless of arity.

In a recent issue of Analysis I gave a critique of some arguments made by Di Nucci concerning the so-called Simple View – the view that an agent performs an action intentionally only if he intends so to act. In turn Di Nucci offers a reply that concentrates on two points. The first has to do with a group of examples, one having to do with waking a flatmate, and the others with routine actions such as shifting gears while driving. (...) I rejected these examples, arguing that it is not at all obvious that in them the Simple View is violated. Additionally, I pointed out that these are not cases of agents doing something they thought they could not do, and so have no direct bearing on the issues of practical rationality that motivate Bratman's treatment of the Simple View, which Di Nucci is concerned to defend . Di Nucci accepts this second point. He claims, however, that I failed to understand the dialectic of his argument. …. (shrink)

One argument for the thirder position on the Sleeping Beauty problem rests on direct inference from objective probabilities. In this paper, I consider a particularly clear version of this argument by John Pollock and his colleagues (The Oscar Seminar 2008). I argue that such a direct inference is defeated by the fact that Beauty has an equally good reason to conclude on the basis of direct inference that the probability of heads is 1/2. Hence, neither thirders nor halfers can find (...) direct support in an appeal to objective probabilities. (shrink)

In Thinking and Acting John Pollock offers some criticisms of Bayesian epistemology, and he defends an alternative understanding of the role of probability in epistemology. Here, I defend the Bayesian against some of Pollock's criticisms, and I discuss a potential problem for Pollock's alternative account.

This article sketches a theory of objective probability focusing on nomic probability, which is supposed to be the kind of probability figuring in statistical laws of nature. The theory is based upon a strengthened probability calculus and some epistemological principles that formulate a precise version of the statistical syllogism. It is shown that from this rather minimal basis it is possible to derive theorems comprising (1) a theory of direct inference, and (2) a theory of induction. The theory of induction (...) is not of the familiar Bayesian variety, but consists of a precise version of the traditional Nicod Principle and its statistical analogues. (shrink)

List and Pettit have stated an impossibility theorem about the aggregation of individual opinion states. Building on recent work on the lottery paradox, this paper offers a variation on that result. The present result places different constraints on the voting agenda and the domain of profiles, but it covers a larger class of voting rules, which need not satisfy the proposition-wise independence of votes.

An argument is self-defeating when it contains defeaters for some of its own defeasible lines. It is shown that the obvious rules for defeat among arguments do not handle self-defeating arguments correctly. It turns out that they constitute a pervasive phenomenon that threatens to cripple defeasible reasoning, leading to almost all defeasible reasoning being defeated by unexpected interactions with self-defeating arguments. This leads to some important changes in the general theory of defeasible reasoning.

An influential argument for anti-reductionism about testimony, due to CAJ Coady, fails, because it assumes that an inductive global defense of testimony would proceed along effectively behaviorist lines. If we take seriously our wealth of non-testimonially justified folk psychological beliefs, the prospects for inductivism and reductionism look much better.

Mainstream epistemology is a highly theoretical and abstract enterprise. Traditional epistemologists rarely present their deliberations as critical to the practical problems of life, unless one supposes—as Hume, for example, did not—that skeptical worries should trouble us in our everyday affairs. But some issues in epistemology are both theoretically interesting and practically quite pressing. That holds of the problem to be discussed here: how laypersons should evaluate the testimony of experts and decide which of two or more rival experts is most (...) credible. It is of practical importance because in a complex, highly specialized world people are constantly confronted with situations in which, as comparative novices, they must turn to putative experts for intellectual guidance or assistance. It is of theoretical interest because the appropriate epistemic considerations are far from transparent; and it is not clear how far the problems lead to insurmountable skeptical quandaries. This paper does not argue for flat-out skepticism in this domain; nor, on the other hand, does it purport to resolve all pressures in the direction of skepticism. It is an exploratory paper, which tries to identify problems and examine some possible solutions, not to establish those solutions definitively. (shrink)

I argue that any broadly dispositional analysis of probability will either fail to give an adequate explication of probability, or else will fail to provide an explication that can be gainfully employed elsewhere (for instance, in empirical science or in the regulation of credence). The diversity and number of arguments suggests that there is little prospect of any successful analysis along these lines.

In 2001, W. Carnielli and Marcos considered a 3-valued logic in order to prove that the schema ϕ ∨ (ϕ → ψ) is not a theorem of da Costa’s logic Cω. In 2006, this logic was studied (and baptized) as G'3 by Osorio et al. as a tool to define semantics of logic programming. It is known that the truth-tables of G'3 have the same expressive power than the one of Łukasiewicz 3-valued logic as well as the one of Gödel (...) 3-valued logic G3. From this, the three logics coincide up-to language, taking into acccount that 1 is the only designated truth-value in these logics. -/- From the algebraic point of view, Canals-Frau and Figallo have studied the 3-valued modal implicative semilattices, where the modal operator is the well-known Moisil-Monteiro-Baaz Δ operator, and the supremum is definable from this. We prove that the subvariety obtained from this by adding a bottom element 0 is term-equivalent to the variety generated by the 3-valued algebra of G'3. The algebras of that variety are called G'3-algebras. From this result, we obtain the equations which axiomatize the variety of G'3-algebras. Moreover, we prove that this variety is semisimple, and the 3-element and the 2-element chains are the unique simple algebras of the variety. Finally an extension of G'3 to first-order languages is presented, with an algebraic semantics based on complete G'3-algebras. The corresponding soundness and completeness theorems are obtained. (shrink)

“Double-halfers” think that throughout the Sleeping Beauty Scenario, Beauty ought to maintain a credence of 1/2 in the proposition that the fair coin toss governing the experimental protocol comes up heads. Titelbaum (2012) introduces a novel variation on the standard scenario, one involving an additional coin toss, and claims that the double-halfer is committed to the absurd and embarrassing result that Beauty’s credence in an indexical proposition concerning the outcome of a future fair coin toss is not 1/2. I argue (...) that there is no reason to regard the credence required by the double-halfer as any less acceptable than the one deemed required by Titelbaum. (shrink)

O argumento zumbi negativo parte das premissas de que p ∧ ¬q é idealmente negativamente concebível, de que o que é idealmente negativamente concebível é possível e de que o fisicalismo é incompatível com a possibilidade de p ∧ ¬q para concluir que o fisicalismo é falso. No argumento, p é a conjunção das verdades e leis físicas fundamentais e q é uma verdade fenomenal qualquer. Uma sentença φ é idealmente negativamente concebível sse um raciocinador ideal não acredita que ¬φ (...) em reflexão priori. Uma versão da tese da escrutabilidade pressuposta pelo argumento afirma que, para todo φ que sobrevém em p, o raciocinador ideal acredita que p → φ em reflexão a priori. Nesse artigo, argumento que, dado algumas interpretações relevantes da noção de probabilidade (pr(.)), o raciocinador ideal acredita verdadeiramente, para todo φ, que p → pr(φ) = x em reflexão a priori. Mas então, dependendo do valor de pr(q) e das correlações entre q e outras sentenças, o raciocinador ideal também acredita (provavelmente, verdadeiramente) que p → q em reflexão a priori. Então, para alguns qs relevantes, p ∧ ¬q não é idealmente negativamente concebível e o argumento zumbi tem uma premissa falsa. A escolha de um q adequado dependeria de informação empírica, o que faria o argumento zumbi não ser nem conclusivo, nem a priori. ENGLISH: The negative zombie argument has as premises that p∧¬q is ideally negatively conceivable, that what is ideally negatively conceivable is possible, and that Physicalism is incompatible with p∧¬q being possible and as conclusion that Physicalism is false. In the argument, p is the conjunction of the fundamental physical truths and laws and q is an arbitrary phenomenal truth. A sentence φ is ideally negatively conceivable if and only if an ideal reasoner does not believe that ¬φ on a priori reflection. The argument presupposes a version of the scrutability thesis stating that, for all φ that supervene on p, the ideal reasoner believes that p → φ on a priori reflection. In this paper, I argue that, given relevant interpretation of probabilities, the ideal reasoner believes truly, for all φ, that p → pr(φ) = x on a priori reflection. But then, depending on the value of pr(q) and the correlations between q and other sentences, the ideal reasoner also believes (probably, truly) that p → q on a priori reflection. For some relevant qs, p∧¬q is not ideally negatively conceivable and the zombie argument has a false premise. The choice of an adequate q depends on empirical information, what makes the zombie argument neither conclusive nor a priori. (shrink)

The most widespread models of rational reasoners (the model based on modal epistemic logic and the model based on probability theory) exhibit the problem of logical omniscience. The most common strategy for avoiding this problem is to interpret the models as describing the explicit beliefs of an ideal reasoner, but only the implicit beliefs of a real reasoner. I argue that this strategy faces serious normative issues. In this paper, I present the more fundamental problem of logical omnipotence, which highlights (...) the normative content of the problem of logical omniscience. I introduce two developments of the notion of implicit belief (accessible and stable belief ) and use them in two versions of the most common strategy applied to the problem of logical omnipotence. (shrink)

O presente volume se trata de uma coletânea de artigos que reúne alguns dos trabalhos propostos para o evento “III International Colloquium of Analytic Epistemology and VII Conference of Social Epistemology”, realizado entre os dias 27 e 30 de Novembro de 2018, na Universidade Federal de Santa Maria. O “III International Colloquium of Analytic Epistemology and VII Conference of Social Epistemology” é um dos principais eventos de Epistemologia analítica da América Latina e reúne especialistas do Brasil e do exterior para (...) promover debates de alto nível sobre temas que fazem parte da agenda contemporânea no que se refere ao debate analítico contemporâneo acerca da Epistemologia. (shrink)

The author uses a series of potential counterexamples to argue against attempts by Bergmann and Plantinga to articulate a distinction between malignant and benign epistemic circularity and, more radically, to argue that epistemic circularity per se is no fallacy, and the concept of epistemic circularity plays no role in the explanation of why some instances of epistemic circularity are irrational. The author contrasts an inferential framework, in which circularity is a problem, with an equilibrium framework, in which the concept of (...) circularity plays no useful role and argues that defeasible reasoning can only be understood in an equilibrium, not an inferential, framework. The author uses an example of reasoning about the reliability of one’s own memory to explain how seemingly malignant epistemic circularity can be rational in an equilibrium framework. The author discusses the relevance of this conclusion to two contemporary issues: the cogency of Plantinga’s Evolutionary Argument against Naturalism and the evolutionary naturalists’ challenges to non-naturalist moral realism—and, indeed, to all forms of non-naturalist normative realism. (shrink)

Given plausible assumptions about the nature of evidence and undercutting defeat, many believe that the force of the evidential problem of evil depends on sceptical theism’s being false: if evil is...

ABSTRACTAchievements are among the things that make a life good. Assessing the plausibility of this intuitive claim requires an account of the nature of achievements. One necessary condition for achievement appears to be that the achieving agent acted competently, i.e. was not just lucky. I begin by critically assessing existing accounts of anti-luck conditions for achievements in both the ethics and epistemology literature. My own proposal is that a goal is reached competently, only if the actions of the would-be-achiever make (...) success likely, and that this is the reason why she acts that way. (shrink)

According to the Lockean thesis, a proposition is believed just in case it is highly probable. While this thesis enjoys strong intuitive support, it is known to conflict with seemingly plausible logical constraints on our beliefs. One way out of this conflict is to make probability 1 a requirement for belief, but most have rejected this option for entailing what they see as an untenable skepticism. Recently, two new solutions to the conflict have been proposed that are alleged to be (...) non-skeptical. We compare these proposals with each other and with the Lockean thesis, in particular with regard to the question of how much we gain by adopting any one of them instead of the probability 1 requirement, that is, of how likely it is that one believes more than the things one is fully certain of. (shrink)

This paper critically assesses existing accounts of the nature of difficulty, finds them wanting, and proposes a new account. The concept of difficulty is routinely invoked in debates regarding degrees of moral responsibility, and the value of achievement. Until recently, however, there has not been any sustained attempt to provide an account of the nature of difficulty itself. This has changed with Gwen Bradford’s Achievement, which argues that difficulty is a matter of how much intense effort is expended. But while (...) this account captures something important about the relationship between difficulty and achievement, it fails to account for the fact that part of what makes achievements great is that they are difficult in a moderately agent-neutral kind of way. Nor is this thought captured by any other extant account. I argue that to fill this gap we should think of difficulty in terms of low probability of success. (shrink)

The notion of an ideal reasoner has several uses in epistemology. Often, ideal reasoners are used as a parameter of (maximum) rationality for finite reasoners (e.g. humans). However, the notion of an ideal reasoner is normally construed in such a high degree of idealization (e.g. infinite/unbounded memory) that this use is unadvised. In this dissertation, I investigate the conditions under which an ideal reasoner may be used as a parameter of rationality for finite reasoners. In addition, I present and justify (...) the research program of computational epistemology, which investigates the parameter of maximum rationality for finite reasoners using computer simulations. (shrink)

The negative zombie argument concludes that physicalism is false from the premises that p ∧¬q is ideally negatively conceivable and that what is ideally negatively conceivable is possible, where p is the conjunction of the fundamental physical truths and laws and q is a phenomenal truth (Chalmers 2002; 2010). A sentence φ is ideally negatively conceivable iff φ is not ruled out a priori on ideal rational reflection. In this paper, I argue that the negative zombie argument is neither a (...) priori nor conclusive. First, I argue that the premises of the argument are true only if there exists an adequate finite ideal reasoner R that believes ◊(p ∧ ¬q) on the basis of not believing p→q on a priori basis. Roughly, a finite reasoner is a reasoner with cognitive limitations (e.g. finite memory). I argue that R is finite only if R reasons nonmonotonically and only approach ideal reflection at the limit of a reasoning sequence. This would render the argument nonconclusive. Finally, I argue that, for some q, R does not believe ◊(p ∧ ¬q) on the basis of not believing p→q on a priori basis (e.g. for q =‘something is conscious’). This would render the choice of an adequate q dependent on empirical information (and the argument a posteriori). I conclude that the negative zombie argument (and, maybe, all zombie arguments) is neither a priori nor conclusive. (shrink)

Many epistemologists have responded to the lottery paradox by proposing formal rules according to which high probability defeasibly warrants acceptance. Douven and Williamson present an ingenious argument purporting to show that such rules invariably trivialise, in that they reduce to the claim that a probability of 1 warrants acceptance. Douven and Williamson’s argument does, however, rest upon significant assumptions – amongst them a relatively strong structural assumption to the effect that the underlying probability space is both finite and uniform. In (...) this paper, I will show that something very like Douven and Williamson’s argument can in fact survive with much weaker structural assumptions – and, in particular, can apply to infinite probability spaces. (shrink)

According to a captivating picture, epistemic justification is essentially a matter of epistemic or evidential likelihood. While certain problems for this view are well known, it is motivated by a very natural thought—if justification can fall short of epistemic certainty, then what else could it possibly be? In this paper I shall develop an alternative way of thinking about epistemic justification. On this conception, the difference between justification and likelihood turns out to be akin to the more widely recognised difference (...) between ceteris paribus laws and brute statistical generalisations. I go on to discuss, in light of this suggestion, issues such as classical and lottery-driven scepticism as well as the lottery and preface paradoxes. (shrink)

The conflict of narrowness and precision in direct inference occurs if a body of evidence contains estimates for frequencies in a certain reference class and less precise estimates for frequencies in a narrower reference class. To develop a solution to this conflict, I draw on ideas developed by Paul Thorn and John Pollock. First, I argue that Kyburg and Teng’s solution to the conflict of narrowness and precision leads to unreasonable direct inference probabilities. I then show that Thorn’s recent solution (...) to the conflict leads to unreasonable direct inference probabilities. Based on my analysis of Thorn’s approach, I propose a natural distribution for a Bayesian analysis of the data directly obtained from studying members of the narrowest reference class. (shrink)

It is well known that there are, at least, two sorts of cases where one should not prefer a direct inference based on a narrower reference class, in particular: cases where the narrower reference class is gerrymandered, and cases where one lacks an evidential basis for forming a precise-valued frequency judgment for the narrower reference class. I here propose (1) that the preceding exceptions exhaust the circumstances where one should not prefer direct inference based on a narrower reference class, and (...) (2) that minimal frequency information for a narrower (non-gerrymandered) reference class is sufficient to yield the defeat of a direct inference for a broader reference class. By the application of a method for inferring relatively informative expected frequencies, I argue that the latter claim does not result in an overly incredulous approach to direct inference. The method introduced here permits one to infer a relatively informative expected frequency for a reference class R', given frequency information for a superset of R' and/or frequency information for a sample drawn from R'. (shrink)

Although many philosophers think backwards causation possible, puzzles arise when we consider worlds containing both backwards causal chains and agents capable of intervening in, and initiating, such chains. In these worlds, agents have the power to bilk, that is, the power to prevent an event from occurring which, had it occurred, would have been the cause of an earlier event. I argue, appealing to Max Black’s example and one other, that this power is absurd and hence that there are no (...) worlds containing both agents and manipulable backwards causal chains. (shrink)

In attempting to form rational personal probabilities by direct inference, it is usually assumed that one should prefer frequency information concerning more specific reference classes. While the preceding assumption is intuitively plausible, little energy has been expended in explaining why it should be accepted. In the present article, I address this omission by showing that, among the principled policies that may be used in setting one’s personal probabilities, the policy of making direct inferences with a preference for frequency information for (...) more specific reference classes yields personal probabilities whose accuracy is optimal, according to all proper scoring rules, in situations where all of the relevant frequency information is point-valued. Assuming that frequency information for narrower reference classes is preferred, when the relevant frequency statements are point-valued, a dilemma arises when choosing whether to make a direct inference based upon relatively precise-valued frequency information for a broad reference class, R, or upon relatively imprecise-valued frequency information for a more specific reference class, R*. I address such cases, by showing that it is often possible to make a precise-valued frequency judgment regarding R* based on precise-valued frequency information for R, using standard principles of direct inference. Having made such a frequency judgment, the dilemma of choosing between and is removed, and one may proceed by using the precise-valued frequency estimate for the more specific reference class as a premise for direct inference. (shrink)

There are numerous formal systems that allow inference of new conditionals based on a conditional knowledge base. Many of these systems have been analysed theoretically and some have been tested against human reasoning in psychological studies, but experiments evaluating the performance of such systems are rare. In this article, we extend the experiments in [19] in order to evaluate the inferential properties of c-representations in comparison to the well-known Systems P and Z. Since it is known that System Z and (...) c-representations mainly differ in the sorts of inheritance inferences they allow, we discuss subclass inheritance and present experimental data for this type of inference in particular. (shrink)

There are circumstances in which we want to predict a series of interrelated events. Faced with such a prediction task, it is natural to consider logically inconsistent predictions to be irrational. However, it is possible to find cases where an inconsistent prediction has higher expected accuracy than any consistent prediction. Predicting tournaments in sports provides a striking example of such a case and I argue that logical consistency should not be a norm of rational predictions in these situations.

Consider someone whom you know to be an expert about some issue. She knows at least as much as you do and reasons impeccably. The issue is a straightforward case of statistical inference that raises no deep problems of epistemology. You happen to know the expert’s opinion on this issue. Should you defer to her by adopting her opinion as your own? An affirmative answer may appear mandatory. But this paper argues that a crucial factor in answering this question is (...) the description under which you identify the expert. Experts may be identified under various descriptions (e.g., “the expert appearing on Channel 7 at 5 pm”). Section 2 provides cases that illustrate how deference to a known expert may be appropriate under some descriptions, but not others. Section 3 proposes that, in these cases, the differentiating factor is self-identification: deference to an expert under a given description is appropriate when the expert self-identifies under that description. Section 4 presents a formal framework that demonstrates the sufficiency of self-identification for appropriate deference within a significant class of cases. Section 5 notes a way in which this phenomenon allows for a form of “agreeing to disagree” in Robert Aumann’s sense. Section 6 illustrates the practical application of these results to the case of testimonials. (shrink)

I resolve an apparently unresolved dispute about how probable uniform experience makes an extrapolation from it, and draw some general lessons about such enumerative induction. Uniform experience does not necessarily confer a high probability on an extrapolation of or generalization from that experience. Rational extrapolation or generalization typically involves a lot of specific background information, though not necessarily a general assumption that nature is uniform or that the future will resemble the past. And new evidence which is highly likely on (...) one hypothesis but highly unlikely on any of its competitors does not necessarily make the former hypothesis highly probable. (shrink)

Examples growing out of the Newcomb problem have convinced many people that decision theory should proceed in terms of some kind of causal probability. I endorse this view and define and investigate a variety of causal probability. My definition is related to Skyrms' definition, but proceeds in terms of objective probabilities rather than subjective probabilities and avoids taking causal dependence as a primitive concept.

First, ranking functions are argued to be superior to AGM belief revision theory in two crucial respects. Second, it is shown how ranking functions are uniquely reflected in iterated belief change. More precisely, conditions on threefold contractions are specified which suffice for representing contractions by a ranking function uniquely up to multiplication by a positive integer. Thus, an important advantage AGM theory seemed to have over ranking functions proves to be spurious.

In this paper two theories of defeasible reasoning, Pollock's account and my theory of ranking functions, are compared, on a strategic level, since a strictly formal comparison would have been unfeasible. A brief summary of the accounts shows their basic difference: Pollock's is a strictly computational one, whereas ranking functions provide a regulative theory. Consequently, I argue that Pollock's theory is normatively defective, unable to provide a theoretical justification for its basic inference rules and thus an independent notion of admissible (...) rules. Conversely, I explain how quite a number of achievements of Pollock's account can be adequately duplicated within ranking theory. The main purpose of the paper, though, is not to settle a dispute with formal epistemology, but rather to emphasize the importance of formal methods to the whole of epistemology. (shrink)

In 1950, Alan Turing proposed his eponymous test based on indistinguishability of verbal behavior as a replacement for the question "Can machines think?" Since then, two mutually contradictory but well-founded attitudes towards the Turing Test have arisen in the philosophical literature. On the one hand is the attitude that has become philosophical conventional wisdom, viz., that the Turing Test is hopelessly flawed as a sufficient condition for intelligence, while on the other hand is the overwhelming sense that were a machine (...) to pass a real live full-fledged Turing Test, it would be a sign of nothing but our orneriness to deny it the attribution of intelligence. The arguments against the sufficiency of the Turing Test for determining intelligence rely on showing that some extra conditions are logically necessary for intelligence beyond the behavioral properties exhibited by an agent under a Turing Test. Therefore, it cannot follow logically from passing a Turing Test that the agent is intelligent. I argue that these extra conditions can be revealed by the Turing Test, so long as we allow a very slight weakening of the criterion from one of logical proof to one of statistical proof under weak realizability assumptions. The argument depends on the notion of interactive proof developed in theoretical computer science, along with some simple physical facts that constrain the information capacity of agents. Crucially, the weakening is so slight as to make no conceivable difference from a practical standpoint. Thus, the Gordian knot between the two opposing views of the sufficiency of the Turing Test can be cut. (shrink)

To summarize, in order for rational agents to be able to engage in the sophisticated kinds of reasoning exemplified by human beings, they must be able to introspect much of their cognition. The problem of other minds and the problem of knowing the mental states of others will arise automatically for any rational agent that is able to introspect its own cognition. The most that a rational agent can reasonably believe about other rational agents is that they have rational architectures (...) similar to its own, and that they have thoughts related to their rational architectures in certain ways. This leads to Rational Functionalism as an account of what it is to be a cognizer having mental states. That in turn entails that a computer can be a person in precisely the same sense as my next door neighbor if it can appropriately mimic my rational architecture. There is nothing I could know about my neighbor that I could not believe with equal justification about the computer. Rational Functionalism also makes it reasonable to define the narrow content of a thought to be its overall place in the agent's rational architecture, that is, its conceptual role. This is, however, avery narrow notion of content. For practical purposes, we are not interested in knowing the narrow contents of other people's thoughts. We are only interested in rather general properties of those narrow contents. This is what is expressed by the use ofthat-clauses in public language. (shrink)

It is a prevalent, if not popular, thesis in the metaphysics of belief that facts about an agent’s beliefs depend entirely upon facts about that agent’s underlying credal state. Call this thesis ‘credal reductivism’ and any view that endorses this thesis a ‘credal reductivist view’. An adequate credal reductivist view will accurately predict both when belief occurs and which beliefs are held appropriately, on the basis of credal facts alone. Several well-known—and some lesser known—objections to credal reductivism turn on the (...) inability of standard credal reductivist views to get the latter, normative, results right. This paper presents and defends a novel credal reductivist view according to which belief is a type of “imprecise credence” that escapes these objections by including an extreme credence of 1. (shrink)

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)

Counterexamples are constructed for classical decision theory, turning on the fact that actions must often be chosen in groups rather than individually, i.e., the objects of rational choice are plans. It is argued that there is no way to define optimality for plans that makes the finding of optimal plans the desideratum of rational decision-making. An alternative called “locally global planning” is proposed as a replacement for classical decision theory. Decision-making becomes a non-terminating process without a precise target rather than (...) a terminating search for an optimal solution. (shrink)