Jeff Paris proves a generalized Dutch Book theorem. If a belief state is not a generalized probability then one faces ‘sure loss’ books of bets. In Williams I showed that Joyce’s accuracy-domination theorem applies to the same set of generalized probabilities. What is the relationship between these two results? This note shows that both results are easy corollaries of the core result that Paris appeals to in proving his dutch book theorem. We see that every point of accuracy-domination defines a (...) dutch book, but we only have a partial converse. (shrink)

Lewis (1973) gave a short argument against conditional excluded middle, based on his treatment of ‘might’ counterfactuals. Bennett (2003), with much of the recent literature, gives an alternative take on ‘might’ counterfactuals. But Bennett claims the might-argument against CEM still goes through. This turns on a specific claim I call Bennett’s Hypothesis. I argue that independently of issues to do with the proper analysis of might-counterfactuals, Bennett’s Hypothesis is inconsistent with CEM. But Bennett’s Hypothesis is independently objectionable, so we should (...) resolve this tension by dropping the Hypothesis, not by dropping CEM. (shrink)

In the literature on supervaluationism, a central source of concern has been the acceptability, or otherwise, of its alleged logical revisionism. I attack the presupposition of this debate: arguing that when properly construed, there is no sense in which supervaluational consequence is revisionary. I provide new considerations supporting the claim that the supervaluational consequence should be characterized in a ‘global’ way. But pace Williamson (1994) and Keefe (2000), I argue that supervaluationism does not give rise to counterexamples to familiar inference-patterns (...) such as reductio and conditional proof. (shrink)

This essay presents a philosophical and computational theory of the representation of de re, de dicto, nested, and quasi-indexical belief reports expressed in natural language. The propositional Semantic Network Processing System (SNePS) is used for representing and reasoning about these reports. In particular, quasi-indicators (indexical expressions occurring in intentional contexts and representing uses of indicators by another speaker) pose problems for natural-language representation and reasoning systems, because--unlike pure indicators--they cannot be replaced by coreferential NPs without changing the meaning of the (...) embedding sentence. Therefore, the referent of the quasi-indicator must be represented in such a way that no invalid coreferential claims are entailed. The importance of quasi-indicators is discussed, and it is shown that all four of the above categories of belief reports can be handled by a single representational technique using belief spaces containing intensional entities. Inference rules and belief-revision techniques for the system are also examined. (shrink)

“Contextual” vocabulary acquisition is the active, deliberate acquisition of a meaning for a word in a text by reasoning from textual clues and prior knowledge, including language knowledge and hypotheses developed from prior encounters with the word, but without external sources of help such as dictionaries or people. But what is “context”? Is it just the surrounding text? Does it include the reader’s background knowledge? I argue that the appropriate context for contextual vocabulary acquisition is the reader’s “internalization” of the (...) text “integrated” into the reader’s “prior” knowledge via belief revision. (shrink)

We discuss a research project that develops and applies algorithms for computational contextual vocabulary acquisition (CVA): learning the meaning of unknown words from context. We try to unify a disparate literature on the topic of CVA from psychology, first- and secondlanguage acquisition, and reading science, in order to help develop these algorithms: We use the knowledge gained from the computational CVA system to build an educational curriculum for enhancing students’ abilities to use CVA strategies in their reading of science texts (...) at the middle-school and college undergraduate levels. The knowledge gained from case studies of students using our CVA techniques feeds back into further development of our computational theory. Keywords: artificial intelligence, knowledge representation, reading, reasoning, science education, vocabulary acquisition. (shrink)

This project continues our interdisciplinary research into computational and cognitive aspects of narrative comprehension. Our ultimate goal is the development of a computational theory of how humans understand narrative texts. The theory will be informed by joint research from the viewpoints of linguistics, cognitive psychology, the study of language acquisition, literary theory, geography, philosophy, and artificial intelligence. The linguists, literary theorists, and geographers in our group are developing theories of narrative language and spatial understanding that are being tested by the (...) cognitive psychologists and language researchers in our group, and a computational model of a reader of narrative text is being developed by the AI researchers, based in part on these theories and results and in part on research on knowledge representation and reasoning. This proposal describes the knowledge-representation and natural-language-processing issues involved in the computational implementation of the theory; discusses a contrast between communicative and narrative uses of language and of the relation of the narrative text to the story world it describes; investigates linguistic, literary, and hermeneutic dimensions of our research; presents a computational investigation of subjective sentences and reference in narrative; studies children’s acquisition of the ability to take third-person perspective in their own storytelling; describes the psychological validation of various linguistic devices; and examines how readers develop an understanding of the geographical space of a story. This report is a longer version of a project description submitted to NSF. This document, produced in May 2007, is a L ATEX version of Technical Report 89-07 (Buffalo: SUNY Buffalo Department of Computer Science, August 1989), with slightly.. (shrink)

This essay presents and defends a triage theory of grading: An item to be graded should get full credit if and only if it is clearly or substantially correct, minimal credit if and only if it is clearly or substantially incorrect, and partial credit if and only if it is neither of the above; no other (intermediate) grades should be given. Details on how to implement this are provided, and further issues in the philosophy of grading (reasons for and against (...) grading, grading on a curve, and the subjectivity of grading) are discussed. (shrink)

In their Why Machines Will Never Rule the World, Landgrebe and Smith (2023) argue that it is impossible for artificial general intelligence (AGI) to succeed, on the grounds that it is impossible to perfectly model or emulate the “complex” “human neurocognitive system”. However, they do not show that it is logically impossible; they only show that it is practically impossible using current mathematical techniques. Nor do they prove that there could not be any other kinds of theories than those in (...) current use. Even if perfect theories were impossible or unlikely, perfection may not be needed and may even be unhelpful. (shrink)

*This work has turned into a bigger project, and some of it is published in "Lewis on reference".* Some things, argues Lewis, are just better candidates to be referents than others. Even at the cost of attributing false beliefs, we interpret people as referring to the most interesting kinds in their vicinity. How should this be accounted for? In section 1, I look at Lewis’s interpretationism, and the reference magnetism it builds in (not just for ‘perfectly natural’ properties, but for (...) certain kinds of auxiliary apparatus). In section 2, I draw on (Field, 1975) to argue that what properties are reference magnetic may be an ultimately conventional matter—though in the Lewisian setting, there may be an objectively best conventional choice to make. But Lewis’s own account has implausible commitments, so in section 3 I consider variations and alternatives, all of which have problems. In section 4, I look in more detail at eligibility-based interpretationism that do not appeal to naturalness, arguing that there are credible metasemantic theories of this form. (shrink)

Might it be that world itself, independently of what we know about it or how we represent it, is metaphysically indeterminate? This article tackles in turn a series of questions: In what sorts of cases might we posit metaphysical indeterminacy? What is it for a given case of indefiniteness to be 'metaphysical'? How does the phenomenon relate to 'ontic vagueness', the existence of 'vague objects', 'de re indeterminacy' and the like? How might the logic work? Are there reasons for postulating (...) this distinctive sort of indefiniteness? Conversely, are there reasons for denying that there is indefiniteness of this sort? (shrink)

Inscrutability arguments threaten to reduce interpretationist metasemantic theories to absurdity. Can we find some way to block the arguments? A highly influential proposal in this regard is David Lewis’ ‘ eligibility ’ response: some theories are better than others, not because they fit the data better, but because they are framed in terms of more natural properties. The purposes of this paper are to outline the nature of the eligibility proposal, making the case that it is not ad hoc, but (...) instead flows naturally from three independently motivated elements; and to show that severe limitations afflict the proposal. In conclusion, I pick out the element of the eligibility response that is responsible for the limitations: future work in this area should therefore concentrate on amending this aspect of the overall theory. (shrink)

In this paper I argue against the view of G.E.L. Owen that the second version of the Third Man Argument is a sound objection to Plato's conception of Forms as paradigms and that Plato knew it. The argument can be formulated so as to be valid, but Plato need not be committed to one of its premises. Forms are self-predicative, but the ground of self-predication is not the same as that of ordinary predication.

Bryne & Hajek (1997) argue that Lewis’s (1988; 1996) objections to identifying desire with belief do not go through if our notion of desire is ‘causalized’ (characterized by causal, rather than evidential, decision theory). I argue that versions of the argument go through on certain assumptions about the formulation of decision theory. There is one version of causal decision theory where the original arguments cannot be formulated—the ‘imaging’ formulation that Joyce (1999) advocates. But I argue this formulation is independently objectionable. (...) If we want to maintain the desire as belief thesis, there’s no shortcut through causalization. (shrink)

In the Fall of 1983, I offered a junior/senior-level course in Philosophy of Artificial Intelligence, in the Department of Philosophy at SUNY Fredonia, after returning there from a year’s leave to study and do research in computer science and artificial intelligence (AI) at SUNY Buffalo. Of the 30 students enrolled, most were computerscience majors, about a third had no computer background, and only a handful had studied any philosophy. (I might note that enrollments have subsequently increased in the Philosophy Department’s (...) AI-related courses, such as logic, philosophy of mind, and epistemology, and that several computer science students have added philosophy as a second major.) This article describes that course, provides material for use in such a course, and offers a bibliography of relevant articles in the AI, cognitive science, and philosophical literature. (shrink)

*This work is no longer under development* Two major themes in the literature on indicative conditionals are that the content of indicative conditionals typically depends on what is known;1 that conditionals are intimately related to conditional probabilities.2 In possible world semantics for counterfactual conditionals, a standard assumption is that conditionals whose antecedents are metaphysically impossible are vacuously true.3 This aspect has recently been brought to the fore, and defended by Tim Williamson, who uses it in to characterize alethic necessity by (...) exploiting such equivalences as: A⇔¬A A. One might wish to postulate an analogous connection for indicative conditionals, with indicatives whose antecedents are epistemically impossible being vacuously true: and indeed, the modal account of indicative conditionals of Brian Weatherson has exactly this feature.4 This allows one to characterize an epistemic modal by the equivalence A⇔¬A→A. For simplicity, in what follows we write A as KA and think of it as expressing that subject S knows that A.5 The connection to probability has received much attention. Stalnaker suggested, as a way of articulating the ‘Ramsey Test’, the following very general schema for indicative conditionals relative to some probability function P: P = P 1For example, Nolan ; Weatherson ; Gillies. 2For example Stalnaker ; McGee ; Adams. 3Lewis. See Nolan for criticism. 4‘epistemically possible’ here means incompatible with what is known. 5This idea was suggested to me in conversation by John Hawthorne. I do not know of it being explored in print. The plausibility of this characterization will depend on the exact sense of ‘epistemically possible’ in play—if it is compatibility with what a single subject knows, then can be read ‘the relevant subject knows that p’. If it is more delicately formulated, we might be able to read as the epistemic modal ‘must’. (shrink)

The purpose of this essay is to exhibit in detail the setting for the version of the Cogito Argument that appears in Descartes’s Meditations. I believe that a close reading of the text can shed new light on the nature and role of the “evil demon”, on the nature of God as he appears in the first few Meditations, and on the place of the Cogito Argument in Descartes’s overall scheme.

*These notes were folded into the published paper "Probability and nonclassical logic*. Revising semantics and logic has consequences for the theory of mind. Standard formal treatments of rational belief and desire make classical assumptions. If we are to challenge the presuppositions, we indicate what is kind of theory is going to take their place. Consider probability theory interpreted as an account of ideal partial belief. But if some propositions are neither true nor false, or are half true, or whatever—then it’s (...) far from clear that our degrees of belief in it and its negation should sum to 1, as classical probability theory requires (?, cf.). There are extant proposals in the literature for generalizing (categorical) probability theory to a non-classical setting, and we will use these below. But subjective probabilities themselves stand in functional relations to other mental states, and we need to trace the knock-on consequences of revisionism for this interrelationship (arguably, degrees of belief only count as kinds of belief in virtue of standing in these functional relationships). (shrink)

It is a matter of fact—and has been so for a considerable amount of time—that philosophy is taught at the pre—college level. However, to teach philosophy at that (or at any) level is one thing; to teach it well is quite another. Fortunately, it can be taught well, as a host of successful experiences and programs have shown. But in what ways can it be taught? Are there differences in the ways in which it can or should be taught at (...) the pre-college level from the ways in which it is taught in college? Are there differences in the ways in which it can or should be taught at the elementary-school level from ways in which it can or should be taught at the secondary-school level? There are other questions, of a similar nature, that the beginning college-level teacher of philosophy might ask: “I have never taught Introduction to Philosophy before; how should I go about it?” And there is a further question: Should it be taught at all? This question can, of course, be raised at any educational level, but it is especially acute at the elementary level. (shrink)

Worlds where things divide forever ("gunk" worlds) are apparently conceivable. The conceivability of such scenarios has been used as an argument against "nihilist" or "near-nihilist" answers to the special composition question. I argue that the mereological nihilist has the resources to explain away the illusion that gunk is possible.

Joyce (1998) gives an argument for probabilism: the doctrine that rational credences should conform to the axioms of probability. In doing so, he provides a distinctive take on how the normative force of probabilism relates to the injunction to believe what is true. But Joyce presupposes that the truth values of the propositions over which credences are defined are classical. I generalize the core of Joyce’s argument to remove this presupposition. On the same assumptions as Joyce uses, the credences of (...) a rational agent should always be weighted averages of truth value assignments. In the special case where the truth values are classical, the weighted averages of truth value assignments are exactly the probability functions. But in the more general case, probabilistic axioms formulated in terms of classical logic are violated—but we will show that generalized versions of the axioms formulated in terms of non-classical logics are satisfied. (shrink)

It is now well-known that Newton–Cartan theory is the correct geometrical setting for modelling the quantum Hall effect. In addition, in recent years edge modes for the Newton–Cartan quantum Hall effect have been derived. However, the existence of these edge modes has, as of yet, been derived using only orthodox methodologies involving the breaking of gauge-invariance; it would be preferable to derive the existence of such edge modes in a gauge-invariant manner. In this article, we employ recent work by Donnelly (...) and Freidel in order to accomplish exactly this task. Our results agree with known physics, but afford greater conceptual insight into the existence of these edge modes: in particular, they connect them to subtle aspects of Newton–Cartan geometry and pave the way for further applications of Newton–Cartan theory in condensed matter physics. (shrink)

Turner argues that computer programs must have purposes, that implementation is not a kind of semantics, and that computers might need to understand what they do. I respectfully disagree: Computer programs need not have purposes, implementation is a kind of semantic interpretation, and neither human computers nor computing machines need to understand what they do.

I outline and motivate a way of implementing a closest world theory of indicatives, appealing to Stalnaker's framework of open conversational possibilities. Stalnakerian conversational dynamics helps us resolve two outstanding puzzles for a such a theory of indicative conditionals. The first puzzle -- concerning so-called 'reverse Sobel sequences' -- can be resolved by conversation dynamics in a theoryneutral way: the explanation works as much for Lewisian counterfactuals as for the account of indicatives developed here. Resolving the second puzzle, by contrast, (...) relies on the interplay between the particular theory of indicative conditionals developed here and Stalnakerian dynamics. The upshot is an attractive resolution of the so-called "Gibbard phenomenon" for indicative conditionals. (shrink)

This essay considers what it means to understand natural language and whether a computer running an artificial-intelligence program designed to understand natural language does in fact do so. It is argued that a certain kind of semantics is needed to understand natural language, that this kind of semantics is mere symbol manipulation (i.e., syntax), and that, hence, it is available to AI systems. Recent arguments by Searle and Dretske to the effect that computers cannot understand natural language are discussed, and (...) a prototype natural-language-understanding system is presented as an illustration. (shrink)

In this reply to James H. Fetzer’s “Minds and Machines: Limits to Simulations of Thought and Action”, I argue that computationalism should not be the view that (human) cognition is computation, but that it should be the view that cognition (simpliciter) is computable. It follows that computationalism can be true even if (human) cognition is not the result of computations in the brain. I also argue that, if semiotic systems are systems that interpret signs, then both humans and computers are (...) semiotic systems. Finally, I suggest that minds can be considered as virtual machines implemented in certain semiotic systems, primarily the brain, but also AI computers. In doing so, I take issue with Fetzer’s arguments to the contrary. (shrink)

Some argue that theories of universals should incorporate structural universals, in order to allow for the metaphysical possibility of worlds of 'infinite descending complexity' ('onion worlds'). I argue that the possibility of such worlds does not establish the need for structural universals. So long as we admit the metaphysical possibility of emergent universals, there is an attractive alternative description of such cases.

There are many branches of philosophy called “the philosophy of X,” where X = disciplines ranging from history to physics. The philosophy of artificial intelligence has a long history, and there are many courses and texts with that title. Surprisingly, the philosophy of computer science is not nearly as well-developed. This article proposes topics that might constitute the philosophy of computer science and describes a course covering those topics, along with suggested readings and assignments.

John Searle once said: "The Chinese room shows what we knew all along: syntax by itself is not sufficient for semantics. (Does anyone actually deny this point, I mean straight out? Is anyone actually willing to say, straight out, that they think that syntax, in the sense of formal symbols, is really the same as semantic content, in the sense of meanings, thought contents, understanding, etc.?)." I say: "Yes". Stuart C. Shapiro has said: "Does that make any sense? Yes: Everything (...) makes sense. The question is: What sense does it make?" This essay explores what sense it makes to say that syntax by itself is sufficient for semantics. (shrink)

We present a computational analysis of de re, de dicto, and de se belief and knowledge reports. Our analysis solves a problem first observed by Hector-Neri Castañeda, namely, that the simple rule -/- `(A knows that P) implies P' -/- apparently does not hold if P contains a quasi-indexical. We present a single rule, in the context of a knowledge-representation and reasoning system, that holds for all P, including those containing quasi-indexicals. In so doing, we explore the difference between reasoning (...) in a public communication language and in a knowledge-representation language, we demonstrate the importance of representing proper names explicitly, and we provide support for the necessity of considering sentences in the context of extended discourse (for example, written narrative) in order to fully capture certain features of their semantics. (shrink)

While epistemic democrats have claimed that majority rule recruits the wisdom of the crowd to identify correct answers to political problems, the conjecture remains abstract. This article illustrates how majority rule leverages the epistemic capacity of the electorate to practically enhance the instrumental value of elections. To do so, we identify a set of sufficient conditions that effect such a majority rule mechanism, even when the decision in question is multidimensional. We then look to the case of sociotropic economic voting (...) in US presidential elections to provide empirical tractability for these conditions. We find that absent such an epistemic capacity a number of presidential elections might well have been decided differently. By generating clear conditions for the plausibility of claims made by epistemic democrats, and demonstrating their correspondence to empirical data, this article strengthens the broader instrumental grounds recommending democracy. (shrink)

A computer can come to understand natural language the same way Helen Keller did: by using “syntactic semantics”—a theory of how syntax can suffice for semantics, i.e., how semantics for natural language can be provided by means of computational symbol manipulation. This essay considers real-life approximations of Chinese Rooms, focusing on Helen Keller’s experiences growing up deaf and blind, locked in a sort of Chinese Room yet learning how to communicate with the outside world. Using the SNePS computational knowledge-representation system, (...) the essay analyzes Keller’s belief that learning that “everything has a name” was the key to her success, enabling her to “partition” her mental concepts into mental representations of: words, objects, and the naming relations between them. It next looks at Herbert Terrace’s theory of naming, which is akin to Keller’s, and which only humans are supposed to be capable of. The essay suggests that computers at least, and perhaps non-human primates, are also capable of this kind of naming. (shrink)

Critical Review of Searle's Minds, Brains and Science.

A critical study of John Searle's Minds, Brains and Science (Cambridge, MA: Harvard University Press, 1984).

SNePS, the Semantic Network Processing System 45, 54], has been designed to be a system for representing the beliefs of a natural-language-using intelligent system (a \cognitive agent"). It has always been the intention that a SNePS-based \knowledge base" would ultimatelybe built, not by a programmeror knowledge engineer entering representations of knowledge in some formallanguage or data entry system, but by a human informing it using a natural language (NL) (generally supposed to be English), or by the system reading books or (...) articles that had been prepared for human readers. Because of this motivation, the criteria for the development of SNePS have included: it should be able to represent anything and everything expressible in NL; it should be able to represent generic, as well as speci c information; it should be able to use the generic and the speci c information to reason and infer information implied by what it has been told; it cannot count on any particular order among the pieces of information it is given; it must continue to act reasonably even if the information it is given includes circular de nitions, recursive rules, and inconsistent information. (shrink)

Ford’s Helen Keller Was Never in a Chinese Room claims that my argument in How Helen Keller Used Syntactic Semantics to Escape from a Chinese Room fails because Searle and I use the terms ‘syntax’ and ‘semantics’ differently, hence are at cross purposes. Ford has misunderstood me; this reply clarifies my theory.

How are permutation arguments for the inscrutability of reference to be formulated in the context of a Davidsonian truth-theoretic semantics? Davidson takes these arguments to establish that there are no grounds for favouring a reference scheme that assigns London to “Londres”, rather than one that assigns Sydney to that name. We shall see, however, that it is far from clear whether permutation arguments work when set out in the context of the kind of truth-theoretic semantics which Davidson favours. The principle (...) required to make the argument work allows us to resurrect Foster problems against the Davidsonian position. The Foster problems and the permutation inscrutability problems stand or fall together: they are one puzzle, not two. (shrink)

A brief introduction to Meinong, his theory of objects, and modern interpretations of it. Sections include: The Theory of Objects, Castañeda's Theory of Guises, Parsons,'s Theory of Nonexistent Objects, Rapaport's Theory of Meinongian Objects, Routley's Theory of Items.

Contextual vocabulary acquisition (CVA) is the deliberate acquisition of a meaning for a word in a text by reasoning from context, where “context” includes: (1) the reader’s “internalization” of the surrounding text, i.e., the reader’s “mental model” of the word’s “textual context” (hereafter, “co-text” [3]) integrated with (2) the reader’s prior knowledge (PK), but it excludes (3) external sources such as dictionaries or people. CVA is what you do when you come across an unfamiliar word in your reading, realize that (...) you don’t know what it means, decide that you need to know what it means in order to understand the passage, but there is no one around to ask, and it is not in the dictionary (or you are too lazy to look it up). In such a case, you can try to figure out its meaning “from context”, i.e., from clues in the co-text together with your prior knowledge. Our computational theory of CVA—implemented in a the SNePS knowledge representation and reasoning system [28]—begins with a stored knowledge base containing SNePS representations of relevant PK, inputs SNePS representations of a passage containing an unfamiliar word, and draws inferences from these two (integrated) information sources. When asked to define the word, definition algorithms deductively search the resulting network for information of the sort that might be found in a dictionary definition, outputting a definition frame whose slots are the kinds of features that a definition might contain (e.g., class membership, properties, actions, spatio-temporal information, etc.) and whose slot-fillers contain information gleaned from the network [6–8,20,23,24]. We are investigating ways to make our system more robust, to embed it in a naturallanguage-processing system, and to incorporate morphological information. Our research group, including reading educators, is also applying our methods to the develop-. (shrink)

I argue that George Nakhnikian's analysis of the logic of cogito propositions (roughly, Descartes's 'cogito' and 'sum') is incomplete. The incompleteness is rectified by showing that disjunctions of cogito propositions with contingent, non-cogito propositions satisfy conditions of incorrigibility, self-certifyingness, and pragmatic consistency; hence, they belong to the class of propositions with whose help a complete characterization of cogito propositions is made possible.

This essay describes computational semantic networks for a philosophical audience and surveys several approaches to semantic-network semantics. In particular, propositional semantic networks are discussed; it is argued that only a fully intensional, Meinongian semantics is appropriate for them; and several Meinongian systems are presented.

Alexius Meinong developed a notion of defective objects in order to account for various logical and psychological paradoxes. The notion is of historical interest, since it presages recent work on the logical paradoxes by Herzberger and Kripke. But it fails to do the job it was designed for. However, a technique implicit in Meinong's investigation is more successful and can be adapted to resolve a similar paradox discovered by Romane Clark in a revised version of Meinong's Theory of Objects due (...) to Rapaport. One family of paradoxes remains, but it is argued that they are unavoidable and relatively harmless. (shrink)

Hauser argues that his pocket calculator (Cal) has certain arithmetical abilities: it seems Cal calculates. That calculating is thinking seems equally untendentious. Yet these two claims together provide premises for a seemingly valid syllogism whose conclusion - Cal thinks - most would deny. He considers several ways to avoid this conclusion, and finds them mostly wanting. Either we ourselves can't be said to think or calculate if our calculation-like performances are judged by the standards proposed to rule out Cal; or (...) the standards- e.g., autonomy and self-consciousness- make it impossible to verify whether anything or anyone (save oneself) meets them. While appeals to the intentionality of thought or the unity of minds provide more credible lines of resistance, available accounts of intentionality and mental unity are insufficiently clear and warranted to provide very substantial arguments against Cal's title to be called a thinking thing. Indeed, considerations favoring granting that title are more formidable than is generally appreciated. Rapaport's comments suggest that, on a strong view of thinking, mere calculating is not thinking (and pocket calculators don't think), but on a weak, but unexciting, sense of thinking, pocket calculators do think. He closes with some observations on the implications of this conclusion. (shrink)

H´ector-Neri Casta˜neda-Calder´on (December 13, 1924–September 7, 1991) was born in San Vicente Zacapa, Guatemala. He attended the Normal School for Boys in Guatemala City, later called the Military Normal School for Boys, from which he was expelled for refusing to fight a bully; the dramatic story, worthy of being filmed, is told in the “De Re” section of his autobiography, “Self-Profile” (1986). He then attended a normal school in Costa Rica, followed by studies in philosophy at the University of San (...) Carlos, Guatemala. He won a scholarship to the University of Minnesota, where he received his B.A. (1950), M.A. (1952), and Ph.D. (1954), all in philosophy. His dissertation, “The Logical Structure of Moral Reasoning”, was written under the direction of Wilfrid Sellars. He returned to teach in Guatemala, and then received a scholarship to study at Oxford University (1955–1956), after which he took a sabbatical-replacement position in philosophy at Duke University (1956). His first full-time academic appointment was at Wayne State University (1957– 1969), where he founded the philosophy journal Noˆus (1967, a counter-offer made to him by Wayne State to encourage him to stay there rather than to take the chairmanship of philosophy at the University of Pennsylvania). In 1969, he moved (along with several of his Wayne colleagues) to Indiana University, where he eventually became the Mahlon Powell Professor of Philosophy and, later, its first Dean of Latino Affairs (1978–1981). He remained at Indiana until his death. He was also a visiting professor of philosophy at the University of Texas at Austin (1962–1963) and a fellow at the Center for Advanced Study in the Behavioral Sciences (1981–1982). He received grants and fellowships from the Guggenheim Foundation (1967–1968), the T. Andrew Mellon Foundation, the National Endowment for the Humanities, and the National Science Foundation. He was elected President of the American Philosophical Association Central Division (1979– 1980), named to the American Academy of Arts and Sciences (1990), and received the Presidential Medal of Honor from the Government of Guatemala (1991). Casta˜neda’s philosophical interests spanned virtually the entire spectrum of philosophy, and his theories form a highly interconnected whole.. (shrink)

If the world itself is metaphysically indeterminate in a specified respect, what follows? In this paper, we develop a theory of metaphysical indeterminacy answering this question.

In this article I argue that "Timaeus" 48e-52d, the passage in which Plato introduces the receptacle into his ontology, Contains the material for a satisfactory response to the third man argument. Plato's use of "this" and "such" to distinguish the receptacle, Becoming, And the forms clarifies the nature of his ontology and indicates that the forms are not, In general, self-predicative. This result removes one argument against regarding the "Timaeus" as a late dialogue.

Decisions are made under uncertainty when there are distinct outcomes of a given action, and one is uncertain to which the act will lead. Decisions are made under indeterminacy when there are distinct outcomes of a given action, and it is indeterminate to which the act will lead. This paper develops a theory of (synchronic and diachronic) decision-making under indeterminacy that portrays the rational response to such situations as inconstant. Rational agents have to capriciously and randomly choose how to resolve (...) the indeterminacy relevant to a given choice-situation, but such capricious choices once made constrain how they will choose in the future. The account is illustrated by the case of self-interested action in situations where it is indeterminate whether you yourself will survive to benefit or suffer the consequences. The conclusion emphasizes some distinctive anti-hedging predictions of the account. (shrink)

It is well known that people from other disciplines have made significant contributions to philosophy and have influenced philosophers. It is also true (though perhaps not often realized, since philosophers are not on the receiving end, so to speak) that philosophers have made significant contributions to other disciplines and have influenced researchers in these other disciplines, sometimes more so than they have influenced philosophy itself. But what is perhaps not as well known as it ought to be is that researchers (...) in other disciplines, writing in those other disciplines' journals and conference proceedings, are doing philosophically sophisticated work, work that we in philosophy ignore at our peril. Work in cognitive science and artificial intelligence (AI) often overlaps such paradigmatic philosophical specialties as logic, the philosophy of mind, the philosophy of language, and the philosophy of action. This special issue offers a sampling of research in cognitive science and AI that is philosophically relevant and philosophically sophisticated. (shrink)