This paper is on the update semantics for might of Veltman. Threeconsequence relations are introduced and studied in an abstract setting.Next we present sequent-style systems for each of the consequence relations.We show the logics to be complete and decidable. The paper ends with asyntactic cut elimination result.

This paper is on the update semantics for might of Veltman. Threeconsequence relations are introduced and studied in an abstract setting.Next we present sequent-style systems for each of the consequence relations.We show the logics to be complete and decidable. The paper ends with asyntactic cut elimination result.

This essay attempts to develop a psychologically informed semantics of perception reports, whose predictions match with the linguistic data. As suggested by the quotation from Miller and Johnson-Laird, we take a hallmark of perception to be its fallible nature; the resulting semantics thus necessarily differs from situation semantics. On the psychological side, our main inspiration is Marr's (1982) theory of vision, which can easily accomodate fallible perception. In Marr's theory, vision is a multi-layered process. The different layers have filters of (...) different gradation, which makes vision at each of them approximate. On the logical side, our task is therefore twofold - to formalise the layers and the ways in which they may refine each other, and. (shrink)

The article argues for a contextualised reading of Wittgenstein’s Tractatus. It analyses in detail the role that use and application play in the text and how that supports a conception of transcendentality of logic that allows for contextualisation. The article identifies a tension in the text, between the requirement that sense be determinate and the contextual nature of application, and suggests that it is this tension that is a major driver of Wittgenstein’s later ideas.

This note is on cautious cut elimination for one of Veitman's might logics. Syntactically, the logic is presented as an extension of a sequent system for classical proposition logic . I show that this extension preserves the completeness and decidability of CPL. The proof has cautious cut elimination as a corollary. I also give a rather general syntactic proof of cautious cut elimination. It states that any ‘base’ logic which has a reflexive, monotone consequence relation that allows cautious cut to (...) be eliminated preserves cautious cut elimination when extended to a might logic. (shrink)