Online research in philosophy

According to the “knowability thesis,” every truth is knowable. Fitch’s paradox refutes the knowability thesis by showing that if we are not omniscient, then not only are some truths not known, but there are some truths that are not knowable. In this paper, I propose a weakening of the knowability thesis (which I call the “conjunctive knowability thesis”) to the e:ect that for every truth p there is a collection of truths such that (i) each of them is knowable and (ii) their conjunction is equivalent to p. I show that the conjunctive knowability thesis avoids triviality arguments against it, and that it fares very di:erently depending on another thesis connecting knowledge and possibility. If there are two propositions, inconsistent with one another, but both knowable, then the conjunctive knowability thesis is trivially true. On the other hand, if knowability entails truth, the conjunctive knowability thesis is coherent, but only if the logic of possibility is weak.

This paper is closely related to investigations of abstract properties of basic logical notions expressible in terms of closure spaces as they were begun by A. Tarski (see [6]). We shall prove many properties of -conjunctive closure spaces (X is -conjunctive provided that for every two elements of X their conjunction in X exists). For example we prove the following theorems:1. For every closed and proper subset of an -conjunctive closure space its interior is empty (i.e. it is a boundary set). 2. If X is an -conjunctive closure space which satisfies the -compactness theorem and [X] is a meet-distributive semilattice (see [3]), then the lattice of all closed subsets in X is a Heyting lattice. 3. A closure space is linear iff it is an -conjunctive and topological space. 4. Every continuous function preserves all conjunctions.

A bounded formula is a pair consisting of a propositional formula φ in the first coordinate and a real number within the unit interval in the second coordinate, interpreted to express the lower-bound probability of φ. Converting conjunctive/disjunctive combinations of bounded formulas to a single bounded formula consisting of the conjunction/disjunction of the propositions occurring in the collection along with a newly calculated lower probability is called absorption. This paper introduces two inference rules for effecting conjunctive and disjunctive absorption and compares the resulting logical system, called System Y, to axiom System P. Finally, we demonstrate how absorption resolves the lottery paradox and the paradox of the preference.

We present a solution to the paradox of free choice permission by introducing strong and weak permission in a deontic logic of action. It is shown how counterintuitive consequences of strong permission can be avoided by limiting the contexts in which an action can be performed. This is done by introducing the only operator, which allows us to say that only is performed (and nothing else), and by introducing contextual interpretation of action terms.

In this paper, a pragmatic approach to the phenomenon of free choice permission is proposed. Free choice permission is explained as due to taking the speaker (i) to obey certain Gricean maxims of conversation and (ii) to be competent on the deontic options, i.e. to know the valid obligations and permissions. The approach differs from other pragmatic approaches to free choice permission in giving a formally precise description of the class of inferences that can be derived based on these two assumptions. This formalization builds on work of Halpern and Moses (1984) on the concept of ‘only knowing’, generalized by Hoek et al., (1999, 2000), and Zimmermann’s (2000) approach to competence.

Free choice permission, a crucial test case concerning the semantics/ pragmatics boundary, usually receives a pragmatic treatment. But its pragmatic features follow from its semantics. We observe that free choice inferences are defeasible, and defend a semantics of free choice permission as strong permission expressed in terms of a modal conditional in a nonmonotonic logic.

This paper will be concerned with the conjunctive interpretation of a family of disjunctive constructions. The relevant conjunctive interpretation, sometimes referred to as a “free choice effect,” (FC) is attested when a disjunctive sentence is embedded under an existential modal operator. I will provide evidence that the relevant generalization extends (with some caveats) to all constructions in which a disjunctive sentence appears under the scope of an existential quantifier, as well as to seemingly unrelated constructions in which conjunction appears under the scope of negation and a universal quantifier.

This is a comprehensive study of the English word 'or', and the logical operators variously proposed to present its meaning. Although there are indisputably disjunctive uses of or in English, it is a mistake to suppose that logical disjunction represents its core meaning. 'Or' is descended from the Anglo-Saxon word meaning second, a form which survives in such expressions as "every other day." Its disjunctive uses arise through metalinguistic applications of an intermediate adverbial meaning which is conjunctive rather than disjunctive in character. These conjunctive uses have puzzled philosophers and logicians, and have been discussed extensively under such headings as "free choice permission." This study examines the textbook myths that have clouded our understanding of how or and other "logical" vocabulary comes to have something approaching its logical meaning in natural languages. It considers the various historical conceptions of disjunction and its place in logic from the Stoics to the present day.