Admissibility in positive logics
From MaRDI portal
Publication:1689558
Abstract: The paper studies admissibility of multiple-conclusion rules in the positive logics. Using modification of a method used by M.~Wajsberg in the proof of the separation theorem, it is shown that the problem of admissibility in positive logics is equivalent to the problem of admissibility in intermediate logics defined by positive additional axioms.
Recommendations
Cites work
- scientific article; zbMATH DE number 3112788 (Why is no real title available?)
- scientific article; zbMATH DE number 3120840 (Why is no real title available?)
- scientific article; zbMATH DE number 3737629 (Why is no real title available?)
- scientific article; zbMATH DE number 3494479 (Why is no real title available?)
- scientific article; zbMATH DE number 3557753 (Why is no real title available?)
- scientific article; zbMATH DE number 1226187 (Why is no real title available?)
- scientific article; zbMATH DE number 2064306 (Why is no real title available?)
- scientific article; zbMATH DE number 3264054 (Why is no real title available?)
- scientific article; zbMATH DE number 3031479 (Why is no real title available?)
- scientific article; zbMATH DE number 3050845 (Why is no real title available?)
- A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
- Admissibility of logical inference rules
- Admissible rules in the implication-negation fragment of intuitionistic logic
- An algebraic approach to non-classical logics
- Bases of admissible rules of the logics S4 and Int
- Canonical rules
- Concerning formulas of the types A→B ν C,A →(Ex)B(x) in intuitionistic formal systems
- Constructive negations and paraconsistency
- Independent Bases of Admissible Rules
- ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
- On not strengthening intuitionistic logic
- On the structural completeness of some pure implicational propositional calculi
- On unification and admissible rules in Gabbay-de Jongh logics
- Positive formulas in intuitionistic and minimal logic
- Proof complexity of intuitionistic implicational formulas
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
Cited in
(5)- Admissibility, compatibility, and deducibility in first-order sequent logics
- Admissibility and Unifiability in Contact Logics
- Lexicographic rationalizability and iterated admissibility
- scientific article; zbMATH DE number 733387 (Why is no real title available?)
- Multiple conclusion rules in logics with the disjunction property
This page was built for publication: Admissibility in positive logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1689558)