In this book we present a collection of papers on the topic of applying paraconsistent logic to solve inconsistency related problems in science, mathematics and computer science. The goal is to develop, compare, and evaluate different ways of applying paraconsistent logic. After more than 60 years of mainly theoretical developments in many independent systems of paraconsistent logic, we believe the time has come to compare and apply the developed systems in order to increase our philosophical understanding of reasoning when faced (...) with inconsistencies. This book wants to be a first step toward an application based, constructive debate to tackle the question which systems are best applied for which kind of problems and which philosophical conclusions can be drawn from such applications. (shrink)

In this paper I propose a new approach to the foundation of mathematics: non-monotonic set theory. I present two completely different methods to develop set theories based on adaptive logics. For both theories there is a finitistic non-triviality proof and both theories contain (a subtle version of) the comprehension axiom schema. The first theory contains only a maximal selection of instances of the comprehension schema that do not lead to inconsistencies. The second allows for all the instances, also the inconsistent (...) ones, but restricts the conclusions one can draw from them in order to avoid triviality. The theories have enough expressive power to form a justification/explication for most of the established results of classical mathematics. They are therefore not limited by Gödel’s incompleteness theorems. This remarkable result is possible because of the non-recursive character of the final proofs of theorems of non-monotonic theories. I shall argue that, precisely because of the computational complexity of these final proofs, we cannot claim that non-monotonic theories are ideal foundations for mathematics. Nevertheless, thanks to their strength, first order language and the recursive dynamic (defeasible) proofs of theorems of the theory, the non-monotonic theories form (what I call) interesting pragmatic foundations. (shrink)

In this article complexity results for adaptive logics using the minimal abnormality strategy are presented. It is proven here that the consequence set of some recursive premise sets is $\Pi _1^1 - complete$ . So, the complexity results in (Horsten and Welch, Synthese 158:41–60,2007) are mistaken for adaptive logics using the minimal abnormality strategy.

A detailed analysis of joint-contribution of premises and conclusions in classically valid sequents is presented in terms of hypergraphs. In (Saint-Germier, P., Verdée, P., & Villalonga, P. T. (2024). _Relevant entailment and logical ground. Philosophical Studies_ (pp. 1–43). https://doi.org/10.1007/s11098-024-02101-1 ), this idea of joint-contribution is introduced and motivated as a method for characterizing four kinds of relevant validity, in the sense of selecting the relevantly valid sequents among the classically valid sequents. The account in (Saint-Germier, P., Verdée, P., (...) & Villalonga, P. T. (2024). _Relevant entailment and logical ground. Philosophical Studies_ (pp. 1–43). https://doi.org/10.1007/s11098-024-02101-1 ) is built on a calculus, called \(\textsf{GLK}^{\hbox {a}}\), which proves grounding claims for (enthymematically) valid sequents. In the present paper an adequate representation of \(\textsf{GLK}^{\hbox {a}}\) is given in terms of hypergraphs. The hypergraphs are a kind of diagrammatic proofs for Classical Propositional Logic, entirely based on the grounds of premises and conclusions. The hypergraphs and their visualization provide insights into the relations between premises and conclusions and into the way validity is produced by the binding of premises and conclusions via their partial grounds. They visualize the network of elements of the sequent that contribute to its logical validity. Non-contributing (i.e. irrelevant) premises and conclusions are then specified to be those that are disconnected from the network, however one constructs the graphs. (shrink)

In this paper, we aim to devise a logic that can deal with both the paradoxes that motivate dialetheism and the paradoxes related to the irrelevance of material implication. We propose the semantics and the sequent calculus of a relevant logic inspired by difference-making accounts of causation and arguably true to Graham Priest’s Logic of Paradox \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {LP}$$\end{document}: a relevant logic that validates those and only those \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} (...) \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {LP}$$\end{document}-consequences that are not irrelevant. The new logic’s relevant implication is then added to \documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathbf {LP}$$\end{document} to obtain a logic with the logical vocabulary required to cope with the mentioned paradoxes. (shrink)

In this article, I present a dynamic logic game for defeasible reasoning. I argue that, as far as defeasible reasoning is concerned, one should distinguish between practical and ideal rationality. Starting from the adaptive logic framework, I formalize both rationality notions by means of logic games. The presented adaptive logic games are based on (i) standard logic games on the one hand and (ii) dynamic proof procedures for adaptive logic on the other hand. The games are similar to standard logic (...) games, but have the extra property that some moves are revisable. This is handled by means of a main control game, which starts different standard logic games. I argue that the adaptive logic games form intuitive reasoning models for rationality in defeasible reasoning contexts. Moreover, I will also demonstrate that the games give a good insight in the computational complexity of defeasible reasoning forms. (shrink)

In this paper we first develop a logic independent account of relevant implication. We propose a stipulative denition of what it means for a multiset of premises to relevantly L-imply a multiset of conclusions, where L is a Tarskian consequence relation: the premises relevantly imply the conclusions iff there is an abstraction of the pair such that the abstracted premises L-imply the abstracted conclusions and none of the abstracted premises or the abstracted conclusions can be omitted while still maintaining valid (...) L-consequence. Subsequently we apply this denition to the classical logic consequence relation to obtain NTR-consequence, i.e. the relevant CL-consequence relation in our sense, and develop a sequent calculus that is sound and complete with regard to relevant CL-consequence. We present a sound and complete sequent calculus for NTR. In a next step we add rules for an object language relevant implication to the sequent calculus. The object language implication reflects exactly the NTR-consequence relation. One can see the resulting logic NTR-> as a relevant logic in the traditional sense of the word. By means of a translation to the relevant logic R, we show that the presented logic NTR is very close to relevance logics in the Anderson-Belnap-Dunn-Routley-Meyer tradition. However, unlike usual relevant logics, NTR is decidable for the full language, Disjunctive Syllogism and Adjunction are valid, and neither Modus Ponens nor the Cut rule are admissible. (shrink)

In this paper, we present a generic format for adaptive vague logics. Logics based on this format are able to (1) identify sentences as vague or non-vague in light of a given set of premises, and to (2) dynamically adjust the possible set of inferences in accordance with these identifications, i.e. sentences that are identified as vague allow only for the application of vague inference rules and sentences that are identified as non-vague also allow for the application of some extra (...) set of classical logic rules. The generic format consists of a set of minimal criteria that must be satisfied by the vague logic in casu in order to be usable as a basis for an adaptive vague logic. The criteria focus on the way in which the logic deals with a special ⊡-operator. Depending on the kind of logic for vagueness that is used as a basis for the adaptive vague logic, this operator can be interpreted as completely true, definitely true, clearly true, etc. It is proven that a wide range of famous logics for vagueness satisfies these criteria when extended with a specific ⊡-operator, e.g. fuzzy basic logic and its well known extensions, cf. [7], super- and subvaluationist logics, cf. [6], [9], and clarity logic, cf. [13]. Also a fuzzy logic is presented that can be used for an adaptive vague logic that can deal with higher-order vagueness. To illustrate the theory, some toy-examples of adaptive vague proofs are provided. (shrink)

It is shown that a set of semi-recursive logics, including many fragments of CL, can be embedded within CL in an interesting way. A logic belongs to the set iff it has a certain type of semantics, called nice semantics. The set includes many logics presented in the literature. The embedding reveals structural properties of the embedded logic. The embedding turns finite premise sets into finite premise sets. The partial decision methods for CL that are goal directed with respect to (...) CL are turned into partial decision methods that are goal directed with respect to the embedded logics. (shrink)

In this paper, we present a generic format for adaptive vague logics. Logics based on this format are able to (1) identify sentences as vague or non-vague in light of a given set of premises, and to (2) dynamically adjust the possible set of inferences in accordance with these identifications, i.e. sentences that are identified as vague allow only for the application of vague inference rules and sentences that are identified as non-vague also allow for the application of some extra (...) set of classical logic rules. The generic format consists of a set of minimal criteria that must be satisfied by the vague logic in casu in order to be usable as a basis for an adaptive vague logic. The criteria focus on the way in which the logic deals with a special ⊡-operator. Depending on the kind of logic for vagueness that is used as a basis for the adaptive vague logic, this operator can be interpreted as completely true, definitely true, clearly true, etc. It is proven that a wide range of famous logics for vagueness satisfies these criteria when extended with a specific ⊡-operator, e.g. fuzzy basic logic and its well known extensions, cf. [7], super- and subvaluationist logics, cf. [6], [9], and clarity logic, cf. [13]. Also a fuzzy logic is presented that can be used for an adaptive vague logic that can deal with higher-order vagueness. To illustrate the theory, some toy-examples of adaptive vague proofs are provided. (shrink)

In this paper, we first develop truthmaker semantics for four relevance logics defined as the non-transitive relevant cores [as introduced in Verdée et al. (Aust J Log 16:10–40, 2019)] of the well-known propositional logics CL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {CL}}$$\end{document} (classical logic), LP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {LP}}$$\end{document} (the logic of paradox), K3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {K3}}$$\end{document} (strong Kleene logic), and FDE\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} (...) \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {FDE}}$$\end{document} (first degree entailment). The semantics is similar to Kit Fine’s truthmaker semantics for classical logic, but we define the notion of exact verification similarly to Fine’s notion of loose verification. Dropping Fine’s principle of Downward Closure of the set of consistent states nevertheless warrants the exactness of our verification notion. The semantics of the four non-transitive relevance logics shows that they are in fact straightforward cut-free substructural logics, despite their definition by means of a filtering criterion. We develop the associated sound and complete sequent calculi for these logics. Finally, we argue that the four presented truthmaker semantics are also interesting alternatives to the standard Kit Fine style truthmaker semantics for the original (irrelevant) consequence relations FDE\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {FDE}}$$\end{document}, LP\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {LP}}$$\end{document}, K3\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {K3}}$$\end{document}, and CL\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\textbf {CL}}$$\end{document} themselves. The most interesting difference with Fine’s approach is the way in which tautologies are handled: next to their usual verifiers, they are also made true by the empty state. We provide philosophical arguments for the plausibility of such an account. (shrink)

This paper is devoted to a consequence relation combining the negation of Classical Logic ) and a paraconsistent negation based on Graham Priest’s Logic of Paradox ). We give a number of natural desiderata for a logic \ that combines both negations. They are motivated by a particular property-theoretic perspective on paraconsistency and are all about warranting that the combining logic has the same characteristics as the combined logics, without giving up on the radically paraconsistent nature of the paraconsistent negation. (...) We devise the logic \ by means of an axiomatization and three equivalent semantical characterizations. By showing that this logic is maximally paraconsistent, we prove that \ is the only logic satisfying all postulated desiderata. Finally we show how the logic’s infinite-valued semantics permits defining different types of entailment relations. (shrink)

In this paper, we present a generic format for adaptive vague logics. Logics based on this format are able to (1) identify sentences as vague or non-vague in light of a given set of premises, and to (2) dynamically adjust the possible set of inferences in accordance with these identifications, i.e. sentences that are identified as vague allow only for the application of vague inference rules and sentences that are identified as non-vague also allow for the application of some extra (...) set of classical logic rules. The generic format consists of a set of minimal criteria that must be satisfied by the vague logic in casu in order to be usable as a basis for an adaptive vague logic. The criteria focus on the way in which the logic deals with a special ⊡-operator. Depending on the kind of logic for vagueness that is used as a basis for the adaptive vague logic, this operator can be interpreted as completely true, definitely true, clearly true , etc. It is proven that a wide range of famous logics for vagueness satisfies these criteria when extended with a specific ⊡-operator, e.g. fuzzy basic logic and its well known extensions, cf. [7], super- and subvaluationist logics, cf. [6], [9], and clarity logic, cf. [13]. Also a fuzzy logic is presented that can be used for an adaptive vague logic that can deal with higher-order vagueness. To illustrate the theory, some toy-examples of adaptive vague proofs are provided. (shrink)

This paper presents eight (previously unpublished) adaptive logics for belief revision, each of which define a belief revision operation in the sense of the AGM framework. All these revision operations are shown to satisfy the six basic AGM postulates for belief revision, and Parikh's axiom of Relevance. Using one of these logics as an example, we show how their proof theory gives a more dynamic flavor to belief revision than existing approaches. It is argued that this turns belief revision (that (...) obeys Relevance) into a more natural undertaking, where analytic steps are performed only as soon as they turn out to be necessary in order to uphold certain beliefs. (shrink)

According to an intuitive picture of relevant entailment, an entailment is relevant if all the formulas it contains contribute to its validity. In this paper, we provide a ground-theoretic analysis of this notion of contribution, and as a result of relevant entailment. We build a system of bilateral logical grounding within which we can derive classical entailment and analyze the contribution of premises and conclusions, in terms of a certain type of connection between their respective logical grounds. The resulting framework (...) is shown to have a strong unifying and explanatory power by bringing together the notions of grounding and relevance and explaining the commonalities and differences between alternative contribution-based accounts of relevance. (shrink)

The early calculus is a popular example of an inconsistent but fruitful scientific theory. This paper is concerned with the formalisation of reasoning processes based on this inconsistent theory. First it is shown how a formal reconstruction in terms of a sub-classical negation leads to triviality. This is followed by the evaluation of the chunk and permeate mechanism proposed by Brown and Priest in, 379–388, 2004) to obtain a non-trivial formalisation of the early infinitesimal calculus. Different shortcomings of this application (...) of C&P as an explication of inconsistency tolerant reasoning are pointed out, both conceptual and technical. To remedy these shortcomings, an adaptive logic is proposed that allows for conditional permeations of formulas under the assumption of consistency preservation. First the adaptive logic is defined and explained and thereafter it is demonstrated how this adaptive logic remedies the defects C&P suffered from. (shrink)

In this paper we present a logic that determines when implications in a classical logic context express a relevant connection between antecedent and consequent. In contrast with logics in the relevance logic literature, we leave classical negation intact—in the sense that the law of non-contradiction can be used to obtain relevant implications, as long as there is a connection between antecedent and consequent. On the other hand, we give up the requirement that our theory of relevance should be able to (...) define a new standard of deduction. We present and argue for a list of requirements such a logical theory of classical relevance needs to meet and go on to formulate a system that respects each of these requirements. The presented system is a Tarski logic that extends the relevance logic R with a new relevant implication which allows for Disjunctive Syllogism and similar rules. This is achieved by interpreting the logical symbols in the antecedents in a stronger way than the logical symbols in consequents. A proof theory and an algebraic semantics are formulated and interesting metatheorems are proven. Finally we give a philosophical motivation for our non-standard relevant implication and the asymmetric interpretation of antecedents and consequents. (shrink)

For Tarski logics, there are simple criteria that enable one to conclude that two premise sets are equivalent. We shall show that the very same criteria hold for adaptive logics, which is a major advantage in comparison to other approaches to defeasible reasoning forms. A related property of Tarski logics is that the extensions of equivalent premise sets with the same set of formulas are equivalent premise sets. This does not hold for adaptive logics. However a very similar criterion does. (...) We also shall show that every monotonic logic weaker than an adaptive logic is weaker than the lower limit logic of the adaptive logic or identical to it. This highlights the role of the lower limit for settling the adaptive equivalence of extensions of equivalent premise sets. (shrink)

This paper answers the philosophical contentions defended in Horsten and Welch . It contains a description of the standard format of adaptive logics, analyses the notion of dynamic proof required by those logics, discusses the means to turn such proofs into demonstrations, and argues that, notwithstanding their formal complexity, adaptive logics are important because they explicate an abundance of reasoning forms that occur frequently, both in scientific contexts and in common sense contexts.

This paper answers the philosophical contentions defended in Horsten and Welch (2007, Synthese, 158, 41–60). It contains a description of the standard format of adaptive logics, analyses the notion of dynamic proof required by those logics, discusses the means to turn such proofs into demonstrations, and argues that, notwithstanding their formal complexity, adaptive logics are important because they explicate an abundance of reasoning forms that occur frequently, both in scientific contexts and in common sense contexts.

I how, in contrast to Verdée, that one may think of classical consequence as a form of inexact entailment within a standard modalized state space.

One does not simply predict where the other will go, which is wherever the first predicts the second to predict the first to go, and so ad infinitum. Not "What would I do if I were she?" but "What would I do if I were she wondering what she would do if she were wondering what I would do if I were she...?".

Personality, Consciousness and Nirvana in Early Buddhism Peter Harvey. The. SELFLESS. MIND. PERSQNALITY, CONSCIOUSNESS AND NIRVANA IN EARLY BUDDHISM. PETER. HARVEY. THE SELFLESS MIND THE SELFLESS ...

Current epistemological orthodoxy has it that knowledge is incompatible with luck. More precisely: Knowledge is incompatible with epistemic luck . This is often treated as a truism which is not even in need of argumentative support. In this paper, I argue that there is lucky knowledge. In the first part, I use an intuitive and not very developed notion of luck to show that there are cases of knowledge which are “lucky” in that sense. In the second part, I look (...) at philosophical conceptions of luck and come to the conclusion that knowledge can be lucky in those senses, too. I also turns out that a probabilistic notion of luck can help us see in what ways a particular piece of knowledge or belief can be lucky or not lucky. (shrink)

David Chalmers argues that virtual objects exist in the form of data structures that have causal powers. I argue that there is a large class of virtual objects that are social objects and that do not depend upon data structures for their existence. I also argue that data structures are themselves fundamentally social objects. Thus, virtual objects are fundamentally social objects.

Propositional quantifiers are added to a propositional modal language with two modal operators. The resulting language is interpreted over so-called products of Kripke frames whose accessibility relations are equivalence relations, letting propositional quantifiers range over the powerset of the set of worlds of the frame. It is first shown that full second-order logic can be recursively embedded in the resulting logic, which entails that the two logics are recursively isomorphic. The embedding is then extended to all sublogics containing the logic (...) of so-called fusions of frames with equivalence relations. This generalizes a result due to Antonelli and Thomason, who construct such an embedding for the logic of such fusions. (shrink)

In lieu of an abstract, here is a brief excerpt of the content:Philosophy, Psychiatry, & Psychology 10.2 (2003) 161-167 [Access article in PDF] Social, Cognitive, and Neural Constraints on Subjectivity and Agency:Implications for Dissociative Identity Disorder Peter Q. Deeley In this commentary, I consider Matthew's argument after making some general observations about dissociative identity disorder (DID). In contrast to Matthew's statement that "cases of DID, although not science fiction, are extraordinary" (p. 148), I believe that there are natural analogs (...) of the disorder that, when considered, make it seem less puzzling and exotic. After discussing these examples, I examine the relations between social, cognitive, and neural processes supporting subjectivity and agency, to identify sources of personal identity in cases of DID that can be used as a basis for assessing Matthew's points against Behnke and Sinnott-Armstrong. I am not proposing a comprehensive theory, but rather identifying what I believe are components of such a theory. I then outline an approach to determining criminal responsibility in DID, drawing on analogies with other psychiatric disorders. Dissociative Identity Disorder DID is a disorder described in DSM-IV, which "is characterised by the presence of two or more distinct identities or personality states that recurrently take control of the individual's behaviour accompanied by an inability to recall important personal information that is too extensive to be explained by ordinary forgetfulness" (American Psychiatric Association, p. 519). Recognizing Personal Identity How is personal identity recognized in normal cognition? If we take personhood to involve recognition of continuity of social, psychological, and physical identity for a given individual, then such judgments are routinely made rapidly and automatically as an aspect of what has come to be termed social cognition (Adolphs 2003). There is likely to be considerable redundancy in [End Page 161] the types of information used to make judgments about whether a person is the same as one who was previously encountered, or perhaps heard about—for example, facial features, movement patterns, speech prosody, dress, speech content, gender, ethnicity, social role, among other features, all provide information about individual identity, and hence personhood. When uncertainty exists, it is likely to reflect a loss or alteration of cues that would ordinarily be used in a rapid, automatic, unexamined way (Adolphs 2003). In such extreme cases (for example, severe mental illness or disfigurement), the problem of identification becomes the subject of explicit reasoning (and hence of potential disagreement, because we then engage in post hoc rationalizations to establish criteria for determining personhood, whereas normally we rely on essentially automatic, implicit abilities that work in most circumstances, some of which make little use of linguistic representations and formal reasoning—for example, individual facial identity recognition, which may occur as quickly as 170 ms after stimulus onset [Adolphs 2003]). Nevertheless, examining our judgments and intuitions in cases that force us to explicitly consider whether personal identity is preserved may provide analogies and clues for how we should proceed with DID. Let us consider, then, some natural analogs of DID. Natural Analogs of DID Method Acting I suggest that method acting is an analog of DID (Manderino 1985). Method acting refers to an approach to acting training and performance in which emphasis is placed on intensely imagining and identifying with the mental life of the character being portrayed. Training courses and manuals list many techniques and practices that can be used to facilitate absorption in a role, drawing on different kinds of memory—for example, experiential memories, memories of others, general knowledge (semantic memory), and memories of sensations and feelings, to creative a vivid sense of the subjective experience and actions of the character. Manderino, a method acting teacher, comments: "it is important to investigate the way in which your own mental makeup can improperly influence a character. Insecurities, self-consciousness, shyness or self-doubts can maintain a strong hold, and permitting any of these feelings to enter a performance is to remain the actor and not enter into the mental life of the character. For some, acting allows personal problems to be left behind, and they are thankful for the complete escape that... (shrink)

RÉSUMÉLes œuvres musicales sont à la fois multiples et audibles. Dans le domaine de l'ontologie musicale, deux des principaux modèles conçus pour expliquer ces caractéristiques des œuvres musicales sont le modèle type/instanciation et le modèle étape/continuité. Julian Dodd a soutenu que le modèle type/instanciation a un avantage sur le modèle étape/continuité, car il peut offrir une explication directe de l'audibilité des œuvres musicales en termes de catégorie ontologique. Je défends le modèle étape/continuité contre l'argument de Dodd en invoquant une relation (...) de continuité qui unifie l’œuvre. (shrink)

Discovering a deep unity in Nietzsche's work by exploring the structure and argumentative movement of a wide range of his books, Berkowitz shows that Nietzsche is a moral and political philosopher in the Socratic sense whose governing question is, "What is the best life?".

Occurrents are entities that exist in time and, with few or no exceptions, extend over time as well, that is, they have parts corresponding to the different times at which they exist. This makes it very easy to say what makes it true that they exist at the times at which they do. Singular existential propositions, being contingent, positive and arguably atomic, stand in need of truth-makers, entities in virtue of whose existence they are true. The obvious candidate for what (...) makes it true that Tony Blair exists is the Right Honourable Member for Sedgefield himself: by virtue of his existing, it is true that he exists. Nothing could be more straightforward. However, things that exist in time, with few exceptions, exist at some times and not at others. So a proposition to the effect that a certain object exists at a certain time likewise stands in need of a truth-maker, one matching the requirements of the existential proposition in question in its temporal specificity. Take an occurrent such as a boxing match and suppose it is going on twenty minutes after starting: by virtue of what is this true? The obvious answer here is that it is by virtue of the existence of that temporal part or phase which extends just over the time in question. Other temporal parts of the same occurrent which do not extend over this time do not act as truth-maker for the temporally specific existential proposition, this one does. There is no problem because occurrents do have temporal parts which can do this job. (shrink)

We present Birch and colleagues with a dilemma. On one interpretation, they aim to chart the distribution of a sort of minimal perceptual awareness across the animal kingdom, where that awareness can be fully characterized in third-person psychological terms. On this interpretation, the project is worthy but dull, since it doesn’t touch the question that has excited most people: whether other animals are phenomenally conscious. On an alternative interpretation, in contrast, they hope to resolve this latter question, arguing that phenomenal (...) consciousness is extremely widespread. But if this is their intention, then their argument begs the question. (shrink)

In replying to my review of The Case for Animal Rights in The New York Review of Books, Tom Regan notes that whereas I use the term ‘the animal liberation movement’ to refer to the many people and organizations around the world advocating a complete change in the moral status of animals, he prefers the label ‘animal rights movement’. There is, he says, ‘more than a verbal difference here’. For immediate practical purposes the difference may not matter very much—Regan and (...) I are plainly at one in our attempts to eliminate the atrocities now inflicted on animals in factory farms, laboratories and in the wild. I am even prepared to speak of ‘animal rights’—just as I am prepared to speak of ‘human rights’—as a shorthand reference to the way in which the needs and desires of animals give rise to moral obligations on our part. But the philosophical difference between those who, like Regan, ground their case for animals on claims about rights, and those who, like me, do not, is fundamental. In the long run it may also have practical implications. This essay explains why I do not, philosophically, accept the animal rights approach. (shrink)

Suppose you are stranded on an island and you want to get over to the nearby mainland. Your only option is to swim. But is the other shore close enough? If you embark and it isn’t, you drown. So you prefer to know before taking off. Happily, you are well equipped. You have not only a yardstick, but also a theodolite for measuring angles, and a good knowledge of trigonometry. You then determine the distance to the other shore by means (...) of triangulation. You fix two points, A and B, on your own shore, and identify a third point, C, in sight on the opposite shore. You then measure the distance between A and B with your yardstick, and the two angles ABC and CAB with your theodolite. With this information you can calculate the distances AC and BC to the other shore. (shrink)

Everyone allows that human and animal minds are distinctively (indeed, massively) different in their manifest effects. Humans have been able to colonize nearly every corner of the planet, from the artic, to deserts, to rainforests (and they did so in the absence of modern technological aids); they live together in large cooperative groups of unrelated individuals; they communicate with one another using the open-ended expressive resources of natural language; they are capable of cultural learning that accumulates over generations to result (...) in science, art, and agriculture; and they are remarkably thoughtful and inventive. There is much less agreement about how these manifest differences should be explained, however. (shrink)

We introduce a dynamic model for evolutionary games played on a network where strategy changes are correlated according to degree of influence between players. Unlike the notion of stochastic stability, which assumes mutations are stochastically independent and identically distributed, our framework allows for the possibility that agents correlate their strategies with the strategies of those they trust, or those who have influence over them. We show that the dynamical properties of evolutionary games, where such influence neighborhoods appear, differ dramatically from (...) those where all mutations are stochastically independent, and establish some elementary convergence results relevant for the evolution of social institutions. (shrink)