SummaryThis paper develops a semantical account of sentences containing performative principal verbs in which these verbs are analyzed as indexical expressions: the proposition picked out by a sentence containing a performative verb depends on aspects of the context of use of the sentence; and these same aspects of context of use also determine the truth value of the proposition picked out. A two‐dimensional modal operator is utilized in analyzing non‐ performative sentences that contain principal verb which, in other contexts, have (...) performative uses. Thus, the analysis developed accounts for the performative — non‐performative distinction within a formal semantic‐pragmatic framework; the more common approach of relegating the distinction to the somewhat vague realm of ‘language use’ is avoided.RésuméCet article développe un traitement sémantique des phrases contenant un verbe principal performatif. Ces verbes sont analysés comme des expressions indicées: la proposition sélectionnée par une phrase contenant un verbe performatif dépend du contexte d'usage de cette phrase; et ces mêmes aspects du contexte d'usage déterminent également la valeur de vérité de la proposition sélectionnée. Un opérateur modal à deux dimensions est utilisé pour l'analyse de phrases non‐performatives contenant un verbe principal performatif dans d'autres contextes. L'analyse développée rend ainsi compte de la distinction performatif — non‐performatif dans un cadre sémantico‐pragmatique; on évite ainsi la solution habituelle consistant à reléguer cette distinction dans le domaine plutôt vague de l'usage linguistique.ZusammenfassungEs wird eine semantische Darstellung von Sätzen entwickelt, die performative Hauptverben enthalten, indem diese Verben als indexikale Ausdrücke analysiert werden: die Proposition, die durch einen Satz mit einem performativen Verb bezeichnet wird, hängt von Aspekten des Gebrauchskontextes des Satzes ab; und gerade diese Aspekte bestimmen auch den Wahrheitswert der Proposition. Ein zweidimensionaler Modaloperator wird verwendet, um nicht‐performative Sätze zu analysieren, die Hauptverben enthalten, welche — in andern Kontexten — einen performativen Gebrauch haben. Auf diese Weise gibt die entwickelte Analyse innerhalb eines formalen semantisch‐syntaktischen Rahmenwerkes Rechenschaft über die Unterscheidung performativ — nicht‐performativ; man vermeidet dadurch das übliche Vorgehen, die Unterscheidung in den etwas vagen Bereich des sog. 〈Sprachgebrauchs〉 abzuschieben. (shrink)

The operators of first-order logic, including negation, operate on whole formulae. This makes it unsuitable as a tool for the formal analysis of reasoning with non-sentential forms of negation such as predicate term negation. We extend its language with negation operators whose scope is more narrow than an atomic formula. Exploiting the usefulness of subatomic proof-theoretic considerations for the study of subatomic inferential structure, we define intuitionistic subatomic natural deduction systems which have several subatomic operators and an additional operator for (...) formula negation at their disposal. We establish normalization and subexpression property results for the systems. The normalization results allow us to formulate a proof-theoretic semantics for formulae composed of the subatomic operators. We illustrate the systems with applications to reasoning with combinations of sentential negation, predicate term negation, subject term negation, and antonymy. (shrink)

We present Prior's discussion of a puzzle about valditity found in the writings of the fourteenth-century French logician Jean Buridan and show how Prior's study of this puzzle may have provided the conceptual inspiration for his development of hybrid logic.

In Paradoxa Stoicorum, the Roman philosopher Cicero defends six important Stoic theses. Since these theses seem counterintuitive, and it is not likely that the average person would agree with them, they were generally called "paradoxes". According to the third paradox, (P3), (all) transgressions (wrong actions) are equal and (all) right actions are equal. According to one interpretation of this principle, which I will call (P3′), it means that if it is forbidden that A and it is forbidden that B, then (...) not-A is as good as not-B; and if it is permitted that A and it is permitted that B, then A is as good as B. In this paper, I show how it is possible to prove this thesis in dyadic deontic logic. I also try to defend (P3′) against some philosophical counterarguments. Furthermore, I address the claim that (P3′) is not a correct interpretation of Cicero’s third paradox and the assertion that it does not matter whether (P3′) is true or not. I argue that it does matter whether (P3′) is true or not, but acknowledge that (P3′) is perhaps a slightly different principle than Cicero’s thesis. The upshot is that (P3′) seems to be a plausible principle, and that at least one part of paradox III in Cicero’s Paradoxa Stoicorum appears to be defensible. (shrink)

The paper deals with the problem of axiomatizing a system T1 of discrete tense logic, where one thinks of time as the set Z of all the integers together with the operations +1 ("immediate successor") and-1 ("immediate predecessor"). T1 is like the Segerberg-Sundholm system WI in working with so-called infinitary inference ruldes; on the other hand, it differs from W I with respect to (i) proof-theoretical setting, (ii) presence of past tense operators and a "now" operator, and, most importantly, with (...) respect to (iii) the presence in T1 of so-called systematic frame constants, which are meant to hold at exactly one point in a temporal structure and to enable us to express the irreflexivity of such structures. Those frame constants will be seen to play a paramount role in our axiomatization of T1. (shrink)

The paper studies the relation between systems of modal logic and systems of consequential implication, a non-material form of implication satisfying "Aristotle's Thesis" (p does not imply not p) and "Weak Boethius' Thesis" (if p implies q, then p does not imply not q). Definitions are given of consequential implication in terms of modal operators and of modal operators in terms of consequential implication. The modal equivalent of "Strong Boethius' Thesis" (that p implies q implies that p does not imply (...) not q) is identified. (shrink)

The first section of the paper establishes the minimal properties of so-called consequential implication and shows that they are satisfied by at least two different operators of decreasing strength and \). Only the former has been analyzed in recent literature, so the paper focuses essentially on the latter. Both operators may be axiomatized in systems which are shown to be translatable into standard systems of normal modal logic. The central result of the paper is that the minimal consequential system for (...) \, CI\, is definitionally equivalent to the deontic system KD and is intertranslatable with the minimal consequential system for \, CI. The main drawback ot the weaker operator \ is that it lacks unrestricted contraposition, but the final section of the paper argues that \ has some properties which make it a valuable alternative to \, turning out especially plausible as a basis for the definition of operators representing synthetic conditionals. (shrink)

The basis of the paper is a logic of analytical consequential implication, CI.0, which is known to be equivalent to the well-known modal system KT thanks to the definition A → B = df A ⥽ B ∧ Ξ (Α, Β), Ξ (Α, Β) being a symbol for what is called here Equimodality Property: (□A ≡ □B) ∧ (◊A ≡ ◊B). Extending CI.0 (=KT) with axioms and rules for the so-called circumstantial operator symbolized by *, one obtains a system CI.0*Eq (...) in whose language one can define an operator ↠ suitable to formalize context-dependent conditionals (so to counterfactual conditionals) via the definition (Def ↠) A ↠ B = df *A ⥽ B ∧ Ξ (Α, Β).. The central problem of the paper is to identify inside CI.0*Eq + Def ↠ a set of axioms yielding the fragment consisting of all and only theorems in which only truth-functional operators and the two operators → and ↠ occur. This system, here called CI.0, is introduced in §3. In view of the intended purpose, it is introduced a complete and tableau-decidable system KTw, which is an extension of KT with axioms for the so-called quasi-variables w(A), w(B)… Three translation functions among the three languages used in the paper are then introduced. The first, Tr, maps every wff of form *A into wffs of form w(A) ∧ A and translates theorems of CI.0*Eq into theorems of KTw. The second, t°, translates theorems of CI.0 into theorems of CI.0*Eq by applying Def↠. A third one, t, translates theorems of CI.0 into theorems of KTw. As a consequence, it follows that t°A = TrtA. In §4 it is proved that CI.0 is complete w.r.t. the class of CI.0-models of form where f is a selection function and R an access relation. It is then proved (i) that CI.0 models may be converted into KTw-models; (ii) that the truth-value of a proposition in a world of a CI.0-model is preserved in the same world of the derived KTw-model; (iii) that A is a CI.0-thesis iff its translation tA is KTw-thesis. It follows that, if A is not a CI.0-thesis, tA is not a KTw-thesis, so also that TrtA is not a CI.0*Eq-thesis. Since t°A = TrtA and t°A is a function built on Def↠, this proves that every t°-translation of a CI.0-wff that is a CI.0*Eq-theorem is a CI.0-theorem. Since the converse proposition is proved in §2, their conjunction establishes the desired result. In the final section, it is proved that CI.0 is tableau-decidable, that ↠ is not a trivial operator and that ↠ enjoys the positive and negative properties required in §1 for context-dependent conditionals. Some final remarks suggest that studying the relations between CI.0 and systems of classical conditional logic may be a promising line of investigation. (shrink)

The main contribution of this paper is a completeness result for an axiomatization of Hansson [13]'s deontic system DSDL2, whose semantics involves a non-necessarily transitive betterness relation. Reference is made to a deductive system put forth by Åqvist [2, 3].

A person of average height would assert a truth by the conditional ‘if I were seven feet tall, I would be taller than I am,’ in which an indicative clause ‘I am’ is embedded in a subjunctive conditional. By contrast, no one would assert a truth by ‘if I were seven feet tall, I would be taller than I would be’ or ‘if I am seven feet tall, I am taller than I am’. These examples exemplify the fact that whether (...) a sentence's evaluation remains at the actual world in the scope of a modal or conditional depends on the combination of mood in the embedded and matrix clauses rather than, as is commonly thought, just on the presence of an operator ‘actually’. This essay argues that this phenomenon provides evidence that mood admits of bound and free readings along the lines of tenses and pronouns. It therefore favors the hypothesis that natural language contains variables and quantifiers for possible worlds in the object language. This, in turn, requires that the truth of a semantic value of a sentence (or whatever structure is embedded in a modal) be relativized to a sequence of worlds rather than to an individual world, and thus be distinguished from a proposition in the traditional sense. The essay also compares the framework defended with an alternative account of similar phenomena by Kai Wehmeier. (shrink)

This paper defends the thesis that counterfactuals are strict conditionals. Its purpose is to show that there is a coherent view according to which counterfactuals are strict conditionals whose antecedent is stated elliptically. Section 1 introduces the view. Section 2 outlines a response to the main argument against the thesis that counterfactuals are strict conditionals. Section 3 compares the view with a proposal due to Aqvist, which may be regarded as its direct predecessor. Sections 4 and 5 explain how the (...) view di ers from the theories of counterfactuals advocated by Stalnaker and Lewis, and from some contextualist strict conditional accounts of counterfactuals that have emerged recently. Finally, section 6 addresses the thorny issue of disjunctive antecedents. (shrink)

The picture of information acquisition as the elimination of possibilities has proven fruitful in many domains, serving as a foundation for formal models in philosophy, linguistics, computer science, and economics. While the picture appears simple, its formalization in dynamic epistemic logic reveals subtleties: given a valid principle of information dynamics in the language of dynamic epistemic logic, substituting complex epistemic sentences for its atomic sentences may result in an invalid principle. In this article, we explore such failures of uniform substitution. (...) First, we give epistemic examples inspired by Moore, Fitch, and Williamson. Second, we answer affirmatively a question posed by van Benthem: can we effectively decide when every substitution instance of a given dynamic epistemic principle is valid? In technical terms, we prove the decidability of this schematic validity problem for public announcement logic (PAL and PAL-RC) over models for finitely many fully introspective agents, as well as models for infinitely many arbitrary agents. The proof of this result illuminates the reasons for the failure of uniform substitution. (shrink)

Two-dimensional semantics, which can represent the distinction between a priority and necessity, has wielded considerable influence in the philosophy of language. In this paper, I axiomatize the dagger operator of Stalnaker’s “Assertion” in the formal context of two-dimensional modal logic. The language contains modalities of actuality, necessity, and a priority, but is also able to represent diagonalization, a conceptually important operation in a variety of contexts, including models of the relative a priori and a posteriori often appealed to Bayesian and (...) Gricean contexts. Finally, I sketch the prospects for extending this two-dimensional upgrade to other kinds of modal logics for natural language. (shrink)

In this paper, we axiomatize the deontic logic in Fusco (2015), which uses a Stalnaker-inspired account of diagonal acceptance and a two-dimensional account of disjunction to treat Ross’s Paradox and the Puzzle of Free Choice Permission. On this account, disjunction-involving validities are a priori rather than necessary. We show how to axiomatize two-dimensional disjunction so that the introduction/elimination rules for boolean disjunction can be viewed as one-dimensional projections of more general two-dimensional rules. These completeness results help make explicit the restrictions (...) Fusco’s account must place on free-choice inferences. They are also of independent interest, as they raise difficult questions about how to “lift” a Kripke frame for a one-dimensional modal logic into two dimensions. (shrink)

The paper introduces a first-order theory in the language of predicate tense logic which contains a single simple axiom. It is shewn that this theory enables times to be referred to and sentences involving ‘now’ and ‘then’ to be formalised. The paper then compares this way of increasing the expressive capacity of predicate tense logic with other mechanisms, and indicates how to generalise the results to other modal and tense systems.

The purpose of the paper is to present a logical framework that allow to formalize a kind of prima facie duties, defeasible conditional duties, indefeasible conditional duties and actual (indefeasible) duties, as well as to show their logical interconnections.

Two-dimensional (2D) semantics is a formal framework that is used to characterize the meaning of certain linguistic expressions and the entailment relations among sentences containing them. 2D semantics has also been applied to thought contents. In contrast with standard possible worlds semantics, 2D semantics assigns extensions and truth-values to expressions relative to two possible world parameters, rather than just one. So a 2D semantic framework provides finer-grained semantic values than those available within standard possible world semantics, while using the same (...) basic model-theoretic resources. The 2D framework itself is just a formal tool. To develop a semantic theory for someone’s language, a proponent of 2D semantics must do three things: (i) explain what exactly the two possible world parameters represent, (ii) explain the rules for assigning 2D semantic values to a person’s words and sentences, and (iii) explain how 2D semantic values help in understanding the meanings of the person’s words and sentences. (shrink)

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)

In the last papers published by Alchourrón, he attacked non-monotonic logics, which he considered philosophically unsound for the representation of defeasible reasoning. Instead of a non-monotonic consequence relation, he proposed a formal representation of defeasibility based on an AGM-like revision of implicit assumptions connected to the premises. Given that this is a procedure to generate non-monotonic logics, it is not clear, from a mathematical standpoint, why he was so suspicious of such logics. In the present paper we try to answer (...) this question based on Alchourrón' s convictions about epistemology, particularly the epistemology of law. We also propose another revision operator on theories called refinement, which provides a faithful representation of the sort of epistemic change considered by Alchourrón as intrinsic to defeasibility. En sus últimos escritos publicados, Alchourrón desarrolló un ataque contra las lógicas no-monotónicas, que consideraba filosóficamente inadecuadas a la representación del razonamiento derrotable. En vez de una relación de consecuencia no-monotónica, él propuso una representación formal de la derrotabilidad basada en un modelo de revisión de las asunciones implícitas ligadas a las premisas. Dado que éste es un procedimiento para generar lógicas no-monotónicas, no está claro -en el nivel matemático- por qué él era tan desconfiado de tales lógicas. En el presente texto intentamos contestar a esta pregunta basados en las convicciones de Alchourrón sobre epistemología, particularmente la epistemología jurídica. También proponemos otro operador de revisión aplicado a las teorías, llamado refinamiento, que proporciona una representación fiel de la especie de cambio epistémico considerado por Alchourrón como intrínseco a la derrotabilidad. (shrink)

Alchourrón devoted his last years to the analysis of the notion of defeasible conditionalization. He developed a formal system capturing the essentials of this notion. His definition of the defeasible conditional is given in terms of strict implication operator and a modal operator f which is interpreted as a revision function at the language level. In this paper, we will point out that this underlying revision function is more general than the well known AGM revision [4]. In addition, we will (...) give a complete characterization of that more general kind of revision and will show how permits to unify models of revision given by other authors. Alchourrón dedicó sus últimos años al análisis de la noción de condicionalización derrotable. Desarrolló un sistema formal que captura los aspectos esenciales de esta noción. Su definición de condicional revisable está dada en términos del operador de implicación estricta y un operador modal f el cual es interpretado en el nivel del lenguaje como una función de revisión. En este trabajo señalamos que la función de revisión subyacente es más general que la bien conocida función de revisión de AGM. Además, presentaremos una caracterización completa de una clase de revisión más general y mostraremos cómo nuestro modelo permite unificar los modelos de revisión propuestos por otros autores. (shrink)

Unlike standard modal logics, many dynamic epistemic logics are not closed under uniform substitution. A distinction therefore arises between the logic and its substitution core, the set of formulas all of whose substitution instances are valid. The classic example of a non-uniform dynamic epistemic logic is Public Announcement Logic (PAL), and a well-known open problem is to axiomatize the substitution core of PAL. In this paper we solve this problem for PAL over the class of all relational models with infinitely (...) many agents, PAL-K_omega, as well as standard extensions thereof, e.g., PAL-T_omega, PAL-S4_omega, and PAL-S5_omega. We introduce a new Uniform Public Announcement Logic (UPAL), prove completeness of a deductive system with respect to UPAL semantics, and show that this system axiomatizes the substitution core of PAL. (shrink)

A glass couldn't contain water unless it contained H2O-molecules. Likewise, a man couldn't be a bachelor unless he was unmarried. Now, the latter is what we would call a conceptual or analytical truth. It's also what we would call a priori. But it's hardly a conceptual or analytical truth that if a glass contains water, then it contains H2O-molecules. Neither is it a priori. The fact that water is composed of H2O-molecules was an empirical discovery made in the eighteenth century. (...) The fact that all bachelors are unmarried was not. But neither is a logical truth, so how do we explain the difference? Two-dimensional semantics is a framework that promises to shed light on these issues. The main purpose of this thesis is to understand and evaluate this framework in relation to various alternatives, to see whether some version of it can be defended. I argue that it fares better than the alternatives. However, much criticism of two-dimensionalism has focused on its alleged inability to provide a proper semantics for certain epistemic operators, in particular the belief operator and the a priori operator. In response to this criticism, a two-dimensional semantics for belief ascriptions is developed using structured propositions. In connection with this, a number of other issues in the semantics of belief ascriptions are addressed, concerning indexicals, beliefs de se, beliefs de re, and the problem of logical omniscience. (shrink)