排序方式: 共有26条查询结果,搜索用时 15 毫秒
11.
There is an important class of conditionals whose assertibility conditions are not given by the Ramsey test but by an inductive extension of that test. Such inductive Ramsey conditionals fail to satisfy some of the core properties of plain conditionals. Associated principles of nonmonotonic inference should not be assumed to hold generally if interpretations in terms of induction or appeals to total evidence are not to be ruled out. 相似文献
12.
André Fuhrmann 《Studia Logica》1990,49(4):501-514
Semantics are given for modal extensions of relevant logics based on the kind of frames introduced in [7]. By means of a simple recipe we may obtain from a class FRM (L) of unreduced frames characterising a (non-modal) logic L, frame-classes FRM
(L.M) characterising conjunctively regular modal extensions L.M of L. By displaying an incompleteness phenomenon, it is shown how the recipe fails when reduced frames are under consideration. 相似文献
13.
The paper presents the main ideas of Ultrafilter Logic (UL), as introduced by Veloso and others. A new proposal, Normality
Logic (NL), is outlined for expanding the expressive power of UL. The system NL appears to offer a simpler solution to the
problem of expressive power than the sorting strategy of Carnielli and Veloso. Interpretations of NL are discussed and an
important point of contact to Hansson's notion of non-prioritized belief revision is observed.
This revised version was published online in August 2006 with corrections to the Cover Date. 相似文献
14.
The sentential logic S extends classical logic by an implication-like connective. The logic was first presented by Chellas as the smallest system modelled by contraining the Stalnaker-Lewis semantics for counterfactual conditionals such that the conditional is effectively evaluated as in the ternary relations semantics for relevant logics. The resulting logic occupies a key position among modal and substructural logics. We prove completeness results and study conditions for proceeding from one family of logics to another.We are grateful to Peter Apostoli, Kosta Doen, and anonymous referees for their comments on an earlier version of this paper. A.F.'s work has been supported by a grant from the Volkswagen-Stiftung.Presented byJan Zygmunt 相似文献
15.
André Fuhrmann 《Synthese》2014,191(7):1627-1648
The thesis that every truth is knowable is usually glossed by decomposing knowability into possibility and knowledge. Under elementary assumptions about possibility and knowledge, considered as modal operators, the thesis collapses the distinction between truth and knowledge (as shown by the so-called Fitch-argument). We show that there is a more plausible interpretation of knowability—one that does not decompose the notion in the usual way—to which the Fitch-argument does not apply. We call this the potential knowledge-interpretation of knowability. We compare our interpretation with the rephrasal of knowability proposed by Edgington and Rabinowicz and Segerberg, inserting an actuality-operator. This proposal shares some key features with ours but suffers from requiring specific transworld-knowledge. We observe that potential knowledge involves no transworld-knowledge. We describe the logic of potential knowledge by providing models for interpreting the new operator. Finally we show that the knowability thesis can be added to elementary conditions on potential knowledge without collapsing modal distinctions. 相似文献
16.
17.
18.
In this paper we set out a semantics for relevant (counterfactual) conditionals. We combine the Routley-Meyer semantics for relevant logic with a semantics for conditionals based on selection functions. The resulting models characterize a family of conditional logics free from fallacies of relevance, in particular counternecessities and conditionals with necessary consequents receive a non-trivial treatment. 相似文献
19.
20.