Our article aims to show, on the one hand, the preeminence of the interactive paradigm as a determining element in the process of constitution of logical meaning and, on the other hand, to examine the contents of the linguistic expressions of pragmatic semantics. To do this, we expose three major figures of the logic of mathematical obedience in particular those of Gottfreid Leibniz, George Boole and Gottlob Frege. If this approach to mathematical logic has seen meritorious progress, it should be (...) pointed out that it does not favor the emphasis on epistemic and interactive aspects in the notions of logical consequences and inference. Our contribution is therefore to demonstrate that these weaknesses can be solved with the revolutionary approach of Robert Brandom based on the framework that promotes the interactive game of supply and demand of reasons. This analysis leads to the idea that interactive play is the basis of contemporary logical approaches. (shrink)

The many-property problem has traditionally been taken to show that the adverbial theory of perception is untenable. This paper first shows that several widely accepted views concerning the nature of perception---including both representational and non-representational views---likewise face the many-property problem. It then presents a solution to the many-property problem for these views, but goes on to show how this solution can be adapted to provide a novel, fully compositional solution to the many-property problem for adverbialism. Thus, with respect to the (...) many-property problem, adverbialism and several widely accepted views in the philosophy of perception are on a par, and the problem is solved. (shrink)

The goal of this paper is to explore the presuppositionality of factive verbs, with special emphasis on the verbs know and regret. The hypothesis put forward here is that the factivity related to know and the factivity related to regret are two different phenomena, as the former is a semantic implication that is licensed by the conventional meaning of know, while the latter is a purely pragmatic phenomenon that arises conversationally. More specifically, it is argued that know is factive in (...) the sense that it both entails and presupposes p, while regret is factive in the sense that it only presupposes p. In a recent article, Hazlett, 497–522, 2010) shows with authentic examples how know is used non-factively in ordinary language, and he observes in these examples, as he says, “a threat to Factivity.” I argue that non-factive uses of factive verbs, such as know and regret, far from being a threat to factivity, show that, on the one hand, know is ambiguous between a factive and a non-factive sense; on the other hand, in the case of regret, the presupposition of factivity has to be intended as a merely pragmatic implication which can be suspended by the speaker herself. (shrink)

Situational aspects of action are discussed. The presented approach emphasizes the role of situational contexts in which actions are performed. These contexts influence the course of an action; they are determined not only by the current state of the system but also shaped by other factors as time, the previously undertaken actions and their succession, the agents of actions and so on. The distinction between states and situations is explored from the perspective of action systems. The notion of a situational (...) action system is introduced and its theory is expounded. Numerous examples illustrate the reach of the theory. (shrink)

In this article we develop a logical model for automatic extraction of structured metadata. We introduce a new predicate???? – reads ‘extract’ – and a structure???? to syntactically and semantically define metadata extracted with any automatic metadata extraction system. These systems will be considered, in the logical model created, as knowledge extraction agents. In this case KEA taken into consideration is CERMINE, a comprehensive open-source system for extracting structured metadata from scientific articles in a born-digital form.

The distribution of the focus particle even is constrained: if it is adjoined at surface structure to an expression that is entailed by its focus alternatives, as in even once, it must be appropriately embedded to be acceptable. This paper focuses on the context-dependent distribution of such occurrences of even in the scope of non-monotone quantifiers. We show that it is explained on the assumption that even can move at LF Syntax and semantics, 1979). The analysis is subsequently extended to (...) occurrences of negative polarity items in these environments, which mirror the abovementioned distribution of even and which invalidate standard characterizations of NPI licensing conditions in terms of downward-entailingness. The idea behind the extension is that NPIs denote weak elements that are associates of covert even. The paper concludes by discussing two comprehensive theories of NPI licensing and how our proposal relates to them. (shrink)

Epistemic transparency tells us that, if an agent S knows a given proposition p , then S knows that she knows that p . This idea is usually encoded in the so-called KK principle of epistemic logic. The paper develops an argument in favor of a moderate version of KK , which I dub quasi-transparency , as a normative rather than a descriptive principle. In the second Section I put forward the suggestion that epistemic transparency is not a demand of (...) ideal rationality, but of ideal epistemic responsibility, and hence that ideally responsible agents verify transparency principles of some sort; I also contend that their satisfaction should not be tied to an internalist epistemology. The central argument in favor of transparency is then addressed in Sections 3 to 8, through the development of a formal system. I show that, in a well-behaved formal setting, a moderate version of transparency is imposed upon us as a result of a number of independent decisions on the structure of higher-order probabilities, as long as we request that our probability and knowledge attributions cohere with each other. Thus I give a rationale to build a model for a hierarchy of languages with different levels of knowledge and probability operators; we obtain an analogous to KK for successive knowledge operators without actually demanding transitivity. The formal argument reinforces the philosophical intuition that epistemic transparency is an important desideratum we should not be too ready to dismiss. (shrink)

In “Epistemic Modals,” Seth Yalcin argues that what explains the deficiency of sentences containing epistemic modals of the form ‘p and it might be that not-p’ is that sentences of this sort are strictly contradictory, and thus are not instances of a Moore-paradox as has been previous suggested. Benjamin Schnieder, however, argues in his Yalcin’s explanation of these sentences’ deficiency turns out to be insufficiently general, as it cannot account for less complex but still defective sentences, such as ‘Suppose it (...) might be raining.’ Consequently, Schnieder proposes his own, expressivist treatment of epistemic modals which he thinks can explain the deficiency of both the original sentence type as well as more complex cases of embedded sentences containing epistemic modals. In this study, I argue that although Schnieder is right to draw our attention to the explanatory failure of Yalcin’s account, we aren’t forced to adopt Schnieder’s expressivist account of epistemic modals. I defend instead a contextualist-friendly alternative which explains the deficiencies of all the relevant sentence types, while avoiding both the defects of Yalcin’s account and the intuitive costs of expressivism. (shrink)

The article focuses on representing different forms of non-adjunctive inference as sub-Kripkean systems of classical modal logic, where the inference from □A and □B to □A ∧ B fails. In particular we prove a completeness result showing that the modal system that Schotch and Jennings derive from a form of non-adjunctive inference in (Schotch and Jennings, 1980) is a classical system strictly stronger than EMN and weaker than K (following the notation for classical modalities presented in Chellas, 1980). The unified (...) semantical characterization in terms of neighborhoods permits comparisons between different forms of non-adjunctive inference. For example, we show that the non-adjunctive logic proposed in (Schotch and Jennings, 1980) is not adequate in general for representing the logic of high probability operators. An alternative interpretation of the forcing relation of Schotch and Jennings is derived from the proposed unified semantics and utilized in order to propose a more fine-grained measure of epistemic coherence than the one presented in (Schotch and Jennings, 1980). Finally we propose a syntactic translation of the purely implicative part of Jaśkowski's system D₂ into a classical system preserving all the theorems (and non-theorems) explicilty mentioned in (Jaśkowski, 1969). The translation method can be used in order to develop epistemic semantics for a larger class of non-adjunctive (discursive) logics than the ones historically investigated by Jaśkowski. (shrink)

This work introduces a two-dimensional modal logic to represent agents' Concurrent Common Knowledge in distributed systems. Unlike Common Knowledge, Concurrent Common Knowledge is a kind of agreement reachable in asynchronous environments. The formalization of such type of knowledge is based on a model for asynchronous systems and on the definition of Concurrent Knowledge introduced before in paper [5]. As a proper semantics, we review our concept of closed sub-product of modal logics which is based on the product of modal logics. (...) The key idea is to reason about Concurrent Knowledge under a two-dimensional approach, regarding asynchronous runs and consistent global states as dimensions. We present an axiomatic system for the logic and issue the corresponding soundness and completeness proofs. (shrink)

The paper studies first order extensions of classical systems of modal logic (see (Chellas, 1980, part III)). We focus on the role of the Barcan formulas. It is shown that these formulas correspond to fundamental properties of neighborhood frames. The results have interesting applications in epistemic logic. In particular we suggest that the proposed models can be used in order to study monadic operators of probability (Kyburg, 1990) and likelihood (Halpern-Rabin, 1987).

I argue for a theory that combines elements of reliabilism and evidentialism.

This paper examines the paradox of revisability. This paradox was proposed by Jerrold Katz as a problem for Quinean naturalised epistemology. Katz employs diagonalisation to demonstrate what he takes to be an inconsistency in the constitutive principles of Quine's epistemology. Specifically, the problem seems to rest with the principle of universal revisability which states that no statement is immune to revision. In this paper it is argued that although there is something odd about employing universal revisability to revise itself, there (...) is nothing paradoxical about this. At least, there is no paradox along the lines suggested by Katz. (shrink)

If updating with E has the same result across all epistemically possible worlds, then the agent has no uncertainty as to the behavior of the update, and we may call it a transparent update. If an agent is uncertain about the behavior of an update, we may call it opaque. In order to model the uncertainty an agent has about the result of an update, the same update must behave differently across different possible worlds. In this paper, I study opaque (...) updates using a simple system of dynamic epistemic logic suitably modified for that purpose. The paper highlights the connection between opaque updates and the dynamic-epistemic principles Perfect-Recall and No-Miracles. I argue that opaque updates are central to contemporary discussions in epistemology, in particular to externalist theories of knowledge and to the related problem of epistemic bootstrapping, or easy knowledge. Opaque updates allow us to explicitly investigate a dynamic form of uncertainty, using simple and precise logical tools. (shrink)

This paper explores the truism that people think about what they say. It proposes that, to satisfy their own goals, people often plan their speech acts to affect their listeners' beliefs, goals, and emotional states. Such language use can be modelled by viewing speech acts as operators in a planning system, thus allowing both physical and speech acts to be integrated into plans. Methodological issues of how speech acts should be defined in a planbased theory are illustrated by defining operators (...) for requesting and informing. Plans containing those operators are presented and comparisons are drawn with Searle's formulation. The operators are shown to be inadequate since they cannot be composed to form questions (requests to inform) and multiparty requests (requests to request). By refining the operator definitions and by identifying some of the side effects of requesting, compositional adequacy is achieved.The solution leads to a metatheoretical principle for modelling speech acts as planning operators. (shrink)

This paper argues that questions have an important role to to play in logic, both semantically and proof-theoretically. Semantically, we show that by generalizing the classical notion of entailment to questions, we can capture not only the standard relation of logical consequence, which holds between pieces of information, but also the relation of logical dependency, which holds between information types. Proof-theoretically, we show that questions may be used in inferences as placeholders for arbitrary information of a given type; by manipulating (...) such placeholders, we may construct formal proofs of dependencies. Finally, we show that such proofs have a specific kind of constructive content: they do not just witness the existence of a certain dependency, but actually encode a method for transforming information of the types described by the assumptions into information of the type described by the conclusion. (shrink)

Traditional approaches to the semantics of questions analyze questions indirectly, via the notion of an answer. In recent work on inquisitive semantics, a different perspective is taken: the meaning of a question is equated with its resolution conditions, just like the meaning of a statement is traditionally equated with its truth-conditions. In this paper I argue that this proposal improves on previous approaches, combining the formal elegance and explanatory power of Groenendijk and Stokhof’s partition theory with the greater generality afforded (...) by answer-set theories. (shrink)

G.E. Moore noticed the oddity of statements like: “It's raining, but I don't believe it.” This oddity is often seen as analogous to the oddity of believing akratically, or believing what one believes one should not believe, and has been appealed to in denying the possibility of akratic belief. I describe a Belief Akratic's Paradox, analogous to Moore's paradox and centered on sentences such as: “I believe it's raining, but I shouldn't believe it.” I then defend the possibility of akratic (...) belief against appeals to this analogy, arguing both that akratic belief does not require belief-akratic-paradoxical belief, and that the latter is importantly different from Moorean belief. I conclude by considering the implications of these arguments for an understanding of both Moorean and akratic belief. (shrink)

The beliefs involved in the placebo effect are often assumed to be self-fulfilling, that is, the truth of these beliefs would merely require the patient to hold them. Such a view is commonly shared in epistemology. Many epistemologists focused, in fact, on the self-fulfilling nature of these beliefs, which have been investigated because they raise some important counterexamples to Nozick’s “tracking theory of knowledge.” We challenge the self-fulfilling nature of placebo-based beliefs in multi-agent contexts, analyzing their deep epistemological nature and (...) the role of higher-order beliefs involved in the placebo effect. (shrink)

This volume explores the relation between legal reasoning and logic from both a historical and a systematic perspective. The topics addressed include, among others, conditional legal acts, disjunctions in legal acts, presumptions and conjectures, conflicts of values, Jørgensen´s Dilemma, the Rhetor´s Dilemma, the theory of legal fictions and the categorization of contracts. The unifying problematic of these contributions concerns the conditional structures and, more particularly, the relationship between legal theory and legal reasoning in the context of conditions.

One diagnosis of Fitch’s paradox of knowability is that it hinges on the factivity of knowledge: that which is known is true. Yet the apparent role of factivity and non-factive analogues in related paradoxes of justified belief can be shown to depend on familiar consistency and positive introspection principles. Rejecting arguments that the paradox hangs on an implausible consistency principle, this paper argues instead that the Fitch phenomenon is generated both in epistemic logic and logics of justification by the interaction (...) of analogues of the knowability principle and positive introspection theses that are characteristic of, even if not entailed by, epistemic internalism. (shrink)

Suppose you’re imagining that it’s raining hard. You then proceed to imagine, as part of the same imaginative project, that you believe that it isn’t raining. Such an imaginative project is possible if the two imaginings arise in succession. But what about simultaneously imagining that it’s raining and that you believe that it isn’t raining? I will argue that, under certain conditions, such an imagining is impossible. After discussing these conditions, I will suggest an explanation of this impossibility. Elaborating on (...) the view outlined in Walton (1990), I will argue that the impossibility follows from the fact that imaginings ‘mimic’ beliefs in aiming at the fictionally true, just as beliefs aim at the true. (shrink)

Since Peirce defined the first operators for three-valued logic, it is usually assumed that he rejected the principle of bivalence. However, I argue that, because bivalence is a principle, the strategy used by Peirce to defend logical principles can be used to defend bivalence. Construing logic as the study of substitutions of equivalent representations, Peirce showed that some patterns of substitution get realized in the very act of questioning them. While I recognize that we can devise non-classical notations, I argue (...) that, when we make claims about those notations, we inevitably get saddled with bivalent commitments. I present several simple inferences to show this. The argument that results from those examples is ‘pragmatic’, because the inevitability of the principle is revealed in use (not mention); and it is ‘semiotic’, because this revelation happens in the use of signs. (shrink)

Many philosophers have noted that normative error theorists appear to be committed to saying ‘Error theory is true, but I have no reason to believe it’, which seems paradoxical. In defence of error...

We have now provided an overall simple theoretical account of the structure of perceptual experience proto-philosophically examined in Part I. The next task is to find the proper logical machinery to formulatte those accounts rigorously.

The pragmatic logic of assertions shows a connection between ignorance and decidability. In it, we can express pragmatic factual ignorance and first-order ignorance as well as some of their variants. We also show how some pragmatic versions of second-order ignorance and of Rumsfeld-ignorance may be formulated. A specific variant of second-order ignorance is particularly relevant. This indicates a strong pragmatic version of ignorance of ignorance, irreducible to any previous form of ignorance, which defines limits to what can justifiably be asserted (...) about higher-order ignorance. Finally, we relate the justified assertion of second-order ignorance with scientific assertions. (shrink)

In a series of works Sosa (in: Knowledge in perspective, Cambridge University Press, Cambridge, 1991; A virtue epistemology: apt belief and reflective knowledge, Oxford University Press, Oxford, 2007; Reflective knowledge: apt belief and reflective knowledge, Oxford University Press, Oxford, 2009; ‘How Competence Matters in Epistemology’, Philos Perspect 24(1):465–475, 2010; Knowing full well, Princeton University Press, Princeton, 2011; Judgment and agency, Oxford University Press, Oxford, 2015; Epistemology, Princeton University Press, Princeton, 2017) has defended the view that there are two kinds or (...) ‘grades’ of knowledge, animal and reflective. One of the most persistent critics of Sosa’s attempts to bifurcate knowledge is Kornblith (in: Greco (ed) Ernest sosa and his critics, Wiley, Hoboken, 2004; ‘Sosa in Perspective’, Philos Stud 144(1):127–136, 2009; On reflection, Oxford University Press, Oxford, 2012). Our aim in this paper is to outline and evaluate Kornblith’s criticisms. We will argue that, while they raise a range of difficult (exegetical and substantive) questions about Sosa’s ‘bi-level’ epistemology, Sosa has the resources to adequately respond to all of them. Thus, this paper is a (qualified) defence of Sosa’s bi-level epistemology. (shrink)

This paper contains a formal treatment of the system of quantified epistemic logic sketched in Appendix II of Carlson (1983). Section 1 defines the syntax and recapitulates the model set rules and principles of the Appendix system. Section 2 defines a possible worlds semantics for this system, and shows that the Appendix system is complete with respect to this semantics. Section 3 extends the system by an explicit truth operatorT it is true that and considers quantification over nonexistent individuals. Section (...) 4 formalizes the idea of variable identity criteria typical of Hintikkian epistemic logic. (shrink)

The purpose of this paper is to work toward an explicit logic and semantics for a game theoretically inspired theory of action. The purpose of the logic is to explicate the conceptual machinery implicit in the dialogue-game model of rational discourse developed in Carlson (1983).A variety of ideas and techniques of modal and philosophical logic are used to define a model structure that generalizes the game theoretical notion of a game in extensive form (von Neumann and Morgenstern, 1944). Relative to (...) this model structure, semantic characterizations are given to the action-theoretic notions oftime, possibility, belief, preference, ability, intention, action, andrationality. The unification of these characterizations under the game-theoretical paradigm leads to insights about the logical interdependences between these concepts. (shrink)

It has been recently suggested that a semantic theory for deontic modals should be neutral between a very large range of normative and evaluative theories. This article aims to clarify this talk of neutrality, in particular its scope and motivation. My thesis is that neutrality is best understood as an empirical thesis about a fragment of natural language that includes deontic modals – not as a new, sui generis methodological constraint on natural language semantics.

We study imagination as reality-oriented mental simulation : the activity of simulating nonactual scenarios in one’s mind, to investigate what would happen if they were realized. Three connected questions concerning ROMS are: What is the logic, if there is one, of such an activity? How can we gain new knowledge via it? What is voluntary in it and what is not? We address them by building a list of core features of imagination as ROMS, drawing on research in cognitive psychology (...) and the philosophy of mind. We then provide a logic of imagination as ROMS which models such features, combining techniques from epistemic logic, action logic, and subject matter semantics. Our logic comprises a modal propositional language with non-monotonic imagination operators, a formal semantics, and an axiomatization. (shrink)

In Quantifiers and Propositional Attitudes, Quine held (a) that the rule of exportation is always admissible, and (b) that there is a significant distinction between a believes-true (Ex)Fx and (Ex) a believes-true F of x. An argument of Hintikka's, also urged by Sleigh, persuaded him that these two intuitions are incompatible; and he consequently repudiated the rule of exportation. Hintikka and Kaplan propose to restrict exportation and quantifying in to favoured contexts — Hintikka to contexts where the believer knows who (...) or what the person or thing in question is; Kaplan to contexts where the believer possesses a vivid name of the person or thing in question. The bulk of this paper is taken up with criticisms of these proposals. Its ultimate purpose, however, is to motivate an alternative approach, which imposes no restrictions on exportation or quantifying in, but repudiates Quine's other intuition: this is the approach taken in my A Logical Form for the Propositional Attitudes. (shrink)

The author puts forth an approach to propositional attitude contexts based upon the view that one does not have beliefs of ordinary extensional entitiessimpliciter. Rather, one has beliefs of such entities as presented in various manners. Roughly, these are treated as beliefs of ordered pairs — the first member of which is the ordinary extensional entity and the second member of which is a predicate that it satisfies. Such an approach has no difficulties with problems involving identity, such as of (...) The Morning Star and The Evening Star (section 1). Given the second members of the pairs, the modes of presentation, it is quite natural to allow exportation everywhere. There is no need for essentialism. (One also can have non-essentialistic modal logic if one grants analyticity or the like.) (section 2). Given that the second member of the pair need only be one that is satisfied by the entity that is the first member (and need not be specificative), the method has no difficulties when one is concerned only with discriminations (and not specifications) (section 3). When this method is combined with the Frege-Carnap method of descriptions, fictional entities can be accommodated; Goodman''s unicorn-picture and the like can be brought within a Tarskian semantics; and Geach''s difficulties with intentional identity appear to be handled (section 4). Given the author''s ordered pair construals, there appears to be no additional need for notional construals; i.e., the author''s one unified method appears satisfactory for dealing with both traditionalde re (relational) andde dicto (notional) construals. The Paradox of the Knower and the like do not appear formulatable against the author''s approach. (section 5). The author also argues against the basic principles behind the Church-Langford translation argument (section 6). (shrink)

Dylan Dodd offers a simple, yet forceful, argument for infallibilism. The argument relies upon two assumptions concerning the relationship between knowledge, epistemic possibility, and epistemic probability. We argue below that by endorsing a particular conception of epistemic possibility, a fallibilist can both plausibly reject one of Dodd’s assumptions and mirror the infallibilist’s explanation of the linguistic data. In fact, such a fallibilist may even be able to offer a more comprehensive explanation than the infallibilist. Our discussion is of interest due (...) in part to the fact that many fallibilists have rejected the conception of epistemic possibility employed in our response to Dodd. (shrink)

We introduce quantificational modal operators as dynamic modalities with (extensions of) Henkin quantifiers as indices. The adoption of matrices of indices (with action identifiers, variables and/or quantified variables as entries) gives an expressive formalism which is here motivated with examples from the area of multi-agent systems. We study the formal properties of the resulting logic which, formally speaking, does not satisfy the normality condition. However, the logic admits a semantics in terms of (an extension of) Kripke structures. As a consequence, (...) standard techniques for normal modal logic become available. We apply these to prove completeness and decidability, and to extend some standard frame results to this logic. (shrink)

Saul Kripke argued that the requirement that knowledge eliminate all possibilities of error leads to dogmatism . According to this view, the dogmatism puzzle arises because of a requirement on knowledge that is too strong. The paper argues that dogmatism can be avoided even if we hold on to the strong requirement on knowledge. I show how the argument for dogmatism can be blocked and I argue that the only other approach to the puzzle in the literature is mistaken.

We present a framework for intensional reasoning in typed -calculus. In this family of calculi, called Modal Pure Type Systems (MPTSs), a propositions-as-types-interpretation can be given for normal modal logics. MPTSs are an extension of the Pure Type Systems (PTSs) of Barendregt (1992). We show that they retain the desirable meta-theoretical properties of PTSs, and briefly discuss applications in the area of knowledge representation.

The temporal updating of an agent’s beliefs in response to a flow of information is modeled in a simple modal logic that, for every date t, contains a normal belief operator B t and a non-normal information operator I t which is analogous to the ‘only knowing’ operator discussed in the computer science literature. Soundness and completeness of the logic are proved and the relationship between the proposed logic, the AGM theory of belief revision and the notion of plausibility is (...) discussed. (shrink)

We propose a modal logic based on three operators, representing intial beliefs, information and revised beliefs. Three simple axioms are used to provide a sound and complete axiomatization of the qualitative part of Bayes’ rule. Some theorems of this logic are derived concerning the interaction between current beliefs and future beliefs. Information flows and iterated revision are also discussed.

We study belief change in the branching-time structures introduced in Bonanno (Artif Intell 171:144–160, 2007 ). First, we identify a property of branching-time frames that is equivalent (when the set of states is finite) to AGM-consistency, which is defined as follows. A frame is AGM-consistent if the partial belief revision function associated with an arbitrary state-instant pair and an arbitrary model based on that frame can be extended to a full belief revision function that satisfies the AGM postulates. Second, we (...) provide a set of modal axioms that characterize the class of AGM-consistent frames within the modal logic introduced in Bonanno (Artif Intell 171:144–160, 2007 ). Third, we introduce a generalization of AGM belief revision functions that allows a clear statement of principles of iterated belief revision and discuss iterated revision both semantically and syntactically. (shrink)

In the logical context, ignorance is traditionally defined recurring to epistemic logic. In particular, ignorance is essentially interpreted as “lack of knowledge”. This received view has - as we point out - some problems, in particular we will highlight how it does not allow to express a type of content-theoretic ignorance, i.e. an ignorance of φ that stems from an unfamiliarity with its meaning. Contrarily to this trend, in this paper, we introduce and investigate a modal logic having a primitive (...) epistemic operator I, modeling ignorance. Our modal logic is essentially constructed on the modal logics based on weak Kleene three-valued logic introduced by Segerberg (Theoria, 33(1):53–71, 1997). Such non-classical propositional basis allows to define a Kripke-style semantics with the following, very intuitive, interpretation: a formula φ is ignored by an agent if φ is neither true nor false in every world accessible to the agent. As a consequence of this choice, we obtain a type of content-theoretic notion of ignorance, which is essentially different from the traditional approach. We dub it severe ignorance. We axiomatize, prove completeness and decidability for the logic of reflexive (three-valued) Kripke frames, which we find the most suitable candidate for our novel proposal and, finally, compare our approach with the most traditional one. (shrink)

Since belief revision deals with the interaction of belief and information over time, branching-time temporal logic seems a natural setting for a theory of belief change. We propose two extensions of a modal logic that, besides the next-time temporal operator, contains a belief operator and an information operator. The first logic is shown to provide an axiomatic characterization of the first six postulates of the AGM theory of belief revision, while the second, stronger, logic provides an axiomatic characterization of the (...) full set of AGM postulates. © 2006 Elsevier B.V. All rights reserved. (shrink)

This paper is about two requirements on wish reports whose interaction motivates a novel semantics for these ascriptions. The first requirement concerns the ambiguities that arise when determiner phrases, such as definite descriptions, interact with ‘wish’. More specifically, several theorists have recently argued that attitude ascriptions featuring counterfactual attitude verbs license interpretations on which the determiner phrase is interpreted relative to the subject’s beliefs. The second requirement involves the fact that desire reports in general require decision-theoretic notions for their analysis. (...) The current study is motivated by the fact that no existing account captures both of these aspects of wishing. I develop a semantics for wish reports that makes available belief-relative readings but also allows decision-theoretic notions to play a role in shaping the truth conditions of these ascriptions. The general idea is that we can analyze wishing in terms of a two-dimensional notion of expected utility. (shrink)