- 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.
|
|
|
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 (...) |
|
|
Although much technical and philosophical attention has been given to relevance logics, the notion of relevance itself is generally left at an intuitive level. It is difficult to find in the literature an explicit account of relevance in formal reasoning. In this article I offer a formal explication of the notion of relevance in deductive logic and argue that this notion has an interesting place in the study of classical logic. The main idea is that a premise is relevant to (...) |
|
|
Informally rigorous mathematical reasoning is relevant. So too should be the premises to the conclusions of formal proofs that regiment it. The rule Ex Falso Quodlibet induces spectacular irrelevance. We therefore drop it. The resulting systems of Core Logic C and Classical Core Logic C+ can formalize all the informally rigorous reasoning in constructive and classical mathematics respectively. We effect a revised match-up between deducibility in Classical Core Logic and a new notion of relevant logical consequence. It matches better the (...) |
|
|
The system of natural deduction that originated with Gentzen , and for which Prawitz proved a normalization theorem, is re-cast so that all elimination rules are in parallel form. This enables one to prove a very exigent normalization theorem. The normal forms that it provides have all disjunction-eliminations as low as possible, and have no major premisses for eliminations standing as conclusions of any rules. Normal natural deductions are isomorphic to cut-free, weakening-free sequent proofs. This form of normalization theorem renders (...) |
|
|
This is in part a reply to a recent work of Vidal-Rosset, which expresses various mistaken beliefs about Core Logic. Rebutting these leads us further to identify, and argue against, some mistaken core beliefs about logic. |
|
|
|
|
|
I discuss paradoxes of implication in the setting of a proof-conditional theory of meaning for logical constants. I argue that a proper logic of implication should be not only relevant, but also constructive and nonmonotonic. This leads me to select as a plausible candidate LL, a fragment of linear logic that differs from R in that it rejects both contraction and distribution. |
|
|
We report on progress and an unsolved problem in our attempt to obtain a clear rationale for relevance logic via semantic decomposition trees. Suitable decomposition rules, constrained by a natural parity condition, generate a set of directly acceptable formulae that contains all axioms of the well-known system R, is closed under substitution and conjunction, satisfies the letter-sharing condition, but is not closed under detachment. To extend it, a natural recursion is built into the procedure for constructing decomposition trees. The resulting (...) |
|
|
A conclusion follows from given premisses if and only if an acceptable counterfactual-supporting covering generalization of the argument rules out, either definitively or with some modal qualification, simultaneous acceptability of the premisses and non-accepta-bility of the conclusion, even though it does not rule out acceptability of the premisses and does not require acceptability of the conclusion independently of the premisses. Hence the reiterative associated conditional of an argument is true if and only it has such a covering generalization, and a (...) |
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-5ff6c685cb-dmxst uwo