Sentential constants in systems near R

DOI10.1007/BF01057657zbMATH Open0796.03031OpenAlexW2035319391MaRDI QIDQ1313086FDOQ1313086

John K. Slaney

Publication date: 28 September 1994

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01057657

Recommendations

• Sentential constants in R and \(R^{\neg}\)
• The Ackermann constant theorem: A computer-assisted investigation
• 3088 varieties: A solution to the Ackermann constant problem
• scientific article; zbMATH DE number 4053570
• Boolean negation and non-conservativity. III: The Ackermann constant

zbMATH Keywords

algebraic modelrelevant logicAckermann constantMatrix Generator for Implication Connectives

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Software, source code, etc. for problems pertaining to mathematical logic and foundations (03-04)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Linear logic
• On formulas of one variable in intuitionistic propositional calculus
• Sentential constants in R and \(R^{\neg}\)
• 3088 varieties: A solution to the Ackermann constant problem
• On the structure of De Morgan monoids with corollaries on relevant logic and theories

Cited In (6)

• The 2007 Annual Conference of the Australasian Association for Logic
• Free algebras corresponding to multiplicative classical linear logic and some of its extensions
• Varieties of De Morgan monoids: minimality and irreducible algebras
• Sentential constants in R and \(R^{\neg}\)
• VARIETIES OF DE MORGAN MONOIDS: COVERS OF ATOMS
• 3088 varieties: A solution to the Ackermann constant problem

This page was built for publication: Sentential constants in systems near R

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1313086)