Admissible rules and the Leibniz hierarchy

DOI10.1215/00294527-3671151zbMath1357.03041OpenAlexW2513075719WikidataQ123161990 ScholiaQ123161990MaRDI QIDQ2374395

James G. Raftery

Publication date: 15 December 2016

Published in: Notre Dame Journal of Formal Logic (Search for Journal in Brave)

Full work available at URL: https://projecteuclid.org/euclid.ndjfl/1472746139

zbMATH Keywords

algebraizable logicadmissible ruledeductive systemstructural completenessreduced matrixLeibniz hierarchyBCIW

Mathematics Subject Classification ID

Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47) Axiomatic model classes (08C10) Abstract deductive systems (03B22) Abstract algebraic logic (03G27)

Related Items (10)

Almost structural completeness; an algebraic approach ⋮ Structural completeness in relevance logics ⋮ HEREDITARILY STRUCTURALLY COMPLETE POSITIVE LOGICS ⋮ Singly generated quasivarieties and residuated structures ⋮ Hereditarily structurally complete intermediate logics: Citkin's theorem via duality ⋮ Varieties of De Morgan monoids: minimality and irreducible algebras ⋮ Hereditarily structurally complete superintuitionistic deductive systems ⋮ VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS ⋮ Structural completeness in many-valued logics with rational constants ⋮ THE POSET OF ALL LOGICS I: INTERPRETATIONS AND LATTICE STRUCTURE

This page was built for publication: Admissible rules and the Leibniz hierarchy