scientific article; zbMATH DE number 1463088

DOI10.1002/(SICI)1521-3870(200005)46:2%3C207::AID-MALQ207%3E3.0.CO;2-EMaRDI QIDQ4487248zbMATH OpenFDO

Authors M. Terziler, Vitaliy Remazki, Vladimir Rybakov

Publication date 24 July 2000

zbMATH Keywords

intermediate logicintuitionistic logicadmissible ruleKripke modelbasis for rules

Mathematics Subject Classification ID

Subsystems of classical logic (including intuitionistic logic) (03B20) Intermediate logics (03B55) Structure of proofs (03F07)

Recommendations

• Describing a basis in semireduced form for inference rules of intuitionistic logic
• Admissible and derivable rules in intuitionistic logic
• On the admissible rules of intuitionistic propositional logic
• Admissibility of structural rules for contraction-free systems of intuitionistic logic
• BASES OF ADMISSIBLE RULES OF THE MODAL SYSTEM $ \mathrm{Grz}$ AND OF INTUITIONISTIC LOGIC
• Admissible rules in the implication-negation fragment of intuitionistic logic
• Bases of admissible rules for K-saturated logics
• Bases of admissible rules of proper axiomatic extensions of Łukasiewicz logic
• Bases of admissible rules of the logics S4 and Int
• Reduced axioms for the propositional logics induced by basic algebras

Cited in

(17)

• Admissible inference rules and semantic property of modal logics
• A(nother) characterization of intuitionistic propositional logic
• DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
• Intermediate logics and Visser's rules
• Admissible rules in the implication-negation fragment of intuitionistic logic
• An explicit basis for admissible inference rules in table modal logics of width 2
• Table admissible inference rules
• Bases of admissible rules of the logics S4 and Int
• An explicit basis for admissible rules of modal logics of finite width
• Logical consecutions in discrete linear temporal logic
• Branching time logics \(\mathcal {BTL}^{\text{U,S}}_{\text{N},\text{N}^{-1}}(\mathcal {Z})_{\alpha }\) with operations \textit{Until} and \textit{Since} based on bundles of integer numbers, logical consecutions, deciding algorithms
• Admissible inference rules of modal WCP-logics
• An explicit basis for \textit{WCP}-globally admissible inference rules
• Computer Science Logic
• Explicit basis for admissible rules in \(K\)-saturated tabular logics
• Describing a basis in semireduced form for inference rules of intuitionistic logic
• On the independence of premiss axiom and rule

This page was built for publication:

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