This paper considers proof-theoretic semantics for necessity within Dummett's and Prawitz's framework. Inspired by a system of Pfenning's and Davies's, the language of intuitionist logic is extended by a higher order operator which captures a notion of validity. A notion of relative necessary is defined in terms of it, which expresses a necessary connection between the assumptions and the conclusion of a deduction.

In this article, I define and then defend the principle of information closure (pic) against a sceptical objection similar to the one discussed by Dretske in relation to the principle of epistemic closure. If I am successful, given that pic is equivalent to the axiom of distribution and that the latter is one of the conditions that discriminate between normal and non-normal modal logics, a main result of such a defence is that one potentially good reason to look for a (...) formalization of the logic of “ $S$ is informed that $p$ ” among the non-normal modal logics, which reject the axiom, is also removed. This is not to argue that the logic of “ $S$ is informed that $p$ ” should be a normal modal logic, but that it could still be insofar as the objection that it could not be, based on the sceptical objection against pic, has been removed. In other word, I shall argue that the sceptical objection against pic fails, so such an objection provides no ground to abandon the normal modal logic B (also known as KTB) as a formalization of “ $S$ is informed that $p$ ”, which remains plausible insofar as this specific obstacle is concerned. (shrink)

The paper surveys the currently available axiomatizations of common belief (CB) and common knowledge (CK) by means of modal propositional logics. (Throughout, knowledge- whether individual or common- is defined as true belief.) Section 1 introduces the formal method of axiomatization followed by epistemic logicians, especially the syntax-semantics distinction, and the notion of a soundness and completeness theorem. Section 2 explains the syntactical concepts, while briefly discussing their motivations. Two standard semantic constructions, Kripke structures and neighbourhood structures, are introduced in Sections (...) 3 and 4, respectively. It is recalled that Aumann's partitional model of CK is a particular case of a definition in terms of Kripke structures. The paper also restates the well-known fact that Kripke structures can be regarded as particular cases of neighbourhood structures. Section 3 reviews the soundness and completeness theorems proved w.r.t. the former structures by Fagin, Halpern, Moses and Vardi, as well as related results by Lismont. Section 4 reviews the corresponding theorems derived w.r.t. the latter structures by Lismont and Mongin. A general conclusion of the paper is that the axiomatization of CB does not require as strong systems of individual belief as was originally thought- only monotonicity has thusfar proved indispensable. Section 5 explains another consequence of general relevance: despite the "infinitary" nature of CB, the axiom systems of this paper admit of effective decision procedures, i.e., they are decidable in the logician's sense. (shrink)

This is a thorough treatment of first-order modal logic. The book covers such issues as quantification, equality (including a treatment of Frege's morning star/evening star puzzle), the notion of existence, non-rigid constants and function symbols, predicate abstraction, the distinction between nonexistence and nondesignation, and definite descriptions, borrowing from both Fregean and Russellian paradigms.

We investigate an enrichment of the propositional modal language L with a "universal" modality ■ having semantics x ⊧ ■φ iff ∀y(y ⊧ φ), and a countable set of "names" - a special kind of propositional variables ranging over singleton sets of worlds. The obtained language ℒ $_{c}$ proves to have a great expressive power. It is equivalent with respect to modal definability to another enrichment ℒ(⍯) of ℒ, where ⍯ is an additional modality with the semantics x ⊧ ⍯φ (...) iff Vy(y ≠ x → y ⊧ φ). Model-theoretic characterizations of modal definability in these languages are obtained. Further we consider deductive systems in ℒ $_{c}$ . Strong completeness of the normal ℒ $_{c}$ logics is proved with respect to models in which all worlds are named. Every ℒ $_{c}$ -logic axiomatized by formulae containing only names (but not propositional variables) is proved to be strongly frame-complete. Problems concerning transfer of properties ([in]completeness, filtration, finite model property etc.) from ℒ to ℒ $_{c}$ are discussed. Finally, further perspectives for names in multimodal environment are briefly sketched. (shrink)

The topic of this paper may be introduced by fast zooming in and out of the philosophy of information. In recent years, philosophical interest in the nature of information has been increasing steadily. This has led to a focus on semantic information, and then on the logic of being informed, which has attracted analyses concentrating both on the statal sense in which S holds the information that p (this is what I mean by logic of being informed in the rest (...) of this article) and on the actional sense in which S becomes informed that p. One of the consequences of the logic debate has been a renewed epistemological interest in the principle of information closure (henceforth PIC), which finally has motivated a revival of a skeptical objection against its tenability first made popular by Dretske. This is the topic of the paper, in which I seek to defend PIC against the skeptical objection. If I am successful, this means – and we are now zooming out – that the plausibility of PIC is not undermined by the skeptical objection, and therefore that a major epistemological argument against the formalization of the logic of being informed based on the axiom of distribution in modal logic is removed. But since the axiom of distribution discriminates between normal and non-normal modal logics, this means that a potentially good reason to look for a formalization of the logic of being informed among the non-normal modal logics, which reject the axiom, is also removed. And this in turn means that a formalization of the logic of being informed in terms of the normal modal logic B (also known as KTB) is still very plausible, at least insofar as this specific obstacle is concerned. In short, I shall argue that the skeptical objection against PIC fails, so it is not a good reason to abandon the normal modal logic B as a good formalization of the logic of being informed. (shrink)

In this paper we provide cut-free tableau calculi for the intuitionistic modal logics IK, ID, IT, i.e. the intuitionistic analogues of the classical modal systems K, D and T. Further, we analyse the necessity of duplicating formulas to which rules are applied. In order to develop these calculi we extend to the modal case some ideas presented by Miglioli, Moscato and Ornaghi for intuitionistic logic. Specifically, we enlarge the language with the new signs Fc and CR near to the usual (...) signs T and F. In this work we establish the soundness and completeness theorems for these calculi with respect to the Kripke semantics proposed by Fischer Servi. (shrink)

A (normal) system of propositional modal logic is said to be complete iff it is characterized by a class of (Kripke) frames. When we move to modal predicate logic the question of completeness can again be raised. It is not hard to prove that if a predicate modal logic is complete then it is characterized by the class of all frames for the propositional logic on which it is based. Nor is it hard to prove that if a propositional modal (...) logic is incomplete then so is the predicate logic based on it. But the interesting question is whether a complete propositional modal logic can have an incomplete extension. In 1967 Kripke announced the incompleteness of a predicate extension of S4. The purpose of the present article is to present several such systems. In the first group it is the systems with the Barcan Formula which are incomplete, while those without are complete. In the second group it is those without the Barcan formula which are incomplete, while those with the Barcan Formula are complete. But all these are based on propositional systems which are characterized by frames satisfying in each case a single first-order sentence. (shrink)

This chapter contains sections titled: Introduction Modal propositional Logics (MPLs) Modal Quantificational Logics(QMLs).

According to actualism, modal reality is constructed out of valuations (combinations of truth values for all propositions). According to possibilism, modal reality consists in a set of possible worlds, conceived as independent objects that assign truth values to propositions. According to possibilism, accounts of modal reality can intelligibly disagree with each other even if they agree on which valuations are contained in modal reality. According to actualism, these disagreements (possibilist disagreements) are completely unintelligible. An essentially actualist semantics for modal propositional (...) logic specifies which sets of valuations are compatible with the meanings of the truth-functional connectives and modal operators without drawing on formal resources that would enable us to represent possibilist disagreements. The paper discusses the availability of an essentially actualist semantics for modal propositional logic. I argue that the standard Kripkean semantics is not essentially actualist and that other extant approaches also fail to provide a satisfactory essentially actualist semantics. I end by describing an essentialist actualist semantics for modal propositional logic. (shrink)

I begin by distinguishing two notions of model, the notion of a truth-making structure and the notion of a mathematical model (in one specific sense). I then argue that although the models of the semantic view have often been taken to be both truth-making structures and mathematical models, this is in part due to a failure to distinguish between two ways of truth-making; in fact, the talk of truth-making is best excised from the view altogether. The result is a version (...) of the semantic view which is better supported by the direct evidence offered for it, better equipped to achieve its avowed aims, and, I think, closer to the intentions of the original proponents of the view in many ways, despite some of their own declarations to the contrary. (shrink)

Complete deductive systems are constructed for the non-valid (refutable) formulae and sequents of some propositional modal logics. Thus, complete syntactic characterizations in the sense of Lukasiewicz are established for these logics and, in particular, purely syntactic decision procedures for them are obtained. The paper also contains some historical remarks and a general discussion on refutation systems.

In the paper (Braüner, 2001) we gave a minimal condition for the existence of a homophonic theory of truth for a modal or tense logic. In the present paper we generalise this result to arbitrary modal logics and we also show that a modal logic permits the existence of a homophonic theory of truth if and only if it permits the definition of a socalled master modality. Moreover, we explore a connection between the master modality and hybrid logic: We show (...) that if attention is restricted to bidirectional frames, then the expressive power of the master modality is exactly what is needed to translate the bounded fragment of first-order logic into hybrid logic in a truth preserving way. We believe that this throws new light on Arthur Prior's fourth grade tense logic. (shrink)

The purpose of this paper is to introduce a form of update based on the minimization of the geodesic distance on a graph. We provide a characterization of this class using set- theoretic operators and show that such operators bijectively correspond to geodesic metrics. As distance is generated by distinguishability, our framework is appropriate in contexts where distance is generated by threshold, and therefore, when measurement is erroneous.

It has been argued that actualism – the view that there are no non-actual objects – cannot deal adequately with statements involving iterated modality, because such claims require reference, either explicit or surreptitious, to non-actual objects. If so, actualists would have to reject the standard semantics for quantified modal logic (QML). In this paper I develop an account of modality which allows the actualist to make sense of iterated modal claims that are ostensibly about non-actual objects. Every occurrence of a (...) modal operator involves the stipulation of a possible world, and nested modal operators require stipulation of nested possible worlds. I provide an actualistically acceptable (AA) semantics for QML wherein the nesting relation is irreflexive and intransitive and forms a tree. Despite these restrictions, AA models can beshown to be sound and complete for a wide variety of modal logics. (shrink)

We give sound and complete tableau and sequent calculi for the prepositional normal modal logics S4.04, K4B and G 0(these logics are the smallest normal modal logics containing K and the schemata A A, A A and A ( A); A A and AA; A A and ((A A) A) A resp.) with the following properties: the calculi for S4.04 and G 0are cut-free and have the interpolation property, the calculus for K4B contains a restricted version of the cut-rule, the (...) so-called analytical cut-rule.In addition we show that G 0is not compact (and therefore not canonical), and we proof with the tableau-method that G 0is characterised by the class of all finite, (transitive) trees of degenerate or simple clusters of worlds; therefore G 0is decidable and also characterised by the class of all frames for G 0. (shrink)

In their presentation of canonical models for normal systems of modal logic, Hughes and Cresswell observe that some of these models are based on a frame which can be also thought of as a collection of two or more isolated frames; they call such frames ‘non-cohesive’. The problem of checking whether the canonical model of a given system is cohesive is still rather unexplored and no general decision procedure is available. The main contribution of this article consists in introducing a (...) method which is sufficient to show that canonical models of some relevant classes of normal monomodal and bimodal systems are always non-cohesive. (shrink)

Temporal logic of causal knowledge over general partially ordered structures of local states is defined. The definition of knowledge captures the change of state due to action executions. The structures are a variant of flow event structures including prime event structures and branching processes of Petri Nets. Modalities corresponding to the causality, concurrency, and indistinguishability relations are used. Formulas are interpreted over local state occurrences. The logic is proved to be decidable and a complete axiomatization is provided.

This paper presents an w-completeness theorem for a new propositional probabilistic logic, namely, the dynamic propositional logic of qualitative probabilities (DQP), which has been introduced by the author as a dynamic extension of the logic of qualitative probabilities (Q P) introduced by Segerberg.

The logic of acceptance and rejection (AEL2) is a nonmonotonic formalism to represent states of knowledge of an introspective agent making decisions about available information. Though having much in common, AEL2 differs from Moore's autoepistemic logic (AEL) by the fact that the agent not only can accept or reject a given fact, but he/she also has the possibility not to make any decision in case he/she does not have enough knowledge.

Knowing that some state of affairs—expressed by a proposition, p—is possible, and the possibility that one knows that p have, quite obviously, different meanings. This paper focuses only on their logical relationship—whether they entail one another. I will argue for the following three claims: the basic verificationist principles of anti-realism, at least in their simplest forms, and in conjunction with some other, intuitively reasonable principles, do entail that these two concepts are substitutionally equivalent. Our pre-theoretical expectations question this outcome, as (...) counterexamples can be manufactured. I will also argue that this substitutional equivalence has further, highly counter-intuitive implications. Finally, I will argue that some of the standard strategies to avoid the well-known paradoxes of anti-realism fail to solve this new paradox, while others may be able to do that, but only at a considerable price. However, the introduction of a moderate anti-realist truth operator, the actual objective of this paper, does dissolve the paradox, and arguably at an affordable price. (shrink)

We present and discuss various formalizations of Modal Logics in Logical Frameworks based on Type Theories. We consider both Hilbert- and Natural Deduction-style proof systems for representing both truth (local) and validity (global) consequence relations for various Modal Logics. We introduce several techniques for encoding the structural peculiarities of necessitation rules, in the typed -calculus metalanguage of the Logical Frameworks. These formalizations yield readily proof-editors for Modal Logics when implemented in Proof Development Environments, such as Coq or LEGO.

This paper presents logics for reasoning about extension and reduction of partial information states. This enterprise amounts to nonpersistent variations of certain constructive logics, in particular the so-called logic of constructible falsity of Nelson. We provide simple semantics, sequential calculi, completeness and decidability proofs.

Given a 1-ary sentence operator , we describe L - another 1-ary operator - as as a left inverse of in a given logic if in that logic every formula is provably equivalent to L. Similarly R is a right inverse of if is always provably equivalent to R. We investigate the behaviour of left and right inverses for taken as the operator of various normal modal logics, paying particular attention to the conditions under which these logics are conservatively extended (...) by the addition of such inverses, as well as to the question of when, in such extensions, the inverses behave as normal modal operators in their own right. (shrink)

The role played by continuous morphisms in propositional modal logic is investigated: it turns out that they are strictly related to filtrations and to suitable variants of the notion of a free algebra. We also employ continuous morphisms in incremental constructions of (standard) finitely generated free ????4-algebras.

We present a propositional and a first-order logic for reasoning about higher-order upper and lower probabilities. We provide sound and complete axiomatizations for the logics and we prove decidability in the propositional case. Furthermore, we show that the introduced logics generalize some existing probability logics.

The paper generalises Goldblatt's completeness proof for Lemmon–Scott formulas to various modal propositional logics without classical negation and without ex falso, up to positive modal logic, where conjunction and disjunction, andwhere necessity and possibility are respectively independent.Further the paper proves definability theorems for Lemmon–Scottformulas, which hold even in modal propositional languages without negation and without falsum. Both, the completeness theorem and the definability theoremmake use only of special constructions of relations,like relation products. No second order logic, no general frames are (...) involved. (shrink)

It is demonstrated that Hamblin's 15 tense theorem does not only hold for temporal logic with linear time but also for branching time. Furthermore three other theorems with finitely many tenses are shown.

The problems we deal with concern reasoning about incomplete knowledge. Knowledge is understood as ability of an ideal rational agent to make decisions about pieces of information. The formalisms we are particularly interested in are Moore's autoepistemic logic (AEL) and its variant, the logic of acceptance and rejection (AEL2). It is well-known that AEL may be seen as the nonmonotonic KD45 modal logic. The aim is to give an appropriate modal formalization for AEL2.

The main goal of this work is to present the proof-theoretical and model-theoretical approaches to probabilistic logics which allow reasoning about independence and probabilistic support. We extend the existing formalisms [14] to obtain several variants of probabilistic logics by adding the operators for independence and confirmation to the syntax. We axiomatize these logics, provide corresponding semantics, prove that the axiomatizations are sound and strongly complete, and discuss decidability issues.