We present an inferentialist account of the epistemic modal operator might. Our starting point is the bilateralist programme. A bilateralist explains the operator not in terms of the speech act of rejection; we explain the operator might in terms of weak assertion, a speech act whose existence we argue for on the basis of linguistic evidence. We show that our account of might provides a solution to certain well-known puzzles about the semantics of modal vocabulary whilst retaining classical logic. This demonstrates that an inferentialist approach to meaning can be successfully extended beyond the core logical constants.

Linguistic evidence supports the claim that certain, weak rejections are less specific than assertions. On the basis of this evidence, it has been argued that rejected sentences cannot be premisses and conclusions in inferences. We give examples of inferences with weakly rejected sentences as premisses and conclusions. We then propose a logic of weak rejection which accounts for the relevant phenomena and is motivated by principles of coherence in dialogue. We give a semantics for which this logic is sound and complete, show that it axiomatizes the modal logic KD45 and prove that it still derives classical logic on its asserted fragment. Finally, we defend previous logics of strong rejection as being about the linguistically preferred interpretations of weak rejections.

The knowledge norm of assertion is the subject of a lively debate on when someone is in a position to assert something. However, not much has been said about the logic that underlies such debate. In this paper, I propose a formalisation of the knowledge norm in a deontic logic that aims to be explanatory and conceptually sound. Afterwards, I investigate some problems that this formalisation makes visible. This reveals some significant limitations of the underlying logic: it can neither contain Axiom 4 (transitivity) nor Axiom C4 (density). Moreover, sentences of the form p and I have not asserted that p appear to licence a violation of deontic rules.

Anti-realism is plagued by Fitch's paradox: the remarkable result that if one accepts that all truths are knowable, minimal assumptions about the nature of knowledge entail that every truth is known. Dorothy Edgington suggests to address this problem by understanding p is knowable to be a counterfactual claim, but her proposal must contend with a forceful objection by Timothy Williamson. I revisit Edgington's basic idea and find that Williamson's objection is obviated by a refined understanding of counterfactual knowability that is grounded in possible courses of inquiry. I arrive at a precise definition of knowability that is not just a technical avoidance of paradox, but is metaphysically sound and does justice to the anti-realist idea.

Summary This article is the second in a series of two Mizar articles constituting a formal proof of the Gödel Completeness theorem [15] for uncountably large languages. We follow the proof given in [16]. The present article contains the techniques required to expand a theory such that the expanded theory contains witnesses and is negation faithful. Then the completeness theorem follows immediately.