- Submit
-
Browse
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- More
Switch to: References
Citations of:
Add citations
You must login to add citations.
|
|
|
The paper concerns time, change and contradiction, and is in three parts. The first is an analysis of the problem of the instant of change. It is argued that some changes are such that at the instant of change the system is in both the prior and the posterior state. In particular there are some changes from p being true to p being true where a contradiction is realized. The second part of the paper specifies a formal logic which accommodates (...) |
|
|
This paper argues for tlie claims that a) a natural language such as English is semanticaly closed b) semantic closure implies inconsistency. A corollary of these is that the semantics of English must be paraconsistent. The first part of the paper formulates a definition of semantic closure which applies to natural languages and shows that this implies inconsistency. The second section argues that English is semeantically closed. The preceding discussion is predicated on the assumption that there are no truth value (...) |
|
|
The paper explains how a paraconsistent logician can appropriate all classical reasoning. This is to take consistency as a default assumption, and hence to work within those models of the theory at hand which are minimally inconsistent. The paper spells out the formal application of this strategy to one paraconsistent logic, first-order LP. (See, Ch. 5 of: G. Priest, In Contradiction, Nijhoff, 1987.) The result is a strong non-monotonic paraconsistent logic agreeing with classical logic in consistent situations. It is shown (...) |
|
|
|
|
|
|
|
|
We have seen that proofs of soundness of (Boolean) DS, EFQ and of ABS — and hence the legitimation of these inferences — can be achieved only be appealing to the very form of reasoning in question. But this by no means implies that we have to fall back on classical reasoning willy-nilly. Many logical theories can provide the relevant boot-strapping. Decision between them has, therefore, to be made on other grounds. The grounds include the many criteria familiar from the (...) |
|
|
|
|
|
The paper gives a semantics for naive (inconsistent) set theory in terms of substitutional quantification. Soundness is proved in an appendix. In the light of this construction, Several philosophical issues are discussed, Including mathematical necessity and the set theoretic paradoxes. Most importantly, It is argued, These semantics allow for a nominalist account of mathematical truth not committed to the existence of a domain of abstract entities. |
|
|
Davidson conjectured that suitably formulated Tarski-style theories of truth can “do duty” as theories of meaning for the spoken languages that humans naturally acquire. But this conjecture faces a pair of old objections that are, in my view, fatal when combined. Foster noted that given any theory of the sort Davidson envisioned, for a language L, there will be many equally true theories whose theorems pair endlessly many sentences of L with very different specifications of whether or not those sentences (...) |
|
|
Weakening classical logic is one of the most popular ways of dealing with semantic paradoxes. Their advocates often claim that such weakening does not affect non-semantic reasoning. Recently, however, Halbach and Horsten have shown that this is actually not the case for Kripke’s fixed-point theory based on the Strong Kleene evaluation scheme. Feferman’s axiomatization $\textsf{KF}$ in classical logic is much stronger than its paracomplete counterpart $\textsf{PKF}$, not only in terms of semantic but also in arithmetical content. This paper compares the (...) |
|
|
On an internalist account of logical inference, we are warranted in drawing conclusions from accepted premises on the basis of our knowledge of logical laws. Lewis Carroll’s regress challenges internalism by purporting to show that this kind of warrant cannot ground the move from premises to conclusion. Carroll’s regress vindicates a repudiation of internalism and leads to the espousal of a standpoint that regards our inferential practice as not being grounded on our knowledge of logical laws. Such a standpoint can (...) |
|
|
On an internalist account of logical inference, we are warranted in drawing conclusions from accepted premises on the basis of our knowledge of logical laws. Lewis Carroll's regress challenges internalism by purporting to show that this kind of warrant cannot ground the move from premises to conclusion. Carroll's regress vindicates a repudiation of internalism and leads to the espousal of a standpoint that regards our inferential practice as not being grounded on our knowledge of logical laws. Such a standpoint can (...) |
|
|
In this introduction to the special issue “40 years of FDE”, we offer an overview of the field and put the papers included in the special issue into perspective. More specifically, we first present various semantics and proof systems for FDE, and then survey some expansions of FDE by adding various operators starting with constants. We then turn to unary and binary connectives, which are classified in a systematic manner. First-order FDE is also briefly revisited, and we conclude by listing (...) |
|
|
Bertrand Russell’s 1906 article ‘The Theory of Implication’ contains an algebraic weak completeness proof for classical propositional logic. Russell did not present it as such. We give an exposition of the proof and investigate Russell’s view of what he was about, whether he could have appreciated the proof for what it is, and why there is no parallel of the proof in Principia Mathematica. |
|
|
Intervals in boolean algebras enter into the study of conditional assertions (or events) in two ways: directly, either from intuitive arguments or from Goodman, Nguyen and Walker's representation theorem, as suitable mathematical entities to bear conditional probabilities, or indirectly, via a representation theorem for the family of algebras associated with de Finetti's three-valued logic of conditional assertions/events. Further representation theorems forge a connection with rough sets. The representation theorems and an equivalent of the boolean prime ideal theorem yield an algebraic (...) |
|
|
Given the plethora of competing logical theories of validity available, it’s understandable that there has been a marked increase in interest in logical epistemology within the literature. If we are to choose between these logical theories, we require a good understanding of the suitable criteria we ought to judge according to. However, so far there’s been a lack of appreciation of how logical practice could support an epistemology of logic. This paper aims to correct that error, by arguing for a (...) |
|
|
|
|
|
In this paper, I will characterize a new class of inconsistency-adaptive logics, namely inconsistency-adaptive modal logics. These logics cope with inconsistencies in a modal context. More specifically, when faced with inconsistencies, inconsistency-adaptive modal logics avoid explosion, but still allow the derivation of sufficient consequences to adequately explicate the part of human reasoning they are intended for. |
|
|
Curiously, though he provides in Making It Explicit (MIE) elaborate accounts of various representational idioms, of anaphora and deixis, and of quantification, Robert Brandom nowhere attempts to lay out how his understanding of content and his view of the role of logical idioms combine in even the simplest cases of what he calls paradigmatic logical vocabulary. That is, Brandom has a philosophical account of content as updating potential - as inferential potential understood in the sense of commitment or entitlement preservation (...) |
|
|
Every truth-functional three-valued propositional logic can be conservatively translated into the modal logic S5. We prove this claim constructively in two steps. First, we define a Translation Manual that converts any propositional formula of any three-valued logic into a modal formula. Second, we show that for every S5-model there is an equivalent three-valued valuation and vice versa. In general, our Translation Manual gives rise to translations that are exponentially longer than their originals. This fact raises the question whether there are (...) |
|
|
I present two measures of information for both consistentand inconsistent sets of sentences in a finite language ofpropositional logic. The measures of information are based onmeasures of inconsistency developed in Knight (2002).Relative information measures are then provided corresponding to thetwo information measures. |
|
|
Belnap-Dunn logic, sometimes also known as First Degree Entailment, is a four-valued propositional logic that complements the classical truth values of True and False with two non-classical truth values Neither and Both. The latter two are to account for the possibility of the available information being incomplete or providing contradictory evidence. In this paper, we present a probabilistic extension of BD that permits agents to have probabilistic beliefs about the truth and falsity of a proposition. We provide a sound and (...) |
|
|
Analyzing situations where information is partial, incomplete or contradictory has created a demand for quantitative belief measures that are weaker than classic probability theory. In this paper, we compare two frameworks that have been proposed for this task, Dempster-Shafer theory and non-standard probability theory based on Belnap-Dunn logic. We show the two frameworks to assume orthogonal perspectives on informational shortcomings, but also provide a partial correspondence result. Lastly, we also compare various dynamical rules of the two frameworks, all seen as (...) |
|
|
A survey is given of three-valued paraconsistent propositionallogics connected with Jaśkowski’s criterion for constructing paraconsistentlogics. Several problems are raised and four new matrix three-valued paraconsistent logics are suggested. |
|
|
Using methods of abstract logic and the theory of valuation, we prove that there is no paraconsistent negation obeying the law of double negation and such that $\neg(a\wedge\neg a)$ is a theorem which can be algebraized by a technique similar to the Tarski-Lindenbaum technique. |
|
|
ABSTRACTLinguistic evidence supports the claim that certain, weak rejections are less specific than assertions. On the basis of this evidence, it has been argued that rejected sentences cannot be premisses and conclusions in inferences. We give examples of inferences with weakly rejected sentences as premisses and conclusions. We then propose a logic of weak rejection which accounts for the relevant phenomena and is motivated by principles of coherence in dialogue. We give a semantics for which this logic is sound and (...) |
|
|
|
|
|
|
|
|
It has been an open question whether or not we can define a belief revision operation that is distinct from simple belief expansion using paraconsistent logic. In this paper, we investigate the possibility of meeting the challenge of defining a belief revision operation using the resources made available by the study of dynamic epistemic logic in the presence of paraconsistent logic. We will show that it is possible to define dynamic operations of belief revision in a paraconsistent setting. |
|
|
An approach to the treatment of inference in the presence of uncertain truth values is described, based on representing uncertainties by sets of ordinary (certain) truth values. Both the algebraic and the logical aspects are studied for a variety of lattices used as truth value spaces in the domain of many-valued logic. |
|
|
ABSTRACT In the paper we present a survey of some approaches to the semantics of many-valued propositional systems. These approaches are inspired on one hand by classical problems in the investigations of logical aspects of epistemic activity: knowledge and truth, contradictions, beliefs, reliability of data, etc. On the other hand they reflect contemporary concerns of researchers in Artificial Intelligence (and Cognitive Science in general) with inferences drawn from imperfect information, even from total ignorance. We treat the mathematical apparatus that has (...) |
|
|
With each proposition P we associate a set of proposition (a hyperproposition) which determines the order in which one may retreat from accepting P, if one cannot fully hold on to P. We first describe the structure of hyperpropositions. Then we describe two operations on propositions, subtraction and merge, which can be modelled in terms of hyperpropositions. Subtraction is an operation that takes away part of the content of a proposition. Merge is an operation that determines the maximal consistent content (...) |
|
|
|
|
|
|
|
|
A logic is called 'paraconsistent' if it rejects the rule called 'ex contradictione quodlibet', according to which any conclusion follows from inconsistent premises. While logicians have proposed many technically developed paraconsistent logical systems and contemporary philosophers like Graham Priest have advanced the view that some contradictions can be true, and advocated a paraconsistent logic to deal with them, until recent times these systems have been little understood by philosophers. This book presents a comprehensive overview on paraconsistent logical systems to change (...) |
|
|
Propositions are often aligned with truth-conditions. The view is mistaken, since propositions discriminate where truth conditions do not. Propositions are hyperintensional: they are sensitive to necessarily equivalent differences. I investigate an alternative view on which propositions are truthmaker conditions, understood as sets of possible truthmakers. This requires making metaphysical sense of merely possible states of affairs. The theory that emerges illuminates the semantic phenomena of samesaying, subject matter, and aboutness. |
|
|
|
|
|
|
|
|
1 What are the features of a paraconsistent negation? Since paraconsistent logic was launched by da Costa in his seminal paper [4], one of the fundamental problems has been to determine what exactly are the theoretical or metatheoretical properties of classical negation that can have a unary operator not obeying the principle of noncontradiction, that is, a paraconsistent operator. What the result presented here shows is that some of these properties are not compatible with each other, so that in constructing (...) |
|
|
The purpose of this essay is to shed some light on a certain type of sentence, which I call a borderline contradiction. A borderline contradiction is a sentence of the form F a ∧ ¬F a, for some vague predicate F and some borderline case a of F , or a sentence equivalent to such a sentence. For example, if Jackie is a borderline case of ‘rich’, then ‘Jackie is rich and Jackie isn’t rich’ is a borderline contradiction. Many theories (...) |
|
|
Supervaluational theories of vagueness have achieved considerable popularity in the past decades, as seen in eg [5], [12]. This popularity is only natural; supervaluations let us retain much of the power and simplicity of classical logic, while avoiding the commitment to strict bivalence that strikes many as implausible. Like many nonclassical logics, the supervaluationist system SP has a natural dual, the subvaluationist system SB, explored in eg [6], [28].1 As is usual for such dual systems, the classical features of SP (...) |
|
|
|
|
|
Is there only one logic? Or are there several equally adequate logics? What does it mean, after all, that different logics can be equally adequate? And they would be adequate with respect to what?This article intends to analyze the different answers to these questions, that is, we will evaluate the central arguments of the debate between pluralism, relativism and logical monism. We will explain,on the one hand, the main assumptions of this discussion and, on the other hand, its philosophical ramifications. (...) |
|
|
Many-valued logics are standardly defined by logical matrices. They are truth-functional. In this paper non truth-functional many-valued semantics are presented, in a philosophical and mathematical perspective. |
|
|
Max Cresswell and Hilary Putnam seem to hold the view, often shared by classical logicians, that paraconsistent logic has not been made sense of, despite its well-developed mathematics. In this paper, I examine the nature of logic in order to understand what it means to make sense of logic. I then show that, just as one can make sense of non-normal modal logics (as Cresswell demonstrates), we can make `sense' of paraconsistent logic. Finally, I turn the tables on classical logicians (...) |
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-64dd777598-g9b9l uwo