In Kantian philosophy, the term “condition of possibility” is central, but carries the following ambiguity. According to one reading, “condition of possibility” merely means “necessary condition”. However, it is demonstrated that a deeper interpretation of the term “possibility” proves to be more fruitful. This reading allows us to reconstruct an important background assumption of Kant: Every condition of the possibility of experience holds necessarily, provided that experience is possible. Or more generally: All conditions of the possibility hold necessarily as long (...) as the conditioned is actually possible. -/- This conclusion is understood through the axiomatic system S5. Therefore I argue by referencing the schematism chapter that Kant’s notion of modal terms can be formalized through S5. (shrink)

We present a general approach to quantified modal logics that can simulate most other approaches. The language is based on operators indexed by terms which allow to express de re modalities and to control the interaction of modalities with the first-order machinery and with non-rigid designators. The semantics is based on a primitive counterpart relation holding between n-tuples of objects inhabiting possible worlds. This allows an object to be represented by one, many, or no object in an accessible world. Moreover (...) by taking as primitive a relation between n-tuples we avoid some shortcoming of standard individual counterparts. Finally, we use cut-free labelled sequent calculi to give a proof-theoretic characterisation of the quantified extensions of each first-order definable propositional modal logic. In this way we show how to complete many axiomatically incomplete quantified modal logics. (shrink)

The article deals with infinitary modal logic. We first discuss the difficulties related to the development of a satisfactory proof theory and then we show how to overcome these problems by introducing a labelled sequent calculus which is sound and complete with respect to Kripke semantics. We establish the structural properties of the system, namely admissibility of the structural rules and of the cut rule. Finally, we show how to embed common knowledge in the infinitary calculus and we discuss first-order (...) extensions of infinitary modal logic. (shrink)

dolce, the first top-level ontology to be axiomatized, has remained stable for twenty years and today is broadly used in a variety of domains. dolce is inspired by cognitive and linguistic considerations and aims to model a commonsense view of reality, like the one human beings exploit in everyday life in areas as diverse as socio-technical systems, manufacturing, financial transactions and cultural heritage. dolce clearly lists the ontological choices it is based upon, relies on philosophical principles, is richly formalized, and (...) is built according to well-established ontological methodologies, e.g. OntoClean. Because of these features, it has inspired most of the existing top-level ontologies and has been used to develop or improve standards and public domain resources. Being a foundational ontology, dolce is not directly concerned with domain knowledge. Its purpose is to provide the general categories and relations needed to give a coherent view of reality, to integrate domain knowledge, and to mediate across domains. In these 20 years dolce has shown that applied ontologies can be stable and that interoperability across reference and domain ontologies is a reality. This paper briefly introduces the ontology and shows how to use it on a few modeling cases. (shrink)

The Unified Foundational Ontology (UFO) was developed over the last two decades by consistently putting together theories from areas such as formal ontology in philosophy, cognitive science, linguistics, and philosophical logics. It comprises a number of micro-theories addressing fundamental conceptual modeling notions, including entity types and relationship types. The aim of this paper is to summarize the current state of UFO, presenting a formalization of the ontology, along with the analysis of a number of cases to illustrate the application of (...) UFO and facilitate its comparison with other foundational ontologies in this special issue. (The cases originate from the First FOUST Workshop – the Foundational Stance, an international forum dedicated to Foundational Ontology research.). (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)

This paper presents rules in sequent calculus for a binary quantifier I to formalise definite descriptions: Ix[F, G] means ‘The F is G’. The rules are suitable to be added to a system of positive free logic. The paper extends the proof of a cut elimination theorem for this system by Indrzejczak by proving the cases for the rules of I. There are also brief comparisons of the present approach to the more common one that formalises definite descriptions with a (...) term forming operator. In the final section rules for I for negative free and classical logic are also mentioned. (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)

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)

Kripke (1980) hypothesizes a link between rigidity and scope: a singular term is rigid over a space S of possibilities just in case it is scopeless with respect to modals that quantify over S. Kripke’s hypothesis works well when we consider the interaction of singular terms with metaphysical modals, but runs into trouble when we consider the interaction of singular terms with epistemic modals. After describing the trouble in detail, and considering one non-solution to it, I develop a novel version (...) of dynamic semantics that resolves the problem. (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)

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.

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)

In this paper we examine Prior’s reconstruction of Master Argument [4] in some modal-tense logic. This logic consists of a purely tense part and Diodorean definitions of modal alethic operators. Next we study this tense logic in the pure tense language. It is the logic K t 4 plus a new axiom ( P ): ‘ p Λ G p ⊃ P G p ’. This formula was used by Prior in his original analysis of Master Argument. ( P ) (...) is usually added as an extra axiom to an axiomatization of the logic of linear time. In that case the set of moments is a total order and must be left-discrete without the least moment. However, the logic of Master Argument does not require linear time. We show what properties of the set of moments are exactly forced by ( P ) in the reconstruction of Prior. We make also some philosophical remarks on the analyzed reconstruction. (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)

We describe a general logical framework, Justification Logic, for reasoning about epistemic justification. Justification Logic is based on classical propositional logic augmented by justification assertions t: F that read t is a justification for F. Justification Logic absorbs basic principles originating from both mainstream epistemology and the mathematical theory of proofs. It contributes to the studies of the well-known Justified True Belief vs. Knowledge problem. We state a general Correspondence Theorem showing that behind each epistemic modal logic, there is a (...) robust system of justifications. This renders a new, evidence-based foundation for epistemic logic. As a case study, we offer a resolution of the GoldmanRed Barns in Justification Logic. Furthermore, we formalize the well-known Gettier example and reveal hidden assumptions and redundancies in Gettier’s reasoning. (shrink)

The literature on quantum logic emphasizes that the algebraic structures involved with orthodox quantum mechanics are non distributive. In this paper we develop a particular algebraic structure, the quasi-lattice ( $${\mathfrak{I}}$$ -lattice), which can be modeled by an algebraic structure built in quasi-set theory $${\mathfrak{Q}}$$. This structure is non distributive and involve indiscernible elements. Thus we show that in taking into account indiscernibility as a primitive concept, the quasi-lattice that ‘naturally’ arises is non distributive.

In this paper, we discuss formal reconstructions of Anselm’s ontological argument. We first present a number of requirements that any successful reconstruction should meet. We then offer a detailed preparatory study of the basic concepts involved in Anselm’s argument. Next, we present our own reconstructions—one in modal logic and one in classical logic—and compare them with each other and with existing reconstructions from the reviewed literature. Finally, we try to show why and how one can gain a better understanding of (...) Anselm’s argument by using modern formal logic. In particular, we try to explain why formal reconstructions of the argument, despite its apparent simplicity, tend to become quite involved. (shrink)

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)

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)

This paper examines causal theories of reference with respect to how plausible an account they give of non-physical natural kind terms such as ‘gene’ as well as of the truth of the associated theoretical claims. I first show that reference fixism for ‘gene’ fails. By this, I mean the claim that the reference of ‘gene’ was stable over longer historical periods, for example, since the classical period of transmission genetics. Second, I show that the theory of partial reference does not (...) do justice to some widely held realist intuitions about classical genetics. This result is at loggerheads with the explicit goals usually associated with partial theories of reference, which is to defend a realist semantics for scientific terms. Thirdly, I show that, contrary to received wisdom and perhaps contrary to physics and chemistry, neither reference fixism nor partial reference are necessary in order to hold on to scientific realism about biology. I pinpoint the reasons for this in the nature of biological kinds, which do not even remotely resemble natural kinds (i.e., Lockean real essences) as traditionally conceived. (shrink)

In 'Fiction and Fictionalism', Mark Sainsbury has recently dubbed “Selection Problem” a serious trouble for Meinongian object theories. Typically, Meinongianism has been phrased as a kind of realism on nonexistent objects : these are mind-independent things, not mental simulacra, having the properties they have independently from the activity of any cognitive agent. But how can one single out an object we have no causal acquaintance with, and which is devoid of spatiotemporal location, picking it out from a pre-determined, mind-independent set (...) ? In this paper, I set out a line of response by distinguishing different ways in which a thing may not exist. I show that the selection problem (a) does not arise for past, currently nonexistent objects ; (b) may not arise also for future existents (provided one massages naïve intuitions a bit) ; and (c) even for mere possibilia ; but (d) is a real snag for purely fictional objects, such as Holmes or Gandalf. As for (d), I propose a solution that forces Meinongianism to introduce a kind of ontological dependence of purely fictional nonexistents upon existents. The strategy complicates the intuitively simple, naïve Meinongian framework a bit, but looks quite promising. (shrink)

This paper has two purposes: the first is to critically examine Kripke’s well-known arguments against Descriptivism and suggest that they are not as decisive as many have thought; the second is to argue that proper names do encode descriptive information of various kinds, that such information may be truth-conditionally significant, and hence that a name’s truth-conditional contribution is not limited to its referent.

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.

We present an embedding of quantified multimodal logics into simple type theory and prove its soundness and completeness. A correspondence between QKπ models for quantified multimodal logics and Henkin models is established and exploited. Our embedding supports the application of off-the-shelf higher-order theorem provers for reasoning within and about quantified multimodal logics. Moreover, it provides a starting point for further logic embeddings and their combinations in simple type theory.

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)

For various reasons several authors have enriched classical first order syntax by adding a predicate abstraction operator. “Conservatives” have done so without disturbing the syntax of the formal quantifiers but “revisionists” have argued that predicate abstraction motivates the universal quantifier’s re-classification from an expression that combines with a variable to yield a sentence from a sentence, to an expression that combines with a one-place predicate to yield a sentence. My main aim is to advance the cause of predicate abstraction while (...) cautioning against revisionism. In so doing, however, I shall pursue a secondary aim by conveying mixed blessings to those who hold the view that in the logical sense of “existence” some existing object is such as to exist contingently. Advocates of this view must concede Williamson’s recent contention that the domain of unrestricted objectual quantification could not have been narrower than it is actually, but predicate abstraction affords them some hope of accommodating this concession. (shrink)

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)

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.

The paper focuses on extending to the first order case the semantical program for modalities first introduced by Dana Scott and Richard Montague. We focus on the study of neighborhood frames with constant domains and we offer in the first part of the paper a series of new completeness results for salient classical systems of first order modal logic. Among other results we show that it is possible to prove strong completeness results for normal systems without the Barcan Formula (like (...) FOL + K)in terms of neighborhood frames with constant domains. The first order models we present permit the study of many epistemic modalities recently proposed in computer science as well as the development of adequate models for monadic operators of high probability. Models of this type are either difficult of impossible to build in terms of relational Kripkean semantics [40].We conclude by introducing general first order neighborhood frames with constant domains and we offer a general completeness result for the entire family of classical first order modal systems in terms of them, circumventing some well-known problems of propositional and first order neighborhood semantics (mainly the fact that many classical modal logics are incomplete with respect to an unmodified version of either neighborhood or relational frames). We argue that the semantical program that thus arises offers the first complete semantic unification of the family of classical first order modal logics. (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.

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)

Noneism a is form of Meinongianism, proposed by Richard Routley and developed and improved by Graham Priest in his widely discussed book Towards Non-Being. Priest's noneism is based upon the double move of building a worlds semantics including impossible worlds, besides possible ones, and admitting a new comprehension principle for objects, differerent from the ones proposed in other kinds of neo-Meinongian theories, such as Parsons' and Zalta's. The new principle has no restrictions on the sets of properties that can deliver (...) objects, but parameterizes the having of properties by objects to worlds. Modality is therefore explicitly built in - so the approach can be conveniently labeled as "modal noneism". In this paper, I put modal noneism to work by testing it against classical issues in modal logic and semantics. It turns out that - perhaps surprisingly - the theory performs well in problems of transworld identity, which are frequently considered to be the difficult ones in the literature; faces a limitation, albeit not a severe one, when one comes to transworld individuation, which is often taken as an easy issue, if not a pseudo-problem; and may stumble upon a real trouble when dealing with what I shall call 'extensionally indiscernible entities' - particular nonexistent objects modal noneism is committed to. (shrink)

There is a core to the referential/attributive distinction that reveals a propositional ambiguity that is scope-related and rooted in syntax.

While standard first-order modal logic is quite powerful, it cannot express even very simple sentences like “I could have been taller than I actually am” or “Everyone could have been smarter than they actually are”. These are examples of cross-world predication, whereby objects in one world are related to objects in another world. Extending first-order modal logic to allow for cross-world predication in a motivated way has proven to be notoriously difficult. In this paper, I argue that the standard accounts (...) of cross-world predication all leave something to be desired. I then propose an account of cross-world predication based on quantified hybrid logic and show how it overcomes the limitations of these previous accounts. I will conclude by discussing various philosophical consequences and applications of such an account. (shrink)

Can we find propositions that cannot rationally be denied in any possible world without assuming the existence of that same proposition, and so involving ourselves in a contradiction? In other words, can we find transworld propositions needing no further foundation or justification? Basically, three differing positions can be imagined: firstly, a relativist position, according to which ultimately founded propositions are impossible; secondly, a meta-relativist position, according to which ultimately founded propositions are possible but unnecessary; and thirdly, an absolute position, according (...) to which such propositions are necessary. In this short essay I show that under the premise of modal logic S5 with constant domain there are ultimately founded propositions and that their existence is even necessary, and I will give some reasons for the superiority of S5 over other logics. (shrink)

This article opposes a view widely accepted in studies concerning the history of modal logic, according to which (i) the approach of C. I. Lewis towards constructing modern modal logic was purely syntactical (i.e. limited to the construction of axiomatic systems S1-S5 of propositional modal logic), and (ii) the notion of a possible world was incorporated into modern logic and philosophy mainly by authors such as Rudolf Carnap and Saul Kripke. The article presents Lewis' definition of a possible world, and (...) his formulation of the truth-conditions of statements containing strict implication as their main connective in terms of possible worlds. The main question of the article is whether it is possible to consider Lewis' work in this area as an early stage of the development of possible world semantics, and if so, in what sense? The article concludes by answering affirmatively, due to soundness and completeness proofs with respect to S5 using Lewis' semantics. (shrink)

In 2003 Zia Movahed pointed to a passage of Avicenna, written probably in 1022, which Movahed claimed anticipated the modal formula of Barcan (that ‘For every |$x$| necessarily |$\phi $|’ entails ‘Necessarily for every |$x$||$\phi $|’), and its converse. Since 2003, examination of early logical writings of Avicenna has clarified how he understood entailments between modal sentences, using his own new temporal language to provide a kind of semantics. In the light of that, Movahed’s claim for the Barcan formula needs (...) some tidying up but is basically correct. But by his semantics Avicenna should not have claimed the converse Barcan formula and probably didn’t claim it. (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 we present tableau methods for two-dimensional modal logics. Although models for such logics are well known, proof systems remain rather unexplored as most of their developments have been purely axiomatic. The logics herein considered contain first-order quantifiers with identity, and all the formulas in the language are doubly-indexed in the proof systems, with the upper indices intuitively representing the actual or reference worlds, and the lower indices representing worlds of evaluation—first and second dimensions, respectively. The tableaux modulate (...) over different notions of validity such as local, general, and diagonal, besides being general enough for several two-dimensional logics proposed in the literature. We also motivate the introduction of a new operator into two-dimensional languages and explore some of the philosophical questions raised by it concerning the relations there are between actuality, necessity, and the a priori, that seem to undermine traditional intuitive interpretations of two-dimensional operators. (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)

A new deontic logic, Action Type Deontic Logic, is presented. To motivate this logic, a number of benchmark cases are shown, representing inferences a deontic logic should validate. Some of the benchmark cases are singled out for further comments and some formal approaches to deontic reasoning are evaluated with respect to the benchmark cases. After that follows an informal introduction to the ideas behind the formal semantics, focussing on the distinction between action types and action tokens. Then the syntax and (...) semantics of Action Type Deontic Logic is presented and it is shown to meet the benchmarks. Finally, possibilities for further research are indicated. In the appendix, decidability of the satisfiability of formulas is proved via a technique known from monadic First Order Logic. (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 paper, I present and motivate a modal set theory consistent with the idea that there is only one size of infinity.

Conditional logics were originally developed for the purpose of modeling intuitively correct modes of reasoning involving conditional—especially counterfactual—expressions in natural language. While the debate over the logic of conditionals is as old as propositional logic, it was the development of worlds semantics for modal logic in the past century that catalyzed the rapid maturation of the field. Moreover, like modal logic, conditional logic has subsequently found a wide array of uses, from the traditional (e.g. counterfactuals) to the exotic (e.g. conditional (...) obligation). Despite the close connections between conditional and modal logic, both the technical development and philosophical exploitation of the latter has outstripped that of the former, with the result that noticeable lacunae exist in the literature on conditional logic. My dissertation addresses a number of these underdeveloped frontiers, producing new technical insights and philosophical applications. -/- I contribute to the solution of a problem posed by Priest of finding sound and complete labeled tableaux for systems of conditional logic from Lewis' V-family. To develop these tableaux, I draw on previous work on labeled tableaux for modal and conditional logic; errors and shortcomings in recent work on this problem are identified and corrected. While modal logic has by now been thoroughly studied in non-classical contexts, e.g. intuitionistic and relevant logic, the literature on conditional logic is still overwhelmingly classical. Another contribution of my dissertation is a thorough analysis of intuitionistic conditional logic, in which I utilize both algebraic and worlds semantics, and investigate how several novel embedding results might shed light on the philosophical interpretation of both intuitionistic logic and conditional logic extensions thereof. -/- My dissertation examines deontic and connexive conditional logic as well as the underappreciated history of connexive notions in the analysis of conditional obligation. The possibility of interpreting deontic modal logics in such systems (via embedding results) serves as an important theoretical guide. A philosophically motivated proscription on impossible obligations is shown to correspond to, and justify, certain (weak) connexive theses. Finally, I contribute to the intensifying debate over counterpossibles, counterfactuals with impossible antecedents, and take—in contrast to Lewis and Williamson—a non-vacuous line. Thus, in my view, a counterpossible like "If there had been a counterexample to the law of the excluded middle, Brouwer would not have been vindicated" is false, not (vacuously) true, although it has an impossible antecedent. I exploit impossible (non-normal) worlds—originally developed to model non-normal modal logics—to provide non-vacuous semantics for counterpossibles. I buttress the case for non-vacuous semantics by making recourse to both novel technical results and theoretical considerations. (shrink)

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)