- 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: Citations
References in:
Games, Norms and Reasons: Logic at the Crossroads
Dordrecht, Netherland: Springer (2011)
Add references
You must login to add references.
|
|
|
We show how belief revision can be treated systematically in the format of dynamicepistemic logic, when operators of conditional belief are added. The core engine consists of definable update rules for changing plausibility relations between worlds, which have been proposed independently in the dynamic-epistemic literature on preference change. Our analysis yields two new types of modal result. First, we obtain complete logics for concrete mechanisms of belief revision, based on compositional reduction axioms. Next, we show how various abstract postulates for (...) |
|
|
|
|
|
A new semantics is presented for the logic of proofs (LP), [1, 2], based on the intuition that it is a logic of explicit knowledge. This semantics is used to give new proofs of several basic results concerning LP. In particular, the realization of S4 into LP is established in a way that carefully examines and explicates the role of the + operator. Finally connections are made with the conventional approach, via soundness and completeness results. |
|
|
We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t: F that read t is a justification for F. Justification Logic absorbs basic principles originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the well-known Justified True Belief vs. Knowledge problem. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a (...) |
|
|
Reasoning About Knowledge is the first book to provide a general discussion of approaches to reasoning about knowledge and its applications to distributed ... |
|
|
In 1959 Carnap published a probability model that was meant to allow forreasoning by analogy involving two independent properties. Maher (2000)derived a generalized version of this model axiomatically and defended themodel''s adequacy. It is thus natural to now consider how the model mightbe extended to the case of more than two properties. A simple extension waspublished by Hess (1964); this paper argues that it is inadequate. Amore sophisticated one was developed jointly by Carnap and Kemeny in theearly 1950s but never (...) |
|
|
|
|
|
This paper is a sequel to the joint publication of Scott and Krauss in which the first aspects of a mathematical theory are developed which might be called "First Order Probability Logic". No attempt will be made to present this additional material in a self-contained form. We will use the same notation and terminology as introduced and explained in Scott and Krauss, and we will frequently refer to the theorems stated and proved in the preceding paper. The main objective of (...) |
|
|
|
|
|
|
|
|
|
|
|
In 1933 Godel introduced a calculus of provability (also known as modal logic S4) and left open the question of its exact intended semantics. In this paper we give a solution to this problem. We find the logic LP of propositions and proofs and show that Godel's provability calculus is nothing but the forgetful projection of LP. This also achieves Godel's objective of defining intuitionistic propositional logic Int via classical proofs and provides a Brouwer-Heyting-Kolmogorov style provability semantics for Int which (...) |
|
|
This paper extends earlier work by its authors on formal aspects of the processes of contracting a theory to eliminate a proposition and revising a theory to introduce a proposition. In the course of the earlier work, Gardenfors developed general postulates of a more or less equational nature for such processes, whilst Alchourron and Makinson studied the particular case of contraction functions that are maximal, in the sense of yielding a maximal subset of the theory (or alternatively, of one of (...) |
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Most of us think we can always enlarge our knowledge base by accepting things that are entailed by (or logically implied by) things we know. The set of things we know is closed under entailment (or under deduction or logical implication), which means that we know that a given claim is true upon recognizing, and accepting thereby, that it follows from what we know. However, some theorists deny that knowledge is closed under entailment, and the issue remains controversial. The arguments (...) |
|
|
|
|
|
Let R(X, B) denote the class of probability functions that are defined on algebra X and that represent rationally permissible degrees of certainty for a person whose total relevant background evidence is B. This paper is concerned with characterizing R(X, B) for the case in whichX is an algebra of propositions involving two properties and B is empty. It proposes necessary conditions for a probability function to be in R(X, B), some of which involve the notion of statistical dependence. The (...) |
|
|
|
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-6b65f85844-t9k8j uwo