On the admissible rules of intuitionistic propositional logic
For \(A\), \(B\) propositional formulas, \(A|\mskip-6mu\sim B\) means that for each substitution \(\sigma\), \(\sigma(A)\) intuitionistically valid implies \(\sigma(B)\) intuitionistically valid. The author introduces the expression \(A\vartriangleright B\) for propositional formulas \(A\), \(B\), and defines the following system of derivations for such expressions: Axiom schemes: \hskip 17mm \((A\to r\vee s)\vee t\vartriangleright(A\to r)\vee (A\to s)\vee (A\to p_1)\vee\cdots\vee\) \hskip 17mm\qquad \(\vee(A\to p_n)\vee t\) for \(A= \bigwedge^n_{i=1} (p_i\to q_i)\), \hskip 17mm \(A\vartriangleright B\quad\) where \((A\to B)\) is intuitionistically vaild. Rules: \hskip 17mm \({C\vartriangleright A, C\vartriangleright B\over C\vartriangleright A\wedge B},\quad {A\vartriangleright B, B\vartriangleright C\over A\vartriangleright C}\). A Kripke model is called AR-model, if for every finite set \(\{u_1,\dots, u_n\}\) of nodes, there is a node \(u\) such that \[ u\preceq u_1,\dots, u_n\wedge\forall u'\succ u\;(u_i\preceq u'\text{ for some }i\in \{1,\dots, n\}). \] It is shown that the following are equivalent: a) \(A|\mskip-6mu\sim B\). b) \(A\vartriangleright B\) is derivable. c) In every AR-model, \(A\) valid implies \(B\) valid.
- Rules of inference with parameters for intuitionistic logic
- scientific article; zbMATH DE number 3959387
- scientific article; zbMATH DE number 7448
- scientific article; zbMATH DE number 3557753
- CRITERIA FOR ADMISSIBILITY OF RULES OF INFERENCE WITH PARAMETERS IN THE INTUITIONISTIC PROPOSITIONAL CALCULUS
- Proof theory for admissible rules
- The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\)
- Hereditarily structurally complete superintuitionistic deductive systems
- Structural completeness in many-valued logics with rational constants
- Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
- Unification in pretabular extensions of S4
- Sugihara algebras: admissibility algebras via the test spaces method
- Deductive systems with multiple-conclusion rules and the disjunction property
- Inference rules in Nelson's logics, admissibility and weak admissibility
- Rules with parameters in modal logic. I.
- Admissibility via natural dualities
- Admissibility in De Morgan algebras
- On the rules of intermediate logics
- Frege systems for extensible modal logics
- Incompleteness of intuitionistic propositional logic with respect to proof-theoretic semantics
- Hard provability logics
- On rules
- Admissible rules for six intuitionistic modal logics
- Hereditarily structurally complete intermediate logics: Citkin's theorem via duality
- Realisability for infinitary intuitionistic set theory
- Admissible bases via stable canonical rules
- A syntactic approach to unification in transitive reflexive modal logics
- Consequence relations and admissible rules
- A tableau method for checking rule admissibility in S4
- Structural completeness in propositional logics of dependence
- Admissible tools in the kitchen of intuitionistic logic
- The Henkin sentence
- Admissibility and Unifiability in Contact Logics
- A note on extensions: admissible rules via semantics
- 2006–07 Winter Meeting of the Association for Symbolic Logic
- scientific article; zbMATH DE number 5379366 (Why is no real title available?)
- Hypersequent Systems for the Admissible Rules of Modal and Intermediate Logics
- INVERSION BY DEFINITIONAL REFLECTION AND THE ADMISSIBILITY OF LOGICAL RULES
- scientific article; zbMATH DE number 4075019 (Why is no real title available?)
- 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
- scientific article; zbMATH DE number 3557753 (Why is no real title available?)
- Admissible and derivable rules in intuitionistic logic
- An explicit basis for admissible inference rules in table modal logics of width 2
- scientific article; zbMATH DE number 733387 (Why is no real title available?)
- scientific article; zbMATH DE number 1463088 (Why is no real title available?)
- KD is nullary
- Checking admissibility using natural dualities
- Admissibility and refutation: some characterisations of intermediate logics
- An explicit basis for admissible rules of modal logics of finite width
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- Multi-Agents’ Temporal Logic using Operations of Static Agents’ Knowledge
- scientific article; zbMATH DE number 7204446 (Why is no real title available?)
- Singly generated quasivarieties and residuated structures
- Finite frames fail: how infinity works its way into the semantics of admissibility
- The \(\Sigma_1\)-provability logic of \(\mathsf{HA}^{*}\)
- The context of inference
- VARIETIES OF POSITIVE MODAL ALGEBRAS AND STRUCTURAL COMPLETENESS
- Constructive modalities with provability smack
- Multiple conclusion rules in logics with the disjunction property
- Intermediate logics and Visser's rules
- Preservation of admissible rules when combining logics
- 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
- Proof complexity of non-classical logics
- A(nother) characterization of intuitionistic propositional logic
- Explicit basis for admissible rules in K-saturated tabular logics
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Admissibility and unification in the modal logics related to S4.2
- Admissible inference rules of modal WCP-logics
- An explicit basis for \textit{WCP}-globally admissible inference rules
- THE FIRST-ORDER LOGIC OF CZF IS INTUITIONISTIC FIRST-ORDER LOGIC
- Admissible rules in the implication-negation fragment of intuitionistic logic
- Best unifiers in transitive modal logics
- A note on admissible rules and the disjunction property in intermediate logics
- Universal proof theory: feasible admissibility in intuitionistic modal logics
- Basis of globally admissible rules for logic S4
- Lexicographic rationalizability and iterated admissibility
- Relative unification in intuitionistic logic: towards the provability logic of HA
- Decidability of global admissibility of inference rules in logic S4
- Unification in subsystems of polymodal provability logic GLP
- Investigating definability in propositional logic via sheaves on Grothendieck topologies
- Constructive validity of a generalized Kreisel-Putnam rule
- On the unification problem for \(\operatorname{GLP} \)
- Undecidability of admissibility in the product of two \textbf{Alt} logics
- Unification in linear temporal logic LTL
- Strictly positive fragments of the provability logic of Heyting arithmetic
- Admissible inference rules and semantic property of modal logics
- Complexity of admissible rules
- 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
- Linear temporal logic with until and next, logical consecutions
This page was built for publication: On the admissible rules of intuitionistic propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2732279)