- 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:
Inverse Images of Box Formulas in Modal Logic
Studia Logica 101 (5):1031-1060 (2013)
Add references
You must login to add references.
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
We study a range of issues connected with the idea of replacing one formula by another in a fixed context. The replacement core of a consequence relation ⊢ is the relation holding between a set of formulas {A1,..., Am,...} and a formula B when for every context C, we have C,..., C,... ⊢ C. Section 1 looks at some differences between which inferences are lost on passing to the replacement cores of the classical and intuitionistic consequence relations. For example, we (...) |
|
|
|
|
|
Sorensen here offers a unified solution to a large family of philosophical puzzles and paradoxes through a study of "blindspots": consistent propositions that cannot be rationally accepted by certain individuals even though they might by true. |
|
|
This collection assembles Church's referee reports, Fitch's 1963 paper, and nineteen new papers on the knowability paradox. |
|
|
Knowledge and its Limits presents a systematic new conception of knowledge as a kind of mental stage sensitive to the knower's environment. It makes a major contribution to the debate between externalist and internalist philosophies of mind, and breaks radically with the epistemological tradition of analyzing knowledge in terms of true belief. The theory casts new light on such philosophical problems as scepticism, evidence, probability and assertion, realism and anti-realism, and the limits of what can be known. The arguments are (...) |
|
|
|
|
|
It will be an essential resource for philosophers, mathematicians, computer scientists, linguists, or any scholar who finds connectives, and the conceptual issues surrounding them, to be a source of interest.This landmark work offers both ... |
|
|
|
|
|
The appropriateness of S5 as a logic of knowledge has been attacked at some length in the philosophical literature. Here one particular attack based on the interplay between knowledge and belief is considered: Suppose that knowledge satisfies S5, belief satisfies KD45, and both the entailment property (knowledge implies belief) and positive certainty (if the agent believes something, she believes she knows it) hold. Then it can be shown that belief reduces to knowledge: it is impossible to have false beliefs. While (...) |
|
|
|
|
|
|
|
|
|
|
|
A well-known open problem in epistemic logic is to give a syntactic characterization of the successful formulas. Semantically, a formula is successful if and only if for any pointed model where it is true, it remains true after deleting all points where the formula was false. The classic example of a formula that is not successful in this sense is the “Moore sentence” p ∧ ¬BOXp, read as “p is true but you do not know p.” Not only is the (...) |
|
|
An account of desire as a species of belief may owe its appeal to the details of its proposal as to precisely what sort of beliefs desires are to be identified with, and its downfall may be due to those details it does provide. For example, it may be proposed that the desire that α is in fact the belief that it ought to be that α, or is morally good or desirable that it should be the case that α. (...) |
|
|
The aim of this paper is to investigate the expressibility of classical propositional monomodal logics. To this end, a notion of embedding of one logic into another is introduced, which is a translation preserving theoremhood. Each translation trF is induced by a formula F of one variable p; it respects boolean connectives and translates a formula of a form □A into F). This notion enables to measure the expressibility of a logic by a number of logics embeddable into it. This (...) |
|
|
|
|
|
Given a 1-ary sentence operator , we describe L - another 1-ary operator - as as a left inverse of in a given logic if in that logic every formula is provably equivalent to L. Similarly R is a right inverse of if is always provably equivalent to R. We investigate the behaviour of left and right inverses for taken as the operator of various normal modal logics, paying particular attention to the conditions under which these logics are conservatively extended (...) |
|
|
Global supervenience of beliefs about physical states of affairs on such states has strongly counter-intuitive consequences about what beliefs we can nomologically hold. This is an argument against a global supervenience of all mental properties on physical ones, and, since that is implied by strong supervenience, also against that as the preferred materialist thesis. |
|
|
We construct a normal extension of K4 with the finite model property whose minimal tense extension is not complete with respect to Kripke semantics. |
|
|
J. R. Lucas; IV*—Mathematical Tennis, Proceedings of the Aristotelian Society, Volume 85, Issue 1, 1 June 1985, Pages 63–72, https://doi.org/10.1093/aristotelia. |
|
|
|
|
|
|
|
|
J. R. Lucas; IV*—Mathematical Tennis, Proceedings of the Aristotelian Society, Volume 85, Issue 1, 1 June 1985, Pages 63–72, https://doi.org/10.1093/aristotelia. |
|
|
The formula A (it is noncontingent whether A) is true at a point in a Kripke model just in case all points accessible to that point agree on the truth-value of A. We can think of -based modal logic as a special case of what we call the general modal logic of agreement, interpreted with the aid of models supporting a ternary relation, S, say, with OA (which we write instead of A to emphasize the generalization involved) true at a (...) |
|
|
We give in this paper a sufficient condition, cast in semantic terms, for Hallden-completeness in normal modal logics, a modal logic being said to be Hallden-complete (or Ήallden-reasonable') just in case for any disjunctive formula provable in the logic, where the disjuncts have no propositional variables in common, one or other of those disjuncts is provable in the logic. |
|
|
A sentence mentioning an object can be regarded as saying any one of several things about that object, without thereby being ambiguous. Some of the (logical) repercussions of this commonplace observation are recorded, and some critical discussion is provided of views which would appear to go against it. |
|
|
|
|
|
Sections 1 and 2 respectively raise and settle the question of whether, if an affirmative modality collapses (reduces to the null modality, that is) in a normal modal logic, then all modalities of the same length collapse in that logic, while Section 3 considers some special cases of an analogous phenomenon for congruential modal logics, closing with a general question about collapsing modalities in this broader range of logics. |
|
|
A sentence mentioning an object can be regarded as saying any one of several things about that object, without there by being ambiguous. Some of the repercussions of this commonplace observation are recorded, and some critical discussion is provided of views which would appear to go against it. |
|
|
|
|
|
In a paper on the logical work of the Jains, Graham Priest considers a consequence relation, semantically characterized, which has a natural analogue in modal logic. Here we give a syntactic/axiomatic description of the modal formulas which are consequences of the empty set by this relation, which is to say: those formulas which are, for every model, true at some point in that model. |
|
|
|
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-7674574dd6-8q2d6 uwo