This paper shows that a collection of modal relevant logics are conservatively extended by the addition of Boolean negation.

If the language is extended by new individual variables, in classical first order logic, then the deduction system obtained is a conservative extension of the original one. This fails to be true for the logics with infinitary predicates. But it is shown that restricting the commutativity of quantifiers and the equality axioms in the extended system and supposing the merry-go-round property in the original system, the foregoing extension is already conservative. It is shown that these restrictions (...) are crucial for an extension to be conservative. The origin of the results is algebraic logic. (shrink)

In this paper we prove polyadic counterparts of the Hájek, Paris and Shepherdson's conservative extension theorems of Łukasiewicz predicate logic to rational Pavelka predicate logic. We also discuss the algebraic correspondents of the provability and truth degree for polyadic MV-algebras and prove a representation theorem similar to the one for polyadic Pavelka algebras.

The logic CE (for "Classical E") results from adding Boolean negation to Anderson and Belnap's logic E. This paper shows that CE is not a conservative extension of E.

This paper presents completeness and conservative extension results for the boolean extensions of the relevant logic T of Ticket Entailment, and for the contractionless relevant logics TW and RW. Some surprising results are shown for adding the sentential constant t to these boolean relevant logics; specifically, the boolean extensions with t are conservative of the boolean extensions without t, but not of the original logics with t. The special treatment required for the semantic normality of T is (...) also shown along the way. (shrink)

Exegesis, analysis and discussion of an argument deployed by Dana Scott in his 1973 paper ‘Background to Formalization’, rovide an ideal setting for getting clear about some subtleties in the apparently simple idea of conservative extension. There, Scott claimed in respect of two fundamental principles concerning implication that any generalized consequence relation respecting these principles is always extended conservatively by some similarly fundamental principles concerning conjunction and disjunction. This claim appears on the face of it to conflict with (...) cases in the literature in which adding principles governing conjunction or disjunction or both provides a non-conservative extension of the logic to which they are added, even if that logic does satisfy the intuitionistic conditions on implication. We explore the extent to which such cases can be transformed into counterexamples to Scott’s claim. Once one part of this claim is suitably disambiguated, we find no conflict after all, though we also find that Scott occasionally understates what the argument he provides in support of this claim actually establishes. The main goal, apart from getting straight about Scott’s argument, is to give an airing to various issues and distinctions in the general area of conservativity of extensions; as a side benefit, some semantic light will be thrown on a fragmentary intermediate logic of R. A. Bull, which A. N. Prior showed to be extended non-conservatively by the addition of conjunction, governed by the usual axioms. We will see exactly why, despite appearances, this is not a counterexample to Scott’s claim. (shrink)

Relevance logic is ordinarily seen as a subsystem of classical logic under the translation that replaces arrows by horseshoes. If, however, we consider the arrow as an additional connective alongside the horseshoe, then another perspective emerges: the theses of relevance logic, specifically the system R, may also be seen as the output of a conservative extension of the relation of classical consequence. We describe two ways in which this may be done. One is by defining a suitable closure (...) relation out of the set of theses of relevance logic; the other is by adding to the usual natural deduction system for it further rules with ‘projective constraints’, whose application restricts the subsequent application of other rules. The significance of the two constructions is also discussed. (shrink)

In this paper, we develop the system LZF of set theory with the unrestricted comprehension in full linear logic and show that LZF is a conservative extension of ZF– i.e., the Zermelo-Fraenkel set theory without the axiom of regularity. We formulate LZF as a sequent calculus with abstraction terms and prove the partial cut-elimination theorem for it. The cut-elimination result ensures the subterm property for those formulas which contain only terms corresponding to sets in ZF–. This implies that (...) LZF is a conservative extension of ZF– and therefore the former is consistent relative to the latter. (shrink)

In [1], D. W. Hart and C. Mcginn considered two logics Al and A2. These logics embody part of a tradition about a priori knowledge and necessity. They proved that A2 is a conservative extension of a well-known modal logic S5 but left the problem whether Al is a conservative extension of S4 open. In this note, we shall show that Al is not a conservative extension of S4 but of S5, and also correct (...) an inadequate proof. (shrink)

This paper aims to give a correct proof of Tait's conservative extension theorem. Tait's own proof is flawed in the sense that there are some invalid steps in his argument, and there is a counterexample to the main theorem from which the conservative extension theorem is supposed to follow. However, an analysis of Tait's basic idea suggests a correct proof of the conservative extension theorem and a corrected version of the main theorem.

Rational Pavelka logic extends Lukasiewicz infinitely valued logic by adding truth constants r̄ for rationals in [0, 1]. We show that this is a conservative extension. We note that this shows that provability degree can be defined in Lukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963.

We introduce two Gentzen-style sequent calculus axiomatizations for conservative extensions of basic propositional logic. Our first axiomatization is an ipmrovement of, in the sense that it has a kind of the subformula property and is a slight modification of. In this system the cut rule is eliminated. The second axiomatization is a classical conservative extension of basic propositional logic. Using these axiomatizations, we prove interpolation theorems for basic propositional logic.

Assuming the consistency ofZF + “There is an inaccessible number of inaccessibles”, we prove that Kelley Morse theory plus types is not a conservative extension of Kelley-Morse theory.

Rational Pavelka logic extends Lukasiewicz infinitely valued logic $by adding truth constants \bar{r} for rationals in [0, 1].$ We show that this is a conservative extension. We note that this shows that provability degree can be defined in Lukasiewicz logic. We also give a counterexample to a soundness theorem of Belluce and Chang published in 1963.

Section 1 recalls a point noted by A. N. Prior forty years ago: that a certain formula in the language of a purely implicational intermediate logic investigated by R. A. Bull is unprovable in that logic but provable in the extension of the logic by the usual axioms for conjunction, once this connective is added to the language. Section 2 reminds us that every formula is interdeducible with (i.e. added to intuitionistic logic, yields the same intermediate logic as) some (...) conjunction-free formula. Thus it would seem that any detour going via formulas with conjunction can be avoided, which raises a puzzle: how is this consistent with the point from Section 1? Sections 3 and 4 raise and discuss this puzzle. In fact, the puzzle turns out on closer inspection not to be so puzzling after all, but it does serve as a convenient centrepiece around which to organize a discussion of the phenomenon illustrated by the Bull–Prior example. Section 5 notes that Prior's observation can be extended to the case of the result of adding disjunction to Bull's logic, while Section 6 includes some further remarks aimed at diagnosing one source of possible residual puzzlement. A subtext of our discussion—spanning several of the notes—is that this work by Bull and Prior has been overlooked, their results having to be rediscovered, by many algebraists and logicians in more recent years. (shrink)

In this article, I present a semantically natural conservative extension of Urquhart’s positive semilattice logic with a sort of constructive negation. A subscripted sequent calculus is given for this logic and proofs of its soundness and completeness are sketched. It is shown that the logic lacks the finite model property. I discuss certain questions Urquhart has raised concerning the decision problem for the positive semilattice logic in the context of this logic and pose some problems for further research.

The principal result of this paper answers a long-standing question in the model theory of arithmetic [R. Kossak, J. Schmerl, The Structure of Models of Peano Arithmetic, Oxford University Press, 2006, Question 7] by showing that there exists an uncountable arithmetically closed family of subsets of the set ω of natural numbers such that the expansion of the standard model of Peano arithmetic has no conservative elementary extension, i.e., for any elementary extension of , there is a (...) subset of ω* that is parametrically definable in but whose intersection with ω is not a member of . We also establish other results that highlight the role of countability in the model theory of arithmetic. Inspired by a recent question of Gitman and Hamkins, we furthermore show that the aforementioned family can be arranged to further satisfy the curious property that forcing with the quotient Boolean algebra collapses 1 when viewed as a notion of forcing. (shrink)

In this paper we define an augmentation mHC of the Heyting propositional calculus HC by a modal operator ?. This modalized Heyting calculus mHC is a weakening of the Proof-Intuitionistic Logic KM of Kuznetsov and Muravitsky. In Section 2 we present a short selection of attractive (algebraic, relational, topological and categorical) features of mHC. In Section 3 we establish some close connections between mHC and certain normal extension K4.Grz of the modal system K4. We define a translation of mHC (...) into K4.Grz and prove that this translation is exact, i. e. theorem-preserving and deducibility-invariant. We have established (however, in this note we do not present a proof of this) that the lattice of all extensions of mHC is isomorphic to the lattice of normal extensions of K4.Grz (a generalization of the Kuznetsov and Muravitsky theorem). (shrink)

We formulate a Π1 sentence τ which is a version of the Tableau consistency of GlΔ0. The sentence τ is true and is provable in GlΔ0 + exp. We construct a model M of GlΔ0+Ω1+τ+BGs1 which has no proper end-extension to a model of GlΔ0+Ω1+τ. Also we prove that GlΔ0+Ω1+τ is not Π1 conservative over GlΔ0+τ.

Many relevant logics are conservatively extended by Boolean negation. Not all, however. This paper shows an acute form of non-conservativeness, namely that the Boolean-free fragment of the Boolean extension of a relevant logic need not always satisfy the variable-sharing property. In fact, it is shown that such an extension can in fact yield classical logic. For a vast range of relevant logic, however, it is shown that the variable-sharing property, restricted to the Boolean-free fragment, still holds for the (...) Boolean extended logic. (shrink)

I. WKL0 is a conservative extension of PRA for ’-0-2 sentences. II. ACA0 is a conservative extension of PA for arithmetic sentences. III. ATR0 is a conservative extension of IR for arithmetic sentences. IV. ’-1-1-CA0 is a conservative extension of ID(

Areas of Mathematics in Philosophy of Mathematics

 

Export citation  

 

Bookmark  

How can an enterprise, such as Sloterdijk defines in his You Must Change Your Life and its satellite The Art of Philosophy, be “Enlightenment-conservative”? That is the question leading these reflections on the key terms that contain both works in nuce – practice of course, but also perspective and retrospective, transition, extension, explicitation, turn, return, and quarter turn –, reflections that shed light on Sloterdijk’s non-revolutionary conception of Enlightenment as a continuing modernity, without postmodernity, but in need of (...) a curator, a conservateur, and that expose the ontologico-ethical question of the authoritative or sublime imperative (you must) in its Heideggerian, Nietzschean, and finally pseudo-Kantian, even apocalyptic tones, and in its attempt to preserve not only the Enlightenment, but the Renaissance and Antiquity at the same time. (shrink)

Certain translational T-schemes of the form True « f, where f can be almost any translation you like of f, will be a conservative extension of Peano arithmetic. I have an inkling that this means something philosophically, but I don’t understand my own inkling.

It is known that many relevant logics can be conservatively extended by the truth constant known as the Ackermann constant. It is also known that many relevant logics can be conservatively extended by Boolean negation. This essay, however, shows that a range of relevant logics with the Ackermann constant cannot be conservatively extended by a Boolean negation.

Certain translational T-schemes of the form True(“f”) « f(f), where f(f) can be almost any translation you like of f, will be a conservative extension of Peano arithmetic. I have an inkling that this means something philosophically, but I don’t understand my own inkling.

It is shown by Parsons [2] that the first-order fragment of Frege's logical system in the Grundgesetze der Arithmetic is consistent. In this note we formulate and prove a stronger version of this result for arbitrary first-order theories. We also show that a natural attempt to further strengthen our result runs afoul of Tarski's theorem on the undefinability of truth.

Many relevant logics can be conservatively extended by Boolean negation. Mares showed, however, that E is a notable exception. Mares’ proof is by and large a rather involved model-theoretic one. This paper presents a much easier proof-theoretic proof which not only covers E but also generalizes so as to also cover relevant logics with a primitive modal operator added. It is shown that from even very weak relevant logics augmented by a weak K-ish modal operator, and up to the strong (...) relevant logic R with a S5 modal operator, all fail to be conservatively extended by Boolean negation. The proof, therefore, also covers Meyer and Mares’ proof that NR—R with a primitive S4-modality added—also fails to be conservatively extended by Boolean negation. (shrink)

Conservation biology is a discipline with the explicit goal of protecting species from extinction. We examine how conservation biologists represent at-risk species, how they navigate values and ethical tensions in the discipline, and how they might be more effective in reaching conservation goals. While these topics are discussed in the literature, we offer a unique empirical examination of how individuals perceive and perform conservation work. We conducted 29 interviews with conservation biologists and found that most respondents viewed their work as (...) providing information but also felt that other species have intrinsic value and we should extend our ethical standards to include other species. However, many attempted to separate science from values, and some felt it was necessary to hide their values and ethical positions and avoid advocacy. While conservation biologists navigate these tensions differently, those who engage in advocacy will likely be more effective in reaching conservation goals. Current societal values and views on ethical extension, rather than a lack of science, represent the most significant impediment to addressing the extinction crisis. (shrink)

Few disputes in the annals of US environmentalism enjoy the pedigree of the conservation-preservation debate. Yet, although many scholars have written extensively on the meaning and history of conservation and preservation in American environmental thought and practice, the resonance of these concepts outside the academic literature has not been sufficiently examined. Given the significance of the ideals of conservation and preservation in the justification of environmental policy and management, however, we believe that a more detailed analysis of the real-world use (...) and understanding of these ideas is needed. In this paper, we describe the results of a qualitative, semantic study of the concepts of conservation and preservation undertaken in the context of the Chattahoochee National Forest (CNF), located in northern Georgia (USA). Thirty in-depth interviews were conducted with scientists and north Georgia residents either interested or involved in the future management of the forest. Respondents were asked to define conservation and preservation in their own words and to indicate which approach they felt was more appropriate for the management of the CNF. Qualitative content analysis was used to elicit a set of recurring themes for each foundational concept. Taken together, these themes help to flesh out the meaning of conservation and preservation for citizens and scientists today, and illustrate the evolving nature of two of the more significant and venerable ideas animating US environmental policy and management. (shrink)

The Society for American Archaeology (SAA) has developed an extensive body of ethics guidelines for its members, most actively in the last two decades. This coincides with the period in which the American Association for the Advancement of Science (AAAS) has taken a strong stand on the need for its affiliates to develop clear. enforceable codes of conduct. The ethics guidelines instituted by the SAA now realize the central recommendations of the AAAS, and in this they illustrate both the importance (...) and the limitations of these recommendations. (shrink)

This paper examines the conservative point of view about distributive justice. The first section explains the methodology used to develop this point of view. The second section describes one conservative point of view and briefly provides empirical evidence that it reflects the viewpoint of many ordinary conservatives. The third section explains how this conservative view can ground objections to social safety net programs, using as examples the recent health reform legislation and more extensive proposals for a true (...) national health system. The fourth section sketches ways that non-conservative philosophers might try to refute those objections. Examining a conservative point of view leads to several important conclusions. One is that the conservative point of view is not properly represented in contemporary philosophical discussions. Another is that the conservative point of view cannot be refuted by appealing to existing egalitarian writings. A third is that if progressive philosophers such as myself want to address the conservative point of view, we must expand the range of issues that we discuss in contemporary political philosophy. Doing so is a vital task, because otherwise we ignore the political views held by as much as half the American population. (shrink)

This paper brings together several strands of thought from both the analytic and phenomenological traditions in order to critically examine accounts of cognitive enhancement that rely on the idea of cognitive extension. First, I explain the idea of cognitive extension, the metaphysics of mind on which it depends, and how it has figured in recent discussions of cognitive enhancement. Then, I develop ideas from Husserl that emphasize the agential character of thought and the distinctive way that conscious thoughts (...) are related to one another. I argue that these considerations are necessary for understanding why forms of cognitive extension may diminish our cognitive lives in different ways. This does not lead to a categorical rejection of cognitive enhancement as unethical or bad for human flourishing, but does warrant a conservative approach to the design and implementation of cognitive artifacts. (shrink)

Constructive set theory a' la Myhill-Aczel has been extended in (Cantini and Crosilla 2008, Cantini and Crosilla 2010) to incorporate a notion of (partial, non--extensional) operation. Constructive operational set theory is a constructive and predicative analogue of Beeson's Inuitionistic set theory with rules and of Feferman's Operational set theory (Beeson 1988, Feferman 2006, Jaeger 2007, Jaeger 2009, Jaeger 1009b). This paper is concerned with an extension of constructive operational set theory (Cantini and Crosilla 2010) by a uniform operation of (...) Transitive Closure, \tau. Given a set a, \tau produces its transitive closure \tau a. We show that the theory ESTE of (Cantini and Crosilla 2010) augmented by \tau is still conservative over Peano Arithmetic. (shrink)

A well known theorem proved by J. Paris and H. Friedman states that BΣn +1 is a Πn +2-conservative extension of IΣn . In this paper, as a continuation of our previous work on collection schemes for Δn +1-formulas , we study a general version of this theorem and characterize theories T such that T + BΣn +1 is a Πn +2-conservative extension of T . We prove that this conservativeness property is equivalent to a model-theoretic (...) property relating Πn-envelopes and Πn-indicators for T . The analysis of Σn +1-collection we develop here is also applied to Σn +1-induction using Parsons' conservativeness theorem instead of Friedman-Paris' theorem.As a corollary, our work provides new model-theoretic proofs of two theorems of R. Kaye, J. Paris and C. Dimitracopoulos : BΣn +1 and IΣn +1 are Σn +3-conservative extensions of their parameter free versions, BΣ–n +1 and IΣ–n +1. (shrink)

The proofs of some results of abstract algebraic logic, in particular of the transfer principle of Czelakowski, assume the existence of so-called natural extensions of a logic by a set of new variables. Various constructions of natural extensions, claimed to be equivalent, may be found in the literature. In particular, these include a syntactic construction due to Shoesmith and Smiley and a related construction due to Łoś and Suszko. However, it was recently observed by Cintula and Noguera that both of (...) these constructions fail in the sense that they do not necessarily yield a logic. Here we show that whenever the Łoś–Suszko construction yields a logic, so does the Shoesmith–Smiley construction, but not vice versa. We also describe the smallest and the largest conservative extension of a logic by a set of new variables and show that contrary to some previous claims in the literature, a logic of cardinality \ may have more than one conservative extension of cardinality \ by a set of new variables. In this connection we then correct a mistake in the formulation of a theorem of Dellunde and Jansana. (shrink)

What philosophers have in mind when they think about vagueness are sorites cases. Unlike vague scientific or artificial expressions, however, vague natural language expressions do not display the kind of vagueness that we associate with the sorites; they rather display what I call cluster vagueness. A non-trivial consequence of this is that those legal definitions that state precisifications of natural language concepts not only add aspects of meaning to existing expressions but also effectively change the meanings of these expressions. From (...) this, in turn, it follows that we should avoid precisifying ordinary expressions with the help of legal definitions to the extent that we wish legal language to be in line with natural language. And being in line with natural language may help us to deal with gaps in our laws at the very moment we become aware of them, and not just afterwards. (shrink)

Over the last few decades Michael Dummett developed a rich program for assessing logic and the meaning of the terms of a language. He is also a major exponent of Frege's version of logicism in the philosophy of mathematics. Over the last decade, Neil Tennant developed an extensive version of logicism in Dummettian terms, and Dummett influenced other contemporary logicists such as Crispin Wright and Bob Hale. The purpose of this paper is to explore the prospects for Fregean logicism within (...) a broadly Dummettian framework. The conclusions are mostly negative: Dummett's views on analyticity and the logical/non-logical boundary leave little room for logicism. Dummett's considerations concerning manifestation and separability lead to a conservative extension requirement: if a sentence S is logically true, then there is a proof of S which uses only the introduction and elimination rules of the logical terms that occur in S. If basic arithmetic propositions are logically true-as the logicist contends-then there is tension between this conservation requirement and the ontological commitments of arithmetic. It follows from Dummett's manifestation requirements that if a sentence S is composed entirely of logical terminology, then there is a formal deductive system D such that S is analytic, or logically true, if and only if S is a theorem of D. There is a deep conflict between this result and the essential incompleteness, or as Dummett puts it, the indefinite extensibility, of arithmetic truth. (shrink)