Proof theory for admissible rules
From MaRDI portal
Publication:1023055
DOI10.1016/j.apal.2008.10.011zbMath1174.03024OpenAlexW2170146694MaRDI QIDQ1023055
George Metcalfe, Rosalie Iemhoff
Publication date: 10 June 2009
Published in: Annals of Pure and Applied Logic (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/26742
Modal logic (including the logic of norms) (03B45) Structure of proofs (03F07) Subsystems of classical logic (including intuitionistic logic) (03B20)
Related Items (32)
On rules ⋮ Multiagent temporal logics with multivaluations ⋮ Almost structural completeness; an algebraic approach ⋮ A syntactic approach to unification in transitive reflexive modal logics ⋮ UNIFICATION IN INTERMEDIATE LOGICS ⋮ Tutorial on Admissible Rules in Gudauri ⋮ Admissibility and Unifiability in Contact Logics ⋮ A Note on Extensions: Admissible Rules via Semantics ⋮ Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge ⋮ Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition ⋮ Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\) ⋮ On unification and admissible rules in Gabbay-de Jongh logics ⋮ Admissible rules for six intuitionistic modal logics ⋮ Reflecting rules: a note on generalizing the deduction theorem ⋮ Admissibility and unification in the modal logics related to S4.2 ⋮ Admissible rules in the implication-negation fragment of intuitionistic logic ⋮ Multi-agent logics with multi-valuations and intensional logical operations ⋮ Extending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification ⋮ Best unifiers in transitive modal logics ⋮ A meta-logic of inference rules: Syntax ⋮ On the logical philosophy of assertive graphs ⋮ Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting) ⋮ PRESERVATION OF ADMISSIBLE RULES WHEN COMBINING LOGICS ⋮ Hypersequent and display calculi -- a unified perspective ⋮ Unification in linear temporal logic LTL ⋮ The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\) ⋮ Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics ⋮ INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES ⋮ Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK ⋮ Unification in Linear Modal Logic on Non-transitive Time with the Universal Modality ⋮ Inference rules in Nelson's logics, admissibility and weak admissibility ⋮ Rules with parameters in modal logic. I.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Intermediate logics and Visser's rules
- Complexity of admissible rules
- Admissibility of logical inference rules
- Best solving modal equations
- On the admissible rules of intuitionistic propositional logic
- A Resolution/Tableaux Algorithm for Projective Approximations in IPC
- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
- One hundred and two problems in mathematical logic
- Unification in intuitionistic logic
- Preservativity logic: An analogue of interpretability logic for constructive theories
- Computer Science Logic
- Admissible Rules of Modal Logics
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
This page was built for publication: Proof theory for admissible rules
