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.

It is shown that there are exactly six normal DeMorgan monoids generated by the identity element alone. The free DeMorgan monoid with no generators but the identity is characterised and shown to have exactly three thousand and eighty-eight elements. This result solves the "Ackerman constant problem" of describing the structure of sentential constants in the logic R.

The aim of this paper is to provide a proof-theoretic characterization of relevant logics including fusion and fission connectives, as well as Ackermann’s truth constant. We achieve this by employing the well-established methodology of labelled sequent calculi. After having introduced several systems, we will conduct a detailed proof-theoretic analysis, show a cut-admissibility theorem, and establish soundness and completeness. The paper ends with a discussion that contextualizes our current work within the broader landscape of the proof theory of relevant logics.

An Ackermann constant is a formula of sentential logic built up from the sentential constant t by closing under connectives. It is known that there are only finitely many non-equivalent Ackermann constants in the relevant logic R. In this paper it is shown that the most natural systems close to R but weaker than it-in particular the non-distributive system LR and the modalised system NR-allow infinitely many Ackermann constants to be distinguished. The argument in each (...) case proceeds by construction of an algebraic model, infinite in the case of LR and of arbitrary finite size in the case of NR. The search for these models was aided by the computer program MaGIC (Matrix Generator for Implication Connectives) developed by the author at the Australian National University. (shrink)

This paper gives an account of Anderson and Belnap’s selection criteria for an adequate theory of entailment. The criteria are grouped into three categories: criteria pertaining to modality, those pertaining to relevance, and those related to expressive strength. The leitmotif of both this paper and its prequel is the relevant legitimacy of disjunctive syllogism. Relevant logics are commonly held to be paraconsistent logics. It is shown in this paper, however, that both E and R can be extended to explosive logics (...) which satisfy all of Anderson and Belnap’s selection criteria, provided the truth-constant known as the Ackermann constant is available. One of the selection criteria related to expressive strength is having an “enthymematic” conditional for which a deduction theorem holds. I argue that this allows for a new interpretation of Anderson and Belnap’s take on logical consequence, namely as committing them to pluralism about logical consequence. (shrink)

Sentential constants have been part of the R environment since Church [1]. They have had diverse uses in explicating relevant ideas and in sim- plifying them technically. Of most interest have been the Ackermann pair of constants t; f, functioning conceptually as a least truth, and as a greatest , under the ordering of propositions under true impli- cation. Also interesting have been the Church constants F; T, functioning similarly as least greatest propositions.

It is shown how to model propositional constants within the simplified Routley-Meyer semantics. Various axioms and rules allowingthe definition of modal operators, implicative negations, enthymematical conditionals, and propositions expressing various infinite conjunctions anddisjunctions are set forth and shown to correspond to specific frame conditions. Two propositional constants which are both often designated as “the Ackermann constant” are shown to capture two such “infinite” propositions: The conjunction of every logical law and the conjunction of every truth – what (...) Anderson and Belnap called the “world” constant. (shrink)

Here we study two connexive logics based on one of the conditionals introduced by Church in [4] and on some negations defined through falsity constants in the sense of Ackermann in [1].

The main object of this article is to give two novel proofs of the admissibility of Ackermann’s rule (γ) for the propositional relevant logic R. The results are established as corollaries of cut elimination for systems of tableaux for R. Cut elimination, in turn, is established both nonconstructively (as a corollary of completeness) and constructively (using Gentzen-like methods). The extensibility of the techniques is demonstrated by showing that (γ) is admissible for RQ* (R with constant domain quantifiers). The status (...) of the admissibility of (γ) for RQ* was, to the best of the author’s knowledge, an open problem. Further extensions of these results will be explored in the sequel(s). (shrink)

It is shown how to model propositional constants within the simplified Routley-Meyer semantics. Various axioms and rules allowing the definition of modal operators, implicative negations, enthymematical conditionals, and propositions expressing various infinite conjunctions and disjunctions are set forth and shown to correspond to specific frame conditions. Two propositional constants which are both often designated as “the Ackermann constant” are shown to capture two such “infinite” propositions: The conjunction of every logical law and the conjunction of every truth (...) –what Anderson and Belnap called the “world” constant. (shrink)

The implicational fragment of the logic of relevant implication, $R_{\to}$ is one of the oldest relevance logics and in 1959 was shown by Kripke to be decidable. The proof is based on $LR_{\to}$ , a Gentzen-style calculus. In this paper, we add the truth constant $\mathbf{t}$ to $LR_{\to}$ , but more importantly we show how to reshape the sequent calculus as a consecution calculus containing a binary structural connective, in which permutation is replaced by two structural rules that involve $\mathbf{t}$ (...) . This calculus, $LT_\to^{\text{\textcircled{$\mathbf{t}$}}}$ , extends the consecution calculus $LT_{\to}^{\mathbf{t}}$ formalizing the implicational fragment of ticket entailment . We introduce two other new calculi as alternative formulations of $R_{\to}^{\mathbf{t}}$ . For each new calculus, we prove the cut theorem as well as the equivalence to the original Hilbert-style axiomatization of $R_{\to}^{\mathbf{t}}$ . These results serve as a basis for our positive solution to the long open problem of the decidability of $T_{\to}$ , which we present in another paper. (shrink)

The Routley-Meyer relational semantics for relevant logics is extended to give a sound and complete model theory for many propositionally quantified relevant logics (and some non-relevant ones). This involves a restriction on which sets of worlds are admissible as propositions, and an interpretation of propositional quantification that makes ∀ pA true when there is some true admissible proposition that entails all p -instantiations of A . It is also shown that without the admissibility qualification many of the systems considered are (...) semantically incomplete, including all those that are sub-logics of the quantified version of Anderson and Belnap’s system E of entailment, extended by the mingle axiom and the Ackermann constant t . The incompleteness proof involves an algebraic semantics based on atomless complete Boolean algebras. (shrink)

It is shown that the classes of Routley-Meyer models which are axiomatizable by a theory in a propositional relevant language with fusion and the Ackermann constant can be characterized by their closure under certain model-theoretic operations involving prime filter extensions, relevant directed bisimulations and disjoint unions.

The decidability of the logic of pure ticket entailment means that the problem of inhabitation of simple types by combinators over the base { B, B′, I, W } is decidable too. Type-assignment systems are often formulated as natural deduction systems. However, our decision procedure for this logic, which we presented in earlier papers, relies on two sequent calculi and it does not yield directly a combinator for a theorem of ${T_\to}$. Here we describe an algorithm to extract an inhabitant (...) from a sequent calculus proof—without translating the proof into another proof system. (shrink)

This paper presents a range of new triviality proofs pertaining to naïve truth theory formulated in paraconsistent relevant logics. It is shown that excluded middle together with various permutation principles such as A → (B → C)⊩B → (A → C) trivialize naïve truth theory. The paper also provides some new triviality proofs which utilize the axioms ((A → B)∧ (B → C)) → (A → C) and (A → ¬A) → ¬A, the fusion connective and the Ackermann constant. (...) An overview over various ways to formulate Leibniz’s law in non-classical logics and two new triviality proofs for naïve set theory are also provided. (shrink)

The implicational fragment of the logic of relevant implication, $R_\to$ is known to be decidable. We show that the implicational fragment of the logic of ticket entailment, $T_\to$ is decidable. Our proof is based on the consecution calculus that we introduced specifically to solve this 50-year old open problem. We reduce the decidability problem of $T_\to$ to the decidability problem of $R_\to$. The decidability of $T_\to$ is equivalent to the decidability of the inhabitation problem of implicational types by combinators over (...) the base $\{\textsf{B},\textsf{B}',\textsf{I},\textsf{W}\}$. (shrink)

We exhibit infinitely many semisimple varieties of semilinear De Morgan monoids (and likewise relevant algebras) that are not tabular, but which have only tabular proper subvarieties. Thus, the extension of relevance logic by the axiom \((p\rightarrow q)\vee (q\rightarrow p)\) has infinitely many pretabular axiomatic extensions, regardless of the presence or absence of Ackermann constants.

Two constructions for adding an involution operator to residuated ordered monoids are investigated. One preserves integrality and the mingle axiom x 2x but fails to preserve the contraction property xx 2. The other has the opposite preservation properties. Both constructions preserve commutativity as well as existent nonempty meets and joins and self-dual order properties. Used in conjunction with either construction, a result of R.T. Brady can be seen to show that the equational theory of commutative distributive residuated lattices (without involution) (...) is decidable, settling a question implicitly posed by P. Jipsen and C. Tsinakis. The corresponding logical result is the (theorem-) decidability of the negation-free axioms and rules of the logic RW, formulated with fusion and the Ackermann constant t. This completes a result of S. Giambrone whose proof relied on the absence of t. (shrink)

For relevant logics, the admissibility of the rule of proof $\gamma $ has played a significant historical role in the development of relevant logics. For first-order logics, however, there have been only a handful of $\gamma $ -admissibility proofs for a select few logics. Here we show that, for each logic L of a wide range of propositional relevant logics for which excluded middle is valid (with fusion and the Ackermann truth constant), the first-order extensions QL and LQ admit (...) $\gamma $. Specifically, these are particular “conventionally normal” extensions of the logic $\mathbf {G}^{g,d}$, which is the least propositional relevant logic (with the usual relational semantics) that admits $\gamma $ by the method of normal models. We also note the circumstances in which our results apply to logics without fusion and the Ackermann truth constant. (shrink)

A selection from the correspondence of the logician Wilhelm Ackermann (1896?1962) is presented in this article. The most significant letters were exchanged with Bernays, Scholz and Lorenzen, from which extensive passages are transcribed. Some remarks from other letters, with quotations, are also included.

Robert John Ackermann deals decisively with the problem of relativism that has plagued post-empiricist philosophy of science. Recognizing that theory and data are mediated by data domains (bordered data sets produced by scientific instruments), he argues that the use of instruments breaks the dependency of observation on theory and thus creates a reasoned basis for scientific objectivity. Originally published in 1985. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished (...) backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905. (shrink)

My purpose in this paper is to examine a pitfall in empiricistic analysis which has not been widely discussed, perhaps because it lies implicit in what may seem a harmless facet of such analysis. The kind of analysis I have in mind is analysis of any variety which seeks to reduce understanding of any object, concept event, institution, or whatever, and its appropriate properties, to understanding of discrete elements and their properties out of which the analytically reduced can be constructed. (...) Let us call the entity analysed into elements the molar object, and restrict elements hereafter to some set of discrete elements of some molar object which have been obtained by an analysis of the kind to be discussed. What I will have to say will apply most directly to the reductionist analyses of an older logical empiricism, but I hope to make it clear that more recent linguistic analyses encounter the same difficulty. (shrink)

Through close textual analysis, Ackermann (philosophy, U. of Massachusetts, Amherst) exposes the underlying unity and consistency in Nietzsche's thought. He challenges the common view that Nietzsche's work can best be understood as a collection of isolated insights and that each of several discrete periods of thought are based on a different set of values. Annotation copyrighted by Book News, Inc., Portland, OR.

Studie over de filosofie van de in Oostenrijk geboren Engelse wijsgeer.

In this paper, I shall examine attempts to furnish formal models for deductive scientific explanation. All such attempts have had certain defects. The most serious of these defects is to be found in the fact that the extant models seem to be formally restrictive in ways that do not allow any obvious generalization of their conditions which will encompass the full range of all those scientific explanations which must be considered plausible candidates for translation into deductive models.

This manuscript presents an English translation of the work titled “Begründung Einer Strengen Implikation” by the German logician and mathematician Wilhelm Ackermann (1896-1962), first published in June 1956.

Any account of “what is special about the human brain” (Passingham 2008) must specify the neural basis of our unique ability to produce speech and delineate how these remarkable motor capabilities could have emerged in our hominin ancestors. Clinical data suggest that the basal ganglia provide a platform for the integration of primate-general mechanisms of acoustic communication with the faculty of articulate speech in humans. Furthermore, neurobiological and paleoanthropological data point at a two-stage model of the phylogenetic evolution of this (...) crucial prerequisite of spoken language: (i) monosynaptic refinement of the projections of motor cortex to the brainstem nuclei that steer laryngeal muscles, presumably, as part of a “phylogenetic trend” associated with increasing brain size during hominin evolution; (ii) subsequent vocal-laryngeal elaboration of cortico-basal ganglia circuitries, driven by human-specificFOXP2mutations.;>This concept implies vocal continuity of spoken language evolution at the motor level, elucidating the deep entrenchment of articulate speech into a “nonverbal matrix” (Ingold 1994), which is not accounted for by gestural-origin theories. Moreover, it provides a solution to the question for the adaptive value of the “first word” (Bickerton 2009) since even the earliest and most simple verbal utterances must have increased the versatility of vocal displays afforded by the preceding elaboration of monosynaptic corticobulbar tracts, giving rise to enhanced social cooperation and prestige. At the ontogenetic level, the proposed model assumes age-dependent interactions between the basal ganglia and their cortical targets, similar to vocal learning in some songbirds. In this view, the emergence of articulate speech builds on the “renaissance” of an ancient organizational principle and, hence, may represent an example of “evolutionary tinkering” (Jacob 1977). (shrink)

Many philosophers have written in the past as though it were nearly obvious to rational reflection that the existence of evil in this world is incompatible with the presumed properties of the Christian God, and they have assumed a proof of incompatibility to be easy to construct. An informal underpinning for this line of thought is easy to develop. Surely God in his benevolence finds evil to be evil, and hence has both the desire and the means, provided by his (...) omnipotence and omniscience, to eradicate it. But it remains a brute fact that evil exists. While this seems plausible enough at first glance, and seems damaging to the rationality of Christian belief, attempts to pin down a definite proof of incompatibility have encountered difficulties. The root difficulty is perhaps that the surface plausibility of incompatibility is ultimately mistaken. In what he calls a Free Will Defence against natural atheology, Alvin Plantinga has presented what seems a definitive proof, on rather modest assumptions, of the logical compatibility of God's nature and the existence of evil. Logic alone can neither prove nor disprove God's existence, since the defence rests on the empirical assumption that evil exists in this world. What Plantinga shows, put very simply, is that God may have created a world as good as any that an omnipotent, omniscient, and benevolent being might have created given that human beings must exist in that world. Whether Christianity ought to court logical rationality may seem highly dubious, but on the supposition that it does, Plantinga's proof that the existence of God is logically compatible with the existence of evil seems to me to settle the issue of whether Christianity is a possible object of rational belief, at least insofar as the problem of evil is considered the major obstacle to rationality of belief. Perhaps it is now clear that I do not intend here to attack the validity or the significance of Plantinga's proof. At the same time, I think it possible to argue for Plantinga's conclusion on other grounds, grounds that seem to me philosophically more appealing, and grounds that are manifestly compatible with the Biblical record. After briefly summarizing Plantinga's argument, I shall propose an alternative free will defence that circumvents some of the presuppositions of his arguments, an alternative that may be attractive to philosophers who are not interested in an ontology involving Plantinga's conception of possible worlds. (shrink)

The fact that simplicity has been linked with induction by many philosophers of science, some of whom have proposed or supported criteria of “inductive simplicity,” means that the problem must be given some serious attention. I take “inductive simplicity” as a title, however, only by way of concession to these historical treatments, since it is precisely the burden of my paper to show that there is no such thing. So much for the conclusion. I shall spend the remainder of my (...) time arguing for it. (shrink)