Sentential constants in R and \(R^{\neg}\)
type: Item
instance of: scholarly article
title: Sentential constants in R and \(R^{\neg}\)
zbMATH Open document ID: 0624.03014
DOI: 10.1007/BF00375901
author: Robert K. Meyer
published in: Studia Logica
publication date: 1986-01-01T00:00:00Z
review text: This paper is a study of sentential constants in the relevant logic R, its intensional fragment \(R_ i\) and its Boolean extension \(R^{\neg}\). The basic constants are the Church constants T and F introduced in A. Church [``The weak theory of implication'' in Kontrolliertes Denken. Untersuchungen zum Logikkalkül und der Logik der Einzelwissenschaften, ed. Menne, Wilhelmy and Angsil, Komissions-Verlag Karl Alber, Munich, 1951, pp. 22-37] and the Ackermann constants t and f of \textit{W. Ackermann} [J. Symb. Logic 21, 113-128 (1956; Zbl 0072.001)]. The author makes interesting use of matrix and general algebraic techniques to show (among other things): 1. There are exactly 6 non-equivalent formulae in \(R_ i\) (and in R, and in \(R^{\neg})\) that can be built out of the Ackermann constants and the intensional connectives; 2. There are exactly 14 non-equivalent formulae in \(R_ i\) (and in R) built out of the sentential constants and the intensional connectives; 3. There are exactly 8 formulae in \(R^{\neg}\) built up from the sentential constants and all of the connectives; 4. Defining (in \(R^{\neg})\) necessity, N, as \(NA=T\to A\), possibility, P, as \(PA=\neg N\neg A\) and strict implication, \(\Rightarrow\), as \(A\Rightarrow B=N(\neg A\vee B)\) and letting the class of modal formulae be the class of formulae built up from propositional variables, T, F, and Boolean and modal connectives: a modal formula is a theorem of \(R^{\neg}\) iff it is a theorem of S5; and \(A\to B\) is a theorem of \(R^{\neg}\) iff \(A\Rightarrow B\) is. The author refers the reader to \textit{J. K. Slaney} [J. Symb. Logic 50, 487-501 (1985; Zbl 0576.03015)] for the solution to the problem of the number of non-equivalent Ackermann constants in R. (The answer is 3088.)
reviewed by: Steve Giambrone
Mathematics Subject Classification ID: 03B45
Mathematics Subject Classification ID: 03G25
zbMATH DE Number: 4012574
zbMATH Keywords: rigorous compactness
zbMATH Keywords: Sugihara matrices
zbMATH Keywords: DeMorgan monoids
zbMATH Keywords: sentential constants
zbMATH Keywords: relevant logic R
zbMATH Keywords: intensional fragment
zbMATH Keywords: Boolean extension
zbMATH Keywords: Church constants
zbMATH Keywords: Ackermann constants
zbMATH Keywords: intensional connectives
MaRDI profile type: Publication
cites work: Begründung einer strengen Implikation
cites work: Classical relevant logics. II
cites work: Intensional models for first degree formulas
cites work: RI the Bounds of Finitude
cites work: Q5547552
cites work: 3088 varieties: A solution to the Ackermann constant problem
Recommended article: The Ackermann constant theorem: A computer-assisted investigation
Recommended article: Sentential constants in systems near R
Recommended article: Boolean negation and non-conservativity III: the Ackermann constant
Recommended article: Logical constants: a modalist approach
Recommended article: The Problem of Logical Constants
Recommended article: Q4903802
Recommended article: Q4698611
Recommended article: Q3367504
Recommended article: Structural completeness in relevance logics
Recommended article: 3088 varieties: A solution to the Ackermann constant problem
description: scientific article; zbMATH DE number 4012574