Results 151 to 160 of about 1,467,572 (201)
Some of the next articles are maybe not open access.
1991
In part I. of this essay we attempt to articulate Husserl’s phenomenological descriptions for the genesis of the primitive logical connectives, negation and disjunction. In part II. we describe possible worlds models for the use of disjunction and negation in epistemic contexts and contexts relating to the analysis of meanings. Finally, in part III, we
Charles Harvey, Jaakko Hintikka
openaire +1 more source
In part I. of this essay we attempt to articulate Husserl’s phenomenological descriptions for the genesis of the primitive logical connectives, negation and disjunction. In part II. we describe possible worlds models for the use of disjunction and negation in epistemic contexts and contexts relating to the analysis of meanings. Finally, in part III, we
Charles Harvey, Jaakko Hintikka
openaire +1 more source
Modality, Si! Modal Logic, No!
Studia Logica, 1997In this brief note, the author recalls some examples of statements that use modal notions but which, it would seem, cannot be represented adequately by the usual modal logics. The notions involved are those of believing, knowing, intending, desiring, and being under an obligation; the examples are gathered mainly from earlier publications of the author,
openaire +1 more source
Fundamenta Informaticae, 2017
In 1951 in his book An Essay in Modal Logic, Georg Henrik von Wright strongly called attention to the analogies between quantifiers and modal operators. In 1984 I published a paper in Synthese examining the analogy formally. Confession: the presentation in that paper was badly done, and there is a significant (though correctable) error.
openaire +1 more source
In 1951 in his book An Essay in Modal Logic, Georg Henrik von Wright strongly called attention to the analogies between quantifiers and modal operators. In 1984 I published a paper in Synthese examining the analogy formally. Confession: the presentation in that paper was badly done, and there is a significant (though correctable) error.
openaire +1 more source
Synthese, 2008
Kripke claims that there are necessary a posteriori truths and contingent a priori truths. These claims challenge the traditional Kantian view that (K) All knowledge of necessary truths is a priori and all a priori knowledge is of necessary truths.
openaire +1 more source
Kripke claims that there are necessary a posteriori truths and contingent a priori truths. These claims challenge the traditional Kantian view that (K) All knowledge of necessary truths is a priori and all a priori knowledge is of necessary truths.
openaire +1 more source
Studia Logica, 2012
The author develops a modal logic with the modalities ``always necessary'' and ``sometimes necessary'', and dual modalities for possibility. He gives a Hilbert-style axiomatization, and an adequate semantics via Kripke frames with arbitrary families of accessibility relations. This logic has the finite model property and is, hence, decidable.
openaire +2 more sources
The author develops a modal logic with the modalities ``always necessary'' and ``sometimes necessary'', and dual modalities for possibility. He gives a Hilbert-style axiomatization, and an adequate semantics via Kripke frames with arbitrary families of accessibility relations. This logic has the finite model property and is, hence, decidable.
openaire +2 more sources
Modal Scepticism, Unqualified Modality, and Modal Kinds
Philosophia, 2011I formulate and defend two sceptical theses on specific parts of our modal knowledge (unqualified and absolute modalities). My main point is that unqualified modal sentences are defective in that they fail to belong unambiguously to specific modal kinds and thus cannot be evaluated; hence, we must be sceptical of beliefs involving them.
openaire +1 more source
International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems, 1996
We add a binary operator ≥ to the logical language, with intended meaning of φ<ψ: ‘φ is at least as likely, probable, or trustworthy, as ψ’. The operator ≥ is interpreted on Kripke structures, making it possible to define the standard necessity operator □ in terms of ≥.
openaire +2 more sources
We add a binary operator ≥ to the logical language, with intended meaning of φ<ψ: ‘φ is at least as likely, probable, or trustworthy, as ψ’. The operator ≥ is interpreted on Kripke structures, making it possible to define the standard necessity operator □ in terms of ≥.
openaire +2 more sources
Modals as Predicates of Modal Objects
2016This talk will outline a novel semantics of modals based not on possible worlds and quantifiers ranging over them, but on what I will call ‘modal objects’, entities of the sort of permissions, obligations, needs, abilities, and essences. According to that semantics, modal predicates take modal objects as their implicit (Davidsonian)
openaire +1 more source
Synthese, 2003
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Journal of Symbolic Logic, 1946
The purpose of this article is to give a survey of some results I have found in investigations concerning logical modalities. The results refer: (1) to semantical systems, i.e., symbolic language systems for which semantical rules of interpretation are laid down; (2) to corresponding calculi, i.e., syntactical systems with primitive sentences and a ...
openaire +2 more sources
The purpose of this article is to give a survey of some results I have found in investigations concerning logical modalities. The results refer: (1) to semantical systems, i.e., symbolic language systems for which semantical rules of interpretation are laid down; (2) to corresponding calculi, i.e., syntactical systems with primitive sentences and a ...
openaire +2 more sources