I give two arguments for the claim that all events which occur at the actual world and are such that they could be caused, are also such that they must actually be caused. The first argument is an improvement of a similar argument advanced by Alexander Pruss, which I show to be invalid. It uses Pruss’s Brouwer Analog for counterfactual logic, and, as a consequence, implies inconsistency with Lewis’s semantics for counterfactuals. While (I suggest) this consequence may not be objectionable, (...) the argument founders on the fact that Pruss’s Brouwer Analog has a clear counterexample. I thus turn to a second, “Lewisian” argument, which requires only an affirmation of one element of Lewis’s analysis of causation and one other, fairly weak possibility claim about the nature of wholly contingent events. The final section of the paper explains how both arguments escape objections from supposed indeterminacy in quantum physics. (shrink)

The book presents a thoroughly elaborated logical theory of generalized truth-values understood as subsets of some established set of truth values. After elucidating the importance of the very notion of a truth value in logic and philosophy, we examine some possible ways of generalizing this notion. The useful four-valued logic of first-degree entailment by Nuel Belnap and the notion of a bilattice constitute the basis for further generalizations. By doing so we elaborate the idea of a multilattice, and most notably, (...) a trilattice of truth values – a specific algebraic structure with information ordering and two distinct logical orderings, one for truth and another for falsity. Each logical order not only induces its own logical vocabulary, but determines also its own entailment relation. We consider both semantic and syntactic ways of formalizing these relations and construct various logical calculi. (shrink)

This book offers a state-of-the-art introduction to the basic techniques and results of neighborhood semantics for modal logic. In addition to presenting the relevant technical background, it highlights both the pitfalls and potential uses of neighborhood models – an interesting class of mathematical structures that were originally introduced to provide a semantics for weak systems of modal logic. In addition, the book discusses a broad range of topics, including standard modal logic results ; bisimulations for neighborhood models and other model-theoretic (...) constructions; comparisons with other semantics for modal logic ; neighborhood semantics for first-order modal logic, applications in game theory ; applications in epistemic logic ; and non-normal modal logics with dynamic modalities. The book can be used as the primary text for seminars on philosophical logic focused on non-normal modal logics; as a supplemental text for courses on modal logic, logic in AI, or philosophical logic ; or as the primary source for researchers interested in learning about the uses of neighborhood semantics in philosophical logic and game theory. (shrink)

This book provides a detailed exposition of one of the most practical and popular methods of proving theorems in logic, called Natural Deduction. It is presented both historically and systematically. Also some combinations with other known proof methods are explored. The initial part of the book deals with Classical Logic, whereas the rest is concerned with systems for several forms of Modal Logics, one of the most important branches of modern logic, which has wide applicability.

Presenting the first comprehensive, in-depth study of hyperintensionality, this book equips readers with the basic tools needed to appreciate some of current and future debates in the philosophy of language, semantics, and metaphysics. After introducing and explaining the major approaches to hyperintensionality found in the literature, the book tackles its systematic connections to normativity and offers some contributions to the current debates. The book offers undergraduate and graduate students an essential introduction to the topic, while also helping professionals in related (...) fields get up to speed on open research-level problems. (shrink)

This book develops a novel generalization of possible world semantics, called ‘world line semantics’, which recognizes worlds and links between world-bound objects (world lines) as mutually independent aspects of modal semantics. Addressing a wide range of questions vital for contemporary debates in logic and philosophy of language and offering new tools for theoretical linguistics and knowledge representation, the book proposes a radically new paradigm in modal semantics. This framework is motivated philosophically, viewing a structure of world lines as a precondition (...) of modal talk. The author provides a uniform analysis of quantification over individuals (physical objects) and objects of thought (intentional objects). The semantic account of what it means to speak of intentional objects throws new light on accounts of intentionality and singular thought in the philosophy of mind and offers novel insights into the semantics of intensional transitive verbs. (shrink)

Nested sequent systems for modal logics are a relatively recent development, within the general area known as deep reasoning. The idea of deep reasoning is to create systems within which one operates at lower levels in formulas than just those involving the main connective or operator. Prefixed tableaus go back to 1972, and are modal tableau systems with extra machinery to represent accessibility in a purely syntactic way. We show that modal nested sequents and prefixed modal tableaus are notational variants (...) of each other, roughly in the same way that tableaus and Gentzen sequent calculi are notational variants. This immediately gives rise to new modal nested sequent systems which may be of independent interest. We discuss some of these, including those for some justification logics that include standard modal operators. (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)

We generalize two well-known model-theoretic characterization theorems from propositional modal logic to first-order modal logic. We first study FML-definable frames and give a version of the Goldblatt–Thomason theorem for this logic. The advantage of this result, compared with the original Goldblatt–Thomason theorem, is that it does not need the condition of ultrafilter reflection and uses only closure under bounded morphic images, generated subframes and disjoint unions. We then investigate Lindström type theorems for first-order modal logic. We show that FML has (...) the maximal expressive power among the logics extending FML which satisfy compactness, bisimulation invariance and the Tarski union property. (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)

Michael Dummett argues, against Saul Kripke, that there could have been unicorns. He then claims that this possibility shows that the logic of metaphysical modality is not S5, and, in particular, that the B axiom is false. Dummett’s argument against B, however, is invalid. I show that although there are number of ways to repair Dummett’s argument against B, each requires a controversial metaphysical or semantic commitment, and that, regardless of this, the case against B is undermotivated. Dummett’s case is (...) still of interest, however, as if his assumptions are correct, S5 has to go, with the natural culprit being S4. (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.

Classical modalism about essence is the view that essence can be analysed in modal terms. Despite Kit Fine's influential critique, no general refutation of classical modalism has yet been given. In the first part of the paper, I provide such a refutation by showing that the notion of essence cannot be analysed in terms of any sentential operator definable in the language of standard quantified modal logic. As a reaction to Fine's critique, some have defended sophisticated modalism, which attempts to (...) analyse essence in an enriched modal language quantifying over both possible and impossible worlds. In the second part of the paper, I argue that sophisticated modalism falls prey to variations on Fine's counterexamples to classical modalism. I conclude that the most promising approaches to understanding the notion of essence consist in taking essence either as primitive or as analysable via a combination of modal and non-modal notions. (shrink)

I introduce and defend the semantic notion of counterfactual identity, distinguishing it from the metaphysical notion of transworld identity. After showing that Lewis's counterpart theory misconstrues counterfactual identity facts, I outline and motivate a ‘Leibnizian counterpart theory’ where the notion of counterfactual identity is adequately modelled. Finally, I show that counterfactual identity can be characterized without relying on some implausible features of Lewis's theory of conditionals.

It has been argued that a combination of game-theoretic semantics and independence-friendly (IF) languages can provide a novel approach to the conceptual foundations of mathematics and the sciences. I introduce and motivate an IF first-order modal language endowed with a game-theoretic semantics of perfect information. The resulting interpretive independence-friendly logic (IIF) allows to formulate some basic model-theoretic notions that are inexpressible in the ordinary quantified modal logic. Moreover, I argue that some key concepts of Kripke’s new theory of reference are (...) adequately modeled within IIF. Finally, I compare the logic IIF to David Lewis' counterpart theory, drawing some morals concerning the interrelation between metaphysical and semantic issues in possible-world semantics. (shrink)

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)

The Thousands of Problems for Theorem Provers (TPTP) World is a well-established infrastructure that supports research, development and deployment of automated theorem proving systems. This paper provides an overview of the logic languages of the TPTP World, from classical first-order form (FOF), through typed FOF, up to typed higher-order form, and beyond to non-classical forms. The logic languages are described in a non-technical way and are illustrated with examples using the TPTP language.

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)

Is a logicist bound to the claim that as a matter of analytic truth there is an actual infinity of objects? If Hume’s Principle is analytic then in the standard setting the answer appears to be yes. Hodes’s work pointed to a way out by offering a modal picture in which only a potential infinity was posited. However, this project was abandoned due to apparent failures of cross-world predication. We re-explore this idea and discover that in the setting of the (...) potential infinite one can interpret first-order Peano arithmetic, but not second-order Peano arithmetic. We conclude that in order for the logicist to weaken the metaphysically loaded claim of necessary actual infinities, they must also weaken the mathematics they recover. (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)

Recently, interest has surged in similarity-based epistemologies of possibility. However, it has been pointed out that the notion of ‘relevant similarity’ is not properly developed in this literature. In this paper, I look at the research done in the field of analogical reasoning, where we find that one of the most promising ways of capturing relevance in similarity reasoning is by relying on the predictive analogy similarity relation. This takes relevant similarity to be based on shared properties that have structural (...) relations to the property of interest. I argue that if we base our epistemology of possibility on similarity reasoning on the predictive analogy similarity relation, we require prior knowledge of the specifics of these structural relations. I discuss a number of possible responses to this on behalf of the similarity theorists given their methodological approach to the epistemology of modality more generally. They could either opt for making explicit the metaphysics underlying these structural relations, in which case they need to spell out how we can come to know these relations. Or they could opt for developing a theory that explains why we do not need to have explicit knowledge of these structural relations; for example by suggesting that we make use of epistemic shortcuts. (shrink)

Recently, Yalcin (Epistemic modals. Mind, 116 , 983–1026, 2007) put forward a novel account of epistemic modals. It is based on the observation that sentences of the form ‘ & Might ’ do not embed under ‘suppose’ and ‘if’. Yalcin concludes that such sentences must be contradictory and develops a notion of informational consequence which validates this idea. I will show that informational consequence is inadequate as an account of the logic of epistemic modals: it cannot deal with reasoning from (...) uncertain premises. Finally, I offer an alternative way of explaining the relevant linguistic data. (shrink)

It is widely held that if an object a is identical (or non-identical) to an object b, then it is necessary that a is identical (non-identical) to b. This view is supported an argument from Leibniz's Law and a popular conception of de re modality. On the other hand, there are good reasons to allow for contingent identity. Various alternative accounts of de re modality have been developed to achieve this kind of generality, and to explain what is wrong with (...) the argument from Leibniz's Law. (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 epistemology of modality is gradually coming to play a central role in general discussions about modality. This paper is a contribution in this direction, in particular I draw a comparison between Lewis’s Modal realism and Timothy Williamson’s recent account of modality in terms of counterfactual thinking. In order to have criteria of evaluation, I also formulate four requirements which are supposed to be met by any theory of modality to be epistemologically adequate.

In this paper, the predicate counterparts, defined both axiomatically and semantically by means of Kripke frames, of the modal propositional logics $\textbf {GL}$, $\textbf {Grz}$, $\textbf {wGrz}$ and their extensions are considered. It is proved that the set of semantical consequences on Kripke frames of every logic between $\textbf {QwGrz}$ and $\textbf {QGL.3}$ or between $\textbf {QwGrz}$ and $\textbf {QGrz.3}$ is $\Pi ^1_1$-hard even in languages with three (sometimes, two) individual variables, two (sometimes, one) unary predicate letters, and a single (...) proposition letter. As a corollary, it is proved that infinite families of modal predicate axiomatic systems, based on the classical first-order logic and the modal propositional logics $\textbf {GL}$, $\textbf {Grz}$, $\textbf {wGrz}$ are not Kripke complete. Both $\Pi ^1_1$-hardness and Kripke incompleteness results of the paper do not depend on whether the logics contain the Barcan formula. (shrink)

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)

The paper develops a set of quantified temporal alethic boulesic doxastic systems. Every system in this set consists of five parts: a ‘quantified’ part, a temporal part, a modal (alethic) part, a boulesic part and a doxastic part. There are no systems in the literature that combine all of these branches of logic. Hence, all systems in this paper are new. Every system is defined both semantically and proof-theoretically. The semantic apparatus consists of a kind of$$T \times W$$T×Wmodels, and the (...) proof-theoretical apparatus of semantic tableaux. The ‘quantified part’ of the systems includes relational predicates and the identity symbol. The quantifiers are, in effect, a kind of possibilist quantifiers that vary over every object in the domain. The tableaux rules are classical. The alethic part contains two types of modal operators for absolute and historical necessity and possibility. According to ‘boulesic logic’ (the logic of the will), ‘willing’ (‘consenting’, ‘rejecting’, ‘indifference’ and ‘non-indifference’) is a kind of modal operator. Doxastic logic is the logic of beliefs; it treats ‘believing’ (and ‘conceiving’) as a kind of modal operator. I will explore some possible relationships between these different parts, and investigate some principles that include more than one type of logical expression. I will show that every tableau system in the paper is sound and complete with respect to its semantics. Finally, I consider an example of a valid argument and an example of an invalid sentence. I show how one can use semantic tableaux to establish validity and invalidity and read off countermodels. These examples illustrate the philosophical usefulness of the systems that are introduced in this paper. (shrink)

In this paper, I will develop a set of boulesic-doxastic tableau systems and prove that they are sound and complete. Boulesic-doxastic logic consists of two main parts: a boulesic part and a doxastic part. By ‘boulesic logic’ I mean ‘the logic of the will’, and by ‘doxastic logic’ I mean ‘the logic of belief’. The first part deals with ‘boulesic’ concepts, expressions, sentences, arguments and theorems. I will concentrate on two types of boulesic expression: ‘individual x wants it to be (...) the case that’ and ‘individual x accepts that it is the case that’. The second part deals with ‘doxastic’ concepts, expressions, sentences, arguments and theorems. I will concentrate on two types of doxastic expression: ‘individual x believes that’ and ‘it is imaginable to individual x that’. Boulesic-doxastic logic investigates how these concepts are related to each other. Boulesic logic is a new kind of logic. Doxastic logic has been around for a while, but the approach to this branch of logic in this paper is new. Each system is combined with modal logic with two kinds of modal operators for historical and absolute necessity and predicate logic with necessary identity and ‘possibilist’ quantifiers. I use a kind of possible world semantics to describe the systems semantically. I also sketch out how our basic language can be extended with propositional quantifiers. All the systems developed in this paper are new. (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)

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.

Putting individual constants and quantifiers into the same syntactic category within first-order language promises to have far-reaching consequences: a syntax of this kind can reveal the potential of any such language, allowing us to realize that a vast class of noun phrases, including non-denoting terms, can be accommodated in the new syntax as expressions suited to being subjects of sentences. In the light of this, a formal system that is an extension of classical first-order logic is developed here, and is (...) equipped with an appropriate semantics. An ontological interpretation of the new logic is then also provided, with several categories of object and notions of existence being distinguished. Last but not least, a modal version of the logic, with some interesting formal features, is proposed. (shrink)

This essay introduces a puzzle about the interaction between quantifiers and epistemic modals. The puzzle motivates the idea that whether an object satisfies an epistemically modalized predicate depends on the mode of presentation of the domain of quantification. I compare two ways of implementing this idea, one using counterpart theory, the other using Aloni's 'conceptual covers' theory, and then provides some evidence in favor of the former.

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.

Peter Wason provided his four-card selection task over five decades ago. It keeps causing difficulties from both the linguistic, the psychological, and the cognitive point of view. Many psychology theories have been proposed in order to remove its problems. This paper tries to offer one more possible account. That account is based on the method of extension and intension presented by Rudolf Carnap. Hence, it resorts to the concept of state-description. The basic ideas of the argumentation are two: 1) people (...) might tend to consider state-descriptions when processing information, and 2) if conditionals are not expressed with a clear contextual framework, they might be interpreted as biconditionals. (shrink)

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 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.