Derivability of admissible rules

DOI10.1007/BF01084082zbMath0375.02014OpenAlexW2049821930MaRDI QIDQ1245932

Grigori Mints

Publication date: 1976

Published in: Journal of Soviet Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Proof theory and constructive mathematics (03F99)

Related Items (16)

Admissible inference rules and semantic property of modal logics ⋮ A Note on Extensions: Admissible Rules via Semantics ⋮ A Tableau Method for Checking Rule Admissibility in S4 ⋮ Hereditarily structurally complete modal logics ⋮ Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition ⋮ What is an inference rule? ⋮ Algebraic semantics for the ‐fragment of and its properties ⋮ Admissible inference rules of modal WCP-logics ⋮ An explicit basis for \textit{WCP}-globally admissible inference rules ⋮ Singly generated quasivarieties and residuated structures ⋮ 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 ⋮ Admissibility and refutation: some characterisations of intermediate logics ⋮ Linear temporal logic with until and next, logical consecutions ⋮ Finite frames fail: how infinity works its way into the semantics of admissibility ⋮ Failure of completeness in proof-theoretic semantics ⋮ Logical consecutions in discrete linear temporal logic

Cites Work

• Unnamed Item
• Untersuchungen über das logische Schliessen. II
• On not strengthening intuitionistic logic
• Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül

This page was built for publication: Derivability of admissible rules