Recent years witnessed a growing interest in non-standard epistemic logics of knowing whether, knowing how, knowing what, knowing why and so on. The new epistemic modalities introduced in those logics all share, in their semantics, the general schema of ∃x◻φ, e.g., knowing how to achieve φ roughly means that there exists a way such that you know that it is a way to ensure that φ. Moreover, the resulting logics are decidable. Inspired by those particular logics, in this work, we (...) propose a very general and powerful framework based on quantifier-free predicate language extended by a new modality, which packs exactly ∃x◻ together. We show that the resulting language, though much more expressive, shares many good properties of the basic propositional modal logic over arbitrary models, such as finite-tree-model property and van Benthem-like characterization w.r.t.\ first-order modal logic. We axiomatize the logic over S5 frames with intuitive axioms to capture the interaction between the new modality and know-that operator in an epistemic setting. (shrink)

In the early 1960s, to prove undecidability of monadic fragments of sublogics of the predicate modal logic $$\textbf{QS5}$$ QS 5 that include the classical predicate logic $$\textbf{QCl}$$ QCl, Saul Kripke showed how a classical atomic formula with a binary predicate letter can be simulated by a monadic modal formula. We consider adaptations of Kripke’s simulation, which we call the Kripke trick, to various modal and superintuitionistic predicate logics not considered by Kripke. We also discuss settings where the Kripke trick does (...) not work and where, as a result, decidability of monadic modal predicate logics can be obtained. (shrink)

First - order modal logic is very much under current development, with many different semantics proposed. The use of rigid objects goes back to Saul Kripke. More recently, several semantics based on counterparts have been examined, in a development that goes back to David Lewis. There is yet another line of research, using intensional objects, that traces back to Richard Montague. I have been involved with this line of development for some time. In the present paper, I briefly sketch several (...) of the approaches to first - order modal logic. Then I present one that I call FOIL in the Montague tradition that, I believe, is both expressive and natural. I briefly discuss in what sense it can be made to encompass the other approaches. Finally, I provide tableau rules to go with the FOIL semantics. (shrink)

Propositional modal logic is a standard tool in many disciplines, but first-order modal logic is not. There are several reasons for this, including multiplicity of versions and inadequate syntax. In this paper we sketch a syntax and semantics for a natural, well-behaved version of first-order modal logic, and show it copes easily with several familiar difficulties. And we provide tableau proof rules to go with the semantics, rules that are, at least in principle, automatable.

First-order modal logic, in the usual formulations, is not suf- ficiently expressive, and as a consequence problems like Frege’s morning star/evening star puzzle arise. The introduction of predicate abstraction machinery provides a natural extension in which such difficulties can be addressed. But this machinery can also be thought of as part of a move to a full higher-order modal logic. In this paper we present a sketch of just such a higher-order modal logic: its formal semantics, and a proof procedure (...) using tableaus. Naturally the tableau rules are not complete, but they are with respect to a Henkinization of the “true” semantics. We demonstrate the use of the tableau rules by proving one of the theorems involved in G¨ odel’s ontological argument, one of the rare instances in the literature where higher-order modal constructs have appeared. A fuller treatment of the material presented here is in preparation. (shrink)

In this paper, we explore the idea that sets depend on, or are grounded in, their members. It is said that a set depends on each of its members, and not vice versa. Members do not depend on the sets that they belong to. We show that the intuitive modal truth conditions for dependence, given in terms of possible worlds, do not accurately capture asymmetric dependence relations between sets and their members. We extend the modal truth conditions to include impossible (...) worlds and give a more satisfactory account of the dependence of a set on its members. Focusing on the case of singletons, we articulate a logical framework in which to evaluate set-theoretic dependence claims, using a normal first-order modal logic. We show that on this framework the dependence of a singleton on its single members follows from logic alone. However, the converse does not hold. (shrink)

In this paper, we propose a decidable single-agent modal logic for reasoning about goal-directed “knowing how”, based on ideas from linguistics, philosophy, modal logic, and automated planning in AI. We first define a modal language to express “I know how to guarantee \ given \” with a semantics based not on standard epistemic models but on labeled transition systems that represent the agent’s knowledge of his own abilities. The semantics is inspired by conformant planning in AI. A sound and complete (...) proof system is given to capture valid reasoning patterns, which highlights the compositional nature of “knowing how”. The logical language is further extended to handle knowing how to achieve a goal while maintaining other conditions. (shrink)

We offer tableaux systems for logics of essence and accident and logics of non-contingency, showing their soundness and completeness for Kripke semantics. We also show an interesting parallel between these logics based on the semantic insensitivity of the two non-normal operators by which these logics are expressed.

The grounding relation is routinely characterized by means of logical postulates. The aim of this paper is twofold. First, I show that a subset of those postulates is incompatible with a minimal characterization of metaphysical modality. Then I consider a number of ways for reconciling ground with modality. The simplest and most elegant solution consists in adopting serious actualism, which is best captured within a first-order modal language with predicate abstraction governed by negative free logic. I also explore a number (...) of alternative strategies by revising the ground-theoretic postulates, while keeping the modal ones fixed. As I argue, each of those strategies is either unviable, highly contentious, or insufficiently motivated. (shrink)

Anderson-like ontological proofs, studied in this paper, employ contingent identity, free principles of quantification of the 1st order variables and classical principles of quantification of the 2nd order variables. All these theories are strongly complete wrt. classes of modal structures containing families of world-varying objectual domains of the 1st order and constant conceptual domains of the 2nd order. In such structures, terms of the 1st order receive only rigid extensions, which are elements of the union of all 1st order domains. (...) Terms of the 2nd order receive extensions and intensions. Given a family of preselected world-varying objectual domains of the 2nd order, non-rigid extensions of the 2nd order terms belong always to a preselected domain connected with a given world. Rigid intensions of the 2nd order terms are chosen from among members of a conceptual domain of the 2nd order, which is the set of all functions from the set of worlds to the union of all 2nd order preselected domains such that values of these functions at a given world belong to a preselected domain connected with this world. (shrink)

In this investigation we explore a general strategy for constructing modal theories where the modal notion is conceived as a predicate. The idea of this strategy is to develop modal theories over axiomatic theories of truth. In this first paper of our two part investigation we develop the general strategy and then apply it to the axiomatic theory of truth Friedman-Sheard. We thereby obtain the theory Modal Friedman-Sheard. The theory Modal Friedman-Sheard is then discussed from three different perspectives. First, we (...) show that Modal Friedman-Sheard preserves theoremhood modulo translation with respect to modal operator logic. Second, we turn to semantic aspects and develop a modal semantics for the newly developed theory. Third, we investigate whether the modal predicate of Modal Friedman-Sheard can be understood along the lines of a proposal of Kripke, namely as a truth predicate modified by a modal operator. (shrink)

Open futurism is the indeterministic position according to which the future is ‘open’, i.e., there is now no fact of the matter as to what future contingent events will actually obtain. Many open futurists hold a branching conception of time, in which a variety of possible futures exist. This paper introduces two challenges to branching-time open futurism, which are similar in spirit to a challenge posed by Fine to tense realism. The paper argues that, to address the new challenges, open (...) futurists must adopt an objective, non-perspectival notion of actuality and subscribe to an A-theoretic, dynamic conception of reality. Moreover, given a natural understanding of “actual future”, it is perfectly sensible for open futurists to hold that a unique, objectively actual future exists, contrary to a common assumption in the current debate. The paper also contends that recognising the existence of a unique actual future helps open futurists to avoid potential misconceptions. (shrink)

The Aristotelian square of oppositions is a well-known diagram in logic and linguistics. In recent years, several extensions of the square have been discovered. However, these extensions have failed to become as widely known as the square. In this paper we argue that there is indeed a fundamental difference between the square and its extensions, viz., a difference in informativity. To do this, we distinguish between concrete Aristotelian diagrams and, on a more abstract level, the Aristotelian geometry. We then introduce (...) two new logical geometries, and develop a formal, well-motivated account of their informativity. This enables us to show that the square is strictly more informative than many of the more complex diagrams. (shrink)

In this paper, I present and motivate a modal set theory consistent with the idea that there is only one size of infinity.

The Moral Law is fulfilled iff everything that ought to be the case is the case, and The Good is realised in a possible world w at a time t iff w is deontically accessible from w at t. In this paper, I will introduce a set of temporal modal deontic systems with propositional quantifiers that can be used to prove some interesting theorems about The Moral Law and The Good. First, I will describe a set of systems without any (...) propositional quantifiers. Then, I will show how these systems can be extended by a couple of propositional quantifiers. I will use a kind of TxW semantics to describe the systems semantically and semantic tableaux to describe them syntactically. Every system will include a constant · that stands for The Good. ‘·’ is read as ‘The Good is realised’. All systems that contain the propositional quantifiers will also include a constant '*' that stands for The Moral Law. '*' is read as ‘The Moral Law is fulfilled’. I will prove that all systems (without the propositional quantifiers) are sound and complete with respect to their semantics and that all systems (including the extended systems) are sound with respect to their semantics. It is left as an open question whether or not the extended systems are complete. (shrink)

In this paper, I develop a new set of doxastic logical systems and I show how they can be used to solve several well-known problems in doxastic logic, for example the so-called problem of logical omniscience. According to this puzzle, the notions of knowledge and belief that are used in ordinary epistemic and doxastic symbolic systems are too idealised. Hence, those systems cannot be used to model ordinary human or human-like agents' beliefs. At best, they can describe idealised individuals. The (...) systems in this paper can be used to symbolise not only the doxastic states of perfectly rational individuals, but also the beliefs of finite humans. Proof-theoretically, I will use a tableau technique. Every system is combined with predicate logic with necessary identity and ‘possibilist’ quantifiers and modal logic with two kinds of modal operators for relative and absolute necessity. The semantics is a possible world semantics. Finally, I prove that every tableau system in the paper is sound and complete with respect to its semantics. (shrink)

In this paper, I will defend a new compositional semantics for single-domain free logic. This semantics makes use of a distinction between the semantic value of a singular term and its semantic referent. The semantic value of a singular term is conceived of as a set that either contains the semantic referent or no element at all. The semantic referent is the object that the term designates. Before I will introduce this new semantics for single-domain predicate and an S5-type modal (...) logic in detail, I will present five related problems of compositionality of the standard semantics for these logical systems. After that I will show in detail how my new proposed alternative semantics can be used to solve nearly all of the outlined five problems. (shrink)

In this paper, I will show that typical formal semantic reconstructions of the rigidity of proper names neglect the important aspect that the rigidity of names is determined by our ordinary use of a name relative to the actual world. This fact was clearly pointed out by Kripke, but overlooked by the subsequent discussion concerning this topic. Based on this diagnosis, I will distinguish three different actualized notions of rigidity. Firstly, I will introduce two different new varieties of known versions (...) of rigidity; namely, actualized persistent and actualized obstinate rigidity. Secondly, I will make use of the tools provided by free logic and introduce a new and overlooked version of rigidity, which I will call actually restricted rigidity. Against this background, I will argue that we have different options to formally model the rigidity of proper names in natural languages. Which option we choose, mainly depends on our philosophical background assumptions. For someone who believes in non-existent objects and the possibility of naming such objects, it is the best choice to hold that proper names are actually obstinately rigid designators. For someone who rejects non-existent objects and the possibility of naming such objects, actually restricted rigidity is a better choice than actualized persistent rigidity. (shrink)

Reformulation strategies for solving Fitch’s paradox of knowability date back to Edgington. Their core assumption is that the formula \, from which the paradox originates, does not correctly express the intended meaning of the verification thesis, which should concern possible knowledge of actual truths, and therefore the contradiction does not represent a logical refutation of verificationism. Supporters of these solutions claim that can be reformulated in a way that blocks the derivation of the paradox. Unfortunately, these reformulation proposals come with (...) other problems, on both the logical and the philosophical side. We claim that in order to make the reformulation idea consistent and adequate one should analyze the paradox from the point of view of a quantified modal language. An approach in this line was proposed by, among others, Kvanvig but was not fully developed in its technical details. Here we approach the paradox by means of a first order hybrid modal logic, a tool that strikes us as more adequate to express transworld reference and the rigidification needed to consistently express this idea. The outcome of our analysis is ambivalent. Given a first order formula we are able to express the fact that it is knowable in a way which is both consistent and adequate. However, one must give up the possibility of formulating as a substitution free schema of the kind \. We propose that one may instead formulate by means of a recursive translation of the initial formula, being aware that many alternative translations are possible. (shrink)

Core principles of mereology have been questioned by appealing to time travel scenarios. This paper questions the methodology of employing time travel scenarios to argue against mereology. We show some time travel scenarios are structurally equivalent to more standard ones not involving time travel; and that the three main theories about persistence through time can each solve both the time travel scenario as well as the structurally similar classical scenario. Time travel scenarios that are not similar to more standard arguments (...) are instead problematic because they are open to different, incompatible interpretations. We conclude that compared to the classical arguments against mereological principles, time travel scenarios do not add anything new. (shrink)

In this paper I argue that descriptive content associated with a proper name can serve as a truth-conditionally relevant adjunct and be an additional contribution of the name to the truth-conditions. Definite descriptions the so-and-so associated by speakers with a proper name can be used as qualifying prepositional phrases as so-and-so, so sentences containing a proper name NN is doing something could be understood as NN is doing something as NN (which means as so-and-so). Used as an adjunct, the descriptive (...) content of a proper name expresses the additional circumstances of an action (a manner, reason, goal, time or purpose) and constitute a part of a predicate. I argue that qualifying prepositional phrases should be analyzed as predicate modifiers and propose a formal representation of modified predicates. The additional truth-conditional relevance of the descriptive content of a proper name helps to explain the phenomenon of the substitution failure of coreferential names in simple sentences. (shrink)

In this paper I concern myself with The Superman Puzzle. I argue that the descriptive content associated with proper names, besides determining the proper name's reference, function as truthconditionally relevant adjuncts which can be used to express a manner, reason, goal, time or purpose of action. In that way a sentence with a proper name NN is doing something could be understood as NN is doing something as NN. I argue that the substitution of names can fail on modified readings (...) because the different descriptive content of proper names modifies the main predicate differently. Here I present a formal representation of modified predicates which allows one to model intuitively the different truth-conditions of sentences from The Puzzle. (shrink)

Assertion plays a crucial dual role in Frege's conception of logic, a formal and a transcendental one. A recurrent complaint is that Frege's inclusion of the judgement-stroke in the Begriffsschrift is either in tension with his anti-psychologism or wholly superfluous. Assertion, the objection goes, is at best of merely psychological significance. In this paper, I defend Frege against the objection by giving reasons for recognising the central logical significance of assertion in both its formal and its transcendental role.

The logic TK was introduced as a propositional logic extending the classical propositional calculus with a new unary operator which interprets some conceptions of Tarski’s consequence operator. TK-algebras were introduced as models to TK . Thus, by using algebraic tools, the adequacy (soundness and completeness) of TK relatively to the TK-algebras was proved. This work presents a neighbourhood semantics for TK , which turns out to be deductively equivalent to the non-normal modal logic EMT4 . DOI:10.5007/1808-1711.2011v15n2p287.

This paper addresses D. C. Williams’s question, “How can Leibniz know that he is a member of the actual world and not merely a possible monad on the shelf of essence?” A variety of answers are considered. Ultimately, it is argued that no particular perception of a state of affairs in the world can warrant knowledge of one’s actuality, nor can the awareness of any property within oneself; rather, it is the nature of experience itself, with the flow of perceptions, (...) that guarantees our actuality. A consequence of this view is that no non-actual individuals can truly be said to experience their worlds, nor can they ask the question if they are actual or not. (shrink)

This paper investigates and develops generalizations of two-dimensional modal logics to any finite dimension. These logics are natural extensions of multidimensional systems known from the literature on logics for a priori knowledge. We prove a completeness theorem for propositional n-dimensional modal logics and show them to be decidable by means of a systematic tableau construction.

Plural definite descriptions across many languages display two well-known properties. First, they can give rise to so-called non-maximal readings, in the sense that they ‘allow for exceptions’. Second, while they tend to have a quasi-universal quantificational force in affirmative sentences, they tend to be interpreted existentially in the scope of negation. Building on previous works, we offer a theory in which sentences containing plural definite expressions trigger a family of possible interpretations, and where general principles of language use account for (...) their interpretation in various contexts and syntactic environments. Our theory solves a number of problems that these previous works encounter, and has broader empirical coverage in that it offers a precise analysis for sentences that display complex interactions between plural definites, quantifiers and bound variables, as well as for cases involving non-distributive predicates. The resulting proposal is briefly compared with an alternative proposal by Križ, which has similar coverage but is based on a very different architecture and sometimes makes subtly different predictions. (shrink)

When it comes to Kripke-style semantics for quantified modal logic, there’s a choice to be made concerning the interpretation of the quantifiers. The simple approach is to let quantifiers range over all possible objects, not just objects existing in the world of evaluation, and use a special predicate to make claims about existence. This is the constant domain approach. The more complicated approach is to assign a domain of objects to each world. This is the varying domain approach. Assuming that (...) all terms denote, the semantics of predication on the constant domain approach is obvious: either the denoted object has the denoted property in the world of evaluation, or it hasn’t. On the varying domain approach, there’s a third possibility: the object in question doesn’t exist. Terms may denote objects not included in the domain of the world of evaluation. The question is whether an atomic formula then should be evaluated as true or false, or if its truth value should be undefined. This question, however, cannot be answered in isolation. The consequences of one’s choice depends on the interpretation of molecular formulas. Should the negation of a formula whose truth value is undefined also be undefined? What about conjunction, universal quantification and necessitation? The main contribution of this paper is to identify two partial semantics for logical operators, a weak and a strong one, which uniquely satisfy a list of reasonable constraints. I also show that, provided that the point of using varying domains is to be able to make certain true claims about existence without using any existence predicate, this result yields two possible partial semantics for quantified modal logic with varying domains. (shrink)

A new type of formalization of classical first-order logic with equality is introduced on the basis of the sequent calculus. It serves to justify the claim that equality is a logical constant characterised by well-behaved rules satisfying properties usually regarded as essential. The main feature of this approach is the application of sequents built not only from formulae but also from terms. Two variants of sequent calculus are examined, a structural and a logical one. The former is defined in accordance (...) with Dos̆en’s criteria for logical constants. The latter is a standard Gentzen’s sequent calculus and satisfies Hacking’s criteria for logicality, including cut elimination. It is also shown that provided rules are harmonious in the sense advocated by Gratzl and Orlandelli. (shrink)

There has been very little discussion of the appropriate principles to govern a modal logic of plurals. What debate there has been has accepted a principle I call (Necinc); informally if this is one of those then, necessarily: this is one of those. On this basis Williamson has criticised the Boolosian plural interpretation of monadic second-order logic. I argue against (Necinc), noting that it isn't a theorem of any logic resulting from adding modal axioms to the plural logic PFO+, and (...) showing that the most obvious formal argument in its favour is question begging. I go on to discuss the behaviour of natural language plurals, motivating a case against (Necinc) by developing a case that natural language plural terms are not de jure rigid designators. The paper concludes by developing a model theory for modal PFO-f which does not validate (Necinc). An Appendix discusses (Necinc) in relation to counterpart theory. Of course, it would be a mistake to think that the rules for "multiple pointing" follow automatically from the rules for pointing proper. Max Black—The Elusiveness of Sets In some influential articles during the 1980s George Boolos proposed an interpretation of monadic second-order logic in terms of plural quantification [4, 5]. One objection to this proposal, pressed by Williamson [22, 456-7], focuses on the modal behaviour of plural variables, arguing that the proposed interpretation yields the wrong results in respect of the modal status of atomic predications. In the present paper I will present this objection and argue against it. In the course of developing the argument, I will have cause to consider the under-investigated question of how a logic for plurals should be extended to incorporate modal operators. (shrink)

The contribution of this paper lies with providing a systematically specified and intuitive interpretation pattern and delineating a class of relational structures and models providing a natural interpretation of logical operators on an underlying propositional calculus of Positive Lattice Logic and subsequently proving a generic completeness theorem for the related class of logics, sometimes collectively referred to as Generalized Galois Logics.

Quantified modal logic has reputation for complexity. Completeness results for the various systems appear piecemeal. Different tactics are used for different systems, and success of a given method seems sensitive to many factors, including the specific combination of choices made for the quantifiers, terms, identity, and the strength of the underlying propositional modal logic. The lack of a unified framework in which to view QMLs and their completeness properties puts pressure on those who develop, apply, and teach QML to work (...) with the simplest systems, namely those that adopt the Barcan Formulas and predicate logic rules for the quantifiers. In these systems, the quantifier ranges over a fixed domain of possible individuals, so advocates of these logics are sometimes called possibilists. A literature has grown up rationalizing the choice of possibilist logics despite ordinary intuitions that the resulting theorems are too strong.Williamson even takes the view that the complications to be faced within the weaker logics “are a warning sign of philosophical error”. It is the purpose of this paper to show that abandonment of the weaker QMLs is excessively fainthearted, since most QMLs can be given relatively simple formulations within one general framework. Given the straightforward nature of the systems and their completeness results, the purported complications evaporate, along with any philosophical warnings one might have associated with them. (shrink)

In this article I defend a form of classical possibilism with an actualist foundation. As a matter of fact, I believe that this position is more in keeping with the classical metaphysical tradition. According to this form of possibilism, I construe possible objects as possible non-existing objects of an existing producing power. Consequently, they are nothing vis-à -vis the modality of their own actual being, although they do exist with regard to the modality of the producing power’s being. The actualist (...) requirement prescribed by the Frege-Quinean criterion of the quantification domain is thus fulfilled; indeed, really possible objects are not actual objects, but their possibility is actual. (shrink)

How to interpret singular terms in fiction? In this paper, we address this semantic question from the perspective of the Artifactual Theory of Fiction (ATF). According to the ATF, fictional characters exist as abstract artifacts created by their author, and preserved through the existence of copies of an original work and a competent readership. We pretend that a well-suited semantics for the ATF can be defined with respect to a modal framework by means of Hintikka’s world lines semantics. The question (...) of the interpretation of proper names is asked in relation to two inference rules, problematic when applied in intensional contexts: the Substitution of Identicals and Existential Generalization. The former fails because identity is contingent. The latter because proper names are not necessarily linked to well-identified individuals. This motivates a non-rigid interpretation of proper names in fiction, although cross-fictional reference (e.g. to real entities) is made possible by the interpretative efforts of the reader. (shrink)

It is acknowledged by proponents of the Artifactual Theory of Fiction that literary works sometimes involve real or immigrant characters. However, their conception of cross-fictional identity faces serious difficulties. In this paper, we set the problem in the context of a modal framework, in relation to quantification across a plurality of possible worlds. Quantification is explained in terms of Hintikka’s notion of world lines; i.e. the possible values of bound variables are individuals that are not reduced to their manifestations. We (...) finally offer another understanding of identity across weakly impermeable domains, in a way compatible with the Artifactual Theory of Fiction. (shrink)

Tarski apresentou sua definição de operador de consequência com a intenção de expor as concepções fundamentais da consequência lógica. Um espaço de Tarski é um par ordenado determinado por um conjunto não vazio e um operador de consequência sobre este conjunto. Esta estrutura matemática caracteriza um espaço quase topológico. Este artigo mostra uma visão algébrica dos espaços de Tarski e introduz uma lógica proposicional modal que interpreta o seu operador modal nos conjuntos fechados de algum espaço de Tarski. DOI:10.5007/1808-1711.2010v14n1p47.

Kurt Gödel’s version of the Ontological Proof derives rather than assumes the crucial Possibility Claim: the claim that it is possible that something God-like exists. Gödel’s derivation starts off with a proof of the Possible Instantiation of the Positive: the principle that, if a property is positive, it is possible that there exists something that has that property. I argue that Gödel’s proof of this principle relies on some implausible axiological assumptions but it can be patched so that it only (...) relies on plausible principles. But Gödel’s derivation of the Possibility Claim also needs a substantial axiological assumption, which is still open to doubt. (shrink)

In “Facts: Particulars of Information Units?”, Kratzer proposed a causal analysis of knowledge in which knowledge is defined as a form of de re belief of facts. In support of Kratzer’s view, I show that a certain articulation of the de re/de dicto distinction can be used to integrally account for the original pair of Gettier cases. In contrast to Kratzer, however, I think such an account does not fundamentally require a distinction between facts and true propositions. I then discuss (...) whether this account might be generalized and whether it can give us a reductive analysis of knowledge as de re true belief. Like Kratzer, I think it will not, in particular the distinction appears inadequate to account for Ginet-Goldman cases of causally connected but unreliable belief. Nevertheless, I argue that the de re belief analysis allows us to account for a distinction Starmans and Friedman recently introduced between apparent evidence and authentic evidence in their empirical study of Gettier cases, in a way that questions their claim that a causal disconnect is not operative in the contrasts they found. (shrink)

We present in this note a plea for Barcan formula. This view connects Barcan formula with a modal principle that expresses the -Introduction rule of first-order logic.

Variabilism is the view that proper names (like pronouns) are semantically represented as variables. Referential names, like referential pronouns, are assigned their referents by a contextual variable assignment (Kaplan 1989). The reference parameter (like the world of evaluation) may also be shifted by operators in the representation language. Indeed verbs that create hyperintensional contexts, like ‘think’, are treated as operators that simultaneously shift the world and assignment parameters. By contrast, metaphysical modal operators shift the world of assessment only. Names, being (...) variables, refer rigidly in the latter merely intensional contexts, but may vary their reference in hyperintensional contexts. This conforms to the intuition that the content of attitude ascriptions encapsulates referential uncertainty. Furthermore, names in hyperintensional contexts are ambiguous between de re* and de dicto* interpretations. This fact is used to account for asymmetric mistaken identity attributions (for example, Biron thinks Katherine is Rosaline, but he doesn’t think Rosaline is Katherine). -/- The variable theory compares favourably with its alternatives, including Millianism and descriptivism. Millians cannot account for the behaviour of names in hyperintensional contexts, while descriptivists cannot generate a necessary contrast between intensional and hyperintensional contexts. No other theory can capture the facts pertaining to the existentially bound use of names. (shrink)

A general strategy for proving completeness theorems for quantified modal logics is provided. Starting from free quantified modal logic K, with or without identity, extensions obtained either by adding the principle of universal instantiation or the converse of the Barcan formula or the Barcan formula are considered and proved complete in a uniform way. Completeness theorems are also shown for systems with the extended Barcan rule as well as for some quantified extensions of the modal logic B. The incompleteness of (...) Q°.B + BF is also proved. (shrink)

Imagination has received a great deal of attention in different fields such as psychology, philosophy and the cognitive sciences, in which some works provide a detailed account of the mechanisms involved in the creation and elaboration of imaginary worlds. Although imagination has also been formalized using different logical systems, none of them captures those dynamic mechanisms. In this work, we take inspiration from the Common Frame for Imagination Acts, that identifies the different processes involved in the creation of imaginary worlds, (...) and we use it to define a dynamic formal system called the Logic of Imagination Acts. We build our logic by using a possible-worlds semantics, together with a new set of static and dynamic modal operators. The role of the new dynamic operators is to call different algorithms that encode how the formal model is expanded in order to capture the different mechanisms involved in the creation and development of imaginary worlds. We provide the definitions of the language, the semantics and the algorithms, together with an example that shows how the model is expanded. By the end, we discuss some interesting features of our system, and we point out to possible lines of future work. (shrink)

Imagination has received a great deal of attention in different fields such as psychology, philosophy and the cognitive sciences, in which some works provide a detailed account of the mechanisms involved in the creation and elaboration of imaginary worlds. Although imagination has also been formalized using different logical systems, none of them captures those dynamic mechanisms. In this work, we take inspiration from the Common Frame for Imagination Acts, that identifies the different processes involved in the creation of imaginary worlds, (...) and we use it to define a dynamic formal system called the Logic of Imagination Acts. We build our logic by using a possible-worlds semantics, together with a new set of static and dynamic modal operators. The role of the new dynamic operators is to call different algorithms that encode how the formal model is expanded in order to capture the different mechanisms involved in the creation and development of imaginary worlds. We provide the definitions of the language, the semantics and the algorithms, together with an example that shows how the model is expanded. By the end, we discuss some interesting features of our system, and we point out to possible lines of future work. (shrink)

A novel non-classical mereological concept built up by blending the Metaphysics of Xavier Zubiri and the Quantum Theory of Atoms in Molecules of R. F. W. Bader is proposed. It is argued that this philosophical concept is necessary to properly account for what happens in a chemical reaction. From the topology of the gradient of the laplacian of the electronic charge density, \\) within the QTAIM framework, different “atomic graphs” are found for each atom depending on the molecular context, reflecting (...) how the whole molecule affects each atom. In this way, the whole molecular system imposes certain geometry onto each atom, and every atom exhibits different ontological modality. On the Metaphysical side, for X. Zubiri real things are system of different notes. The physical essence is the subsystem of essential notes with a coherence unity. Every note is grounded on the essence. The unity of the system is present somehow in every note-of beforehand, and every essential note-of turns towards the other. The essence determines the position of each note within the system, and hence is the grounding for modality of the notes. By conflating both “theories” and taking the atoms as essential notes, we propose the concept of “Molecule in atoms-of” or “atoms-of in Molecules”. Within the course of a chemical reaction the atoms-of modified their “of” as required by the new molecular unity being formed, and eventually change their modality. The validity to the Zubiri’s statements, is attained by evaluating necessity and possibility in a set-up of finite accessible “possible worlds”. (shrink)

This paper offers a semantic study in multi-relational semantics of quantified N-Monotonic modal logics with varying domains with and without the identity symbol. We identify conditions on frames to characterise Barcan and Ghilardi schemata and present some related completeness results. The characterisation of Barcan schemata in multi-relational frames with varying domains shows the independence of BF and CBF from well-known propositional modal schemata, an independence that does not hold with constant domains. This fact was firstly suggested for classical modal systems (...) by Stolpe, 557–575, 2003), but unfortunately that work used only models and not frames. (shrink)

This is a companion paper to Braüner where a natural deduction system for propositional hybrid logic is given. In the present paper we generalize the system to the first-order case. Our natural deduction system for first-order hybrid logic can be extended with additional inference rules corresponding to conditions on the accessibility relations and the quantifier domains expressed by so-called geometric theories. We prove soundness and completeness and we prove a normalisation theorem. Moreover, we give an axiom system first-order hybrid logic.

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)

. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 2 2 BASIC MODAL LOGIC . . . . . . . . . . . . . . . . . . . . . . . . . . . 3.