This Element defends a reading of Kant's formulas of the moral law in Groundwork of the Metaphysics of Morals. It disputes a long tradition concerning what the first formula attempts to do. The Element also expounds the Formulas of Humanity, Autonomy and the Realm of Ends, arguing that it is only the Formula of Humanity from which Kant derives general duties, and that it is only the third formula that represents a complete and definitive statement of the moral (...) principle as Kant derives it in the Groundwork. The Element also disputes the claim that the various formulas are 'equivalent', arguing that this claim is either false or else nonsensical because it is grounded on a false premise about what Kant thinks a moral principle is for. (shrink)

Related Works: Part I: Michael Zakharyaschev. Canonical Formulas for $K4$. Part I: Basic Results. J. Symbolic Logic, Volume 57, Issue 4 , 1377--1402. Project Euclid: euclid.jsl/1183744119 Part III: Michael Zakharyaschev. Canonical Formulas for K4. Part III: The Finite Model Property. J. Symbolic Logic, Volume 62, Issue 3 , 950--975. Project Euclid: euclid.jsl/1183745306.

We propose a generalization of Sahlqvist formulas to polyadic modal languages by representing such languages in a combinatorial PDL style and thus, in particular, developing what we believe to be the right syntactic approach to Sahlqvist formulas at all. The class of polyadic Sahlqvist formulas PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.

Organic chemists have been able to develop a robust, theoretical understanding of the phenomena they study; however, the primary theoretical devices employed in this field are not mathematical equations or laws, as is the case in most other physical sciences. Instead it is diagrams, and in particular structural formulas and potential energy diagrams, that carry the explanatory weight in the discipline. To understand how this is so, it is necessary to investigate both the nature of the diagrams employed in (...) organic chemistry and how these diagrams are used in the explanations of the discipline. I will begin this paper by characterizing some of the major ways that structural formulas used in organic chemistry. Next I will present a model of the explanations in organic chemistry and describe how both structural formulas and potential energy diagrams contribute to these explanations. This will be followed by several examples that support my abstract account of the role of diagrams in the explanations of organic chemistry. In particular, I will consider both the appeal to ‘hyperconjugation’ in the explanation of alkene stability and how the idea of ‘ring strain’ was developed to explain the relative stability of cyclic compounds. (shrink)

Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding—to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence (...) can be characterized by a formula of a simple syntactic form. (shrink)

A description of the free cyclic algebra over the variety of Solovay algebras, as well as over its pyramid locally finite subvarieties is given.

Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding—to the variable-free sentence obtained from it by replacing all quantifiers with multiple conjunctions and disjunctions. It follows that a safe sentence and the result of its grounding have the same stable models, and that stable models of a safe sentence (...) can be characterized by a formula of a simple syntactic form. (shrink)

Related Works: Part I: Michael Zakharyaschev. Canonical Formulas for $K4$. Part I: Basic Results. J. Symbolic Logic, Volume 57, Issue 4 , 1377--1402. Project Euclid: euclid.jsl/1183744119 Part II: Michael Zakharyaschev. Canonical Formulas for K4. Part II: Cofinal Subframe Logics. J. Symbolic Logic, Volume 61, Issue 2 , 421--449. Project Euclid: euclid.jsl/1183745008.

The Modal Predicate Calculus gives rise to issues surrounding the Barcan formulas, their converses, and necessary existence. I examine these issues by means of the Quantified Argument Calculus, a recently developed, powerful formal logic system. Quarc is closer in syntax and logical properties to Natural Language than is the Predicate Calculus, a fact that lends additional interest to this examination, as Quarc might offer a better representation of our modal concepts. The validity of the Barcan formulas and their (...) converses is shown by Quarc to be a result of the specific incorporation of quantification in the Predicate Calculus, and not as reflecting a feature of the interaction of quantification and modality more generally. Necessary existence is shown to follow from the identification, in the Predicate Calculus on its canonical interpretation, of particular quantification, ascription of existence and the ‘there is’ construction, three constructions which are distinguished in both Quarc and Natural Language. The issues surrounding the Barcan formulas, their converses and necessary existence are thus shown to be an artefact of a specific logic system, not an essential feature of our relevant modal concepts or of formal logic. (shrink)

Second-order logic and modal logic are both, separately, major topics of philosophical discussion. Although both have been criticized by Quine and others, increasingly many philosophers find their strictures uncompelling, and regard both branches of logic as valuable resources for the articulation and investigation of significant issues in logical metaphysics and elsewhere. One might therefore expect some combination of the two sorts of logic to constitute a natural and more comprehensive background logic for metaphysics. So it is somewhat surprising to find (...) that philosophical discussion of secondorder modal logic is almost totally absent, despite the pioneering contribution of Barcan. (shrink)

Related Works: Part I: Michael Zakharyaschev. Canonical Formulas for $K4$. Part I: Basic Results. J. Symbolic Logic, Volume 57, Issue 4, 1377--1402. Project Euclid: euclid.jsl/1183744119 Part II: Michael Zakharyaschev. Canonical Formulas for K4. Part II: Cofinal Subframe Logics. J. Symbolic Logic, Volume 61, Issue 2, 421--449. Project Euclid: euclid.jsl/1183745008.

We use connections between conjunctive game formulas and the theory of inductive definitions to define the notions of a coinductive formula and its approximations. Corresponding to the theory of conjunctive game formulas we develop a theory of coinductive formulas, including a covering theorem and a normal form theorem for many sorted languages. Applying both theorems and the results on "model interpolation" obtained in this paper, we prove a many-sorted interpolation theorem for ω 1 ω-logic, which considers interpolation (...) with respect to the language symbols, the quantifiers, the identity, and countably infinite conjunction and disjunction. (shrink)

In the predicate calculus, variables provide a flexible indexing service which selects the actual arguments to a predicate letter from among possible arguments that precede the predicate letter (in the parse of the formula). In the process of selection, the possible arguments can be permuted, repeated (used more than once), and skipped. If this service is withheld, so that arguments must be the immediately preceding ones, taken in the order in which they occur, the formula is said to be fluted. (...) Quine showed that if a fluted formula contains only homogeneous conjunction (conjoins only subformulas of equal arity), then the satisfiability of the formula is decidable. It remained an open question whether the satisfiability of a fluted formula without this restriction is decidable. This paper answers that question. (shrink)

Here, we provide a detailed description of the mutual relation of formulas with finite propositional variables p1, …, pm in modal logic S4. Our description contains more information on S4 than those given in Shehtman (1978) and Moss (2007); however, Shehtman (1978) also treated Grzegorczyk logic and Moss (2007) treated many other normal modal logics. Specifically, we construct normal forms, which behave like the principal conjunctive normal forms in the classical propositional logic. The results include finite and effective methods (...) to find a normal form equivalent to a given formula A by clarifying the behavior of connectives and giving a finite method to list all exact models. (shrink)

We characterize the modal logics of elementary classes of Kripke frames as precisely those modal logics that are axiomatized by modal axioms synthesized in a certain effective way from "quasi-positive" sentences of hybrid logic. These are pure positive hybrid sentences with arbitrary existential and relativized universal quantification over nominals. The proof has three steps. The first step is to use the known result that the modal logic of any elementary class of Kripke frames is also the modal logic of the (...) closure of this class under disjoint unions, generated subframes, bounded morphic images, and ultraroots. This latter class can be defined by the first-order sentences of a special syntactic form (called pseudo-equations by Goldblatt) that are valid in the former class. The second step is to translate these pseudo-equations into equivalent quasi-positive hybrid sentences. In the third and main step, we show that any quasi-positive sentence S generates an infinite set of modal formulas called "approximants," which together axiomatize a canonical modal logic that is sound and complete for the class of frames validating S. The proof is analogous to standard proofs of Sahlqvist's theorem. It generalizes to sets of quasi-positive sentences. The main result now follows. (shrink)

In 1995 Visser, van Benthem, de Jongh, and Renardel de Lavalette introduced NNIL-formulas, showing that these are exactly the formulas preserved under taking submodels of Kripke models. In this article we show that NNIL-formulas are up to frame equivalence the formulas preserved under taking subframes of frames, that NNIL-formulas are subframe formulas, and that subframe logics can be axiomatized by NNIL-formulas. We also define a new syntactic class of ONNILLI-formulas. We show that (...) these are the formulas preserved in monotonic images of frames and that ONNILLI-formulas are stable formulas as introduced by Bezhanishvili and Bezhanishvili in 2013. Thus, ONNILLI is a syntactically defined set of formulas axiomatizing all stable logics. This resolves a problem left open in 2013. (shrink)

In a paper on the logical work of the Jains, Graham Priest considers a consequence relation, semantically characterized, which has a natural analogue in modal logic. Here we give a syntactic/axiomatic description of the modal formulas which are consequences of the empty set by this relation, which is to say: those formulas which are, for every model, true at some point in that model.

We give alternative characterizations of exact, extendible and projective formulas in intuitionistic propositional calculus IPC in terms of n -universal models. From these characterizations we derive a new syntactic description of all extendible formulas of IPC in two variables. For the formulas in two variables we also give an alternative proof of Ghilardi’s theorem that every extendible formula is projective.

We propose a generalization of Sahlqvist formulae to polyadic modal languages by representing modal polyadic languages in a combinatorial style and thus, in particular, developing what we believe to be the right approach to Sahlqvist formulae at all. The class of polyadic Sahlqvist formulae PSF defined here expands essentially the so far known one. We prove first-order definability and canonicity for the class PSF.

We provide a new proof of the following Pałasińska's theorem: Every finitely generated protoalgebraic relation distributive equality free quasivariety is finitely axiomatizable. The main tool we use are ${\mathcal{Q}}$ Q -relation formulas for a protoalgebraic equality free quasivariety ${\mathcal{Q}}$ Q . They are the counterparts of the congruence formulas used for describing the generation of congruences in algebras. Having this tool in hand, we prove a finite axiomatization theorem for ${\mathcal{Q}}$ Q when it has definable principal ${\mathcal{Q}}$ Q (...) -subrelations. This is a property obtained by carrying over the definability of principal subcongruences, invented by Baker and Wang for varieties, and which holds for finitely generated protoalgebraic relation distributive equality free quasivarieties. (shrink)

The _play of formulas_ is a new theory designed to explain the manner in which discourses (Suttas, Sūtras) were composed in the early Buddhist tradition, focusing at present mainly on the _Dīgha-_ and _Majjhima- Nikāyas_ (the collections of the Buddha’s Long and Middle-length discourses). This theory combats the commonly accepted views that texts are mainly an attempt to record and preserve the Buddha’s teachings and life events, and that the best way to understand their history is to compare parallel versions (...) of them. By identifying the creative, mainly the literary, vectors alive in the shaping of the texts, the theory explains how discourses are the products of formulas, which themselves are the primary texts of early Buddhism. Formulas combine in order to produce meaningful textual patterns, with little account of historical context and with much interest in aesthetic appeal and emotive potency. Formulas connect according to set narrative designs, in which different types of audiences are represented not only through unique formulas, but also with their specific narrative trajectories and complementing doctrinal emphases. It is not that the early authors were not at all interested in safeguarding the tradition. It is only that there was much more going on, and that thinking about the texts in this way misses their entertaining faces and ignores their beauty. These probably tell us more about what the early discourses actually were for the people that first produced and studied them than dry philosophical doctrine. (shrink)

We generalize the theory of canonical formulas for K4, the logic of transitive frames, to wK4, the logic of weakly transitive frames. Our main result establishes that each logic over wK4 is axiomatizable by canonical formulas, thus generalizing Zakharyaschev’s theorem for logics over K4. The key new ingredients include the concepts of transitive and strongly cofinal subframes of weakly transitive spaces. This yields, along with the standard notions of subframe and cofinal subframe logics, the new notions of transitive (...) subframe and strongly cofinal subframe logics over wK4. We obtain axiomatizations of all four kinds of subframe logics over wK4. We conclude by giving a number of examples of different kinds of subframe logics over wK4. (shrink)

This paper studies the semiotic,epistemological and historical aspects of Berzelianformulas in early nineteenth-century organicchemistry. I argue that Berzelian formulas wereenormously productive `paper tools' for representingchemical reactions of organic substances, and forcreating different pathways of reactions. Moreover, myanalysis of Jean Dumas's application of Berzelianformulas to model the creation of chloral from alcoholand chlorine exemplifies the role played by chemicalformulas in conceptual development (the concept ofsubstitution). Studying the dialectic of chemists'collectively shared goals and tools, I argue thatpaper tools, like laboratory instruments, (...) areresources whose possibilities are not exhausted byscientists' attempts to achieve existing goals, butrather whose applications generate new goals. The term`paper tools' is introduced to emphasize that thepragmatic and syntactic aspects of symbol systems arefully comparable to physical laboratory tools. (shrink)

Se ha destacado recientemente que la Fórmula de Barcan y la Conversa de la Fórmula de Barcan para lógica modal cuantificacional de orden superior parecen válidas. Si se interpreta que los cuantificadores tienen como rango propiedades, la validez de y de orden superior parece implicar la existencia de universales trascendentes, esto es, universales que no requieren estar instanciados para existir en un mundo posible. Este trabajo discute esta línea de argumentación. En primer lugar, se sostiene que la semántica en la (...) que los resultados de validez se siguen no requiere que las ‘intensiones’ asignadas a las variables de orden superior estén instanciadas en un mundo posible para que la intensión exista ahí. El defensor de universales inmanentes objetaría esta suposición. En una semántica modificada, más neutral, y de orden superior ya no son válidas. En segundo lugar, se sostiene que, incluso si se concediese la validez de y de orden superior, no se obtendrían resultados metafísicos sustantivos, pues diferentes formas de nominalismo y diferentes teorías de tropos no tendrían dificultades en aceptar y de orden superior. (shrink)

If Y is normal with parameters μ and σ , the standard normal Z = ( Y - μ )/ σ has parameters and 1. Central Limit Theorem: For any sequence Y 1, Y 2, ... of IID random variables with expectation μ and variance σ , the cdf of Z is the limit, as n → ∞, of the cdf of ( Y 1 + Y 2 + … + Yn - nμ )/( σ √\x{D835}\x{DC5B}).

We give alternative characterizations of exact, extendible and projective formulas in intuitionistic propositional calculus IPC in terms of n-universal models. From these characterizations we derive a new syntactic description of all extendible formulas of IPC in two variables. For the formulas in two variables we also give an alternative proof of Ghilardi’s theorem that every extendible formula is projective.

The article defends three claims regarding the relation between the different formulas of the categorical imperative. On its prevailing reading, FUL gives different moral guidance than FH; left answered, this problem is an argument for adopting a competing perspective on FUL. The prohibitions and commands of the formulas should be taken to be extensionally the same; but FKE adds a dimension missing from the others, gained by uniting their perspectives, namely, bringing the variety of moral laws into systematic (...) unity. The grammatically ambiguous phrase inGMS, 4: 436.9–10 claims that FA alone unites the other formulas in itself. (shrink)

This chapter contains sections titled: Introduction Some Common Misunderstandings How Different Are PGW, FUL, and FLN? The Role of the Universal Law Formulas Issues Regarding the Maxim and its Universal Counterpart The Two Hegelian Objections Contradictions in Conception Contradictions in the Will Three Persistent Problems and One Very Modest Proposal Bibliography.

The goal of this paper is to generalize a notion of characteristic (or Jankov) formula by using finite partial Heyting algebras instead of the finite subdirectly irreducible algebras: with every finite partial Heyting algebra we associate a characteristic formula, and we study the properties of these formulas. We prove that any intermediate logic can be axiomatized by such formulas. We further discuss the correlations between characteristic formulas of finite partial algebras and canonical formulas. Then with every (...) well-connected Heyting algebra we associate a set of characteristic formulas that correspond to each finite relative subalgebra of this algebra. Finally, we demonstrate that in many respects these sets enjoy the same properties as regular characteristic formulas. In the last section we outline an approach how to generalize these obtained results to the broad classes of algebras. (shrink)