Rules of inference with parameters for intuitionistic logic
From MaRDI portal
Publication:4032871
DOI10.2307/2275439zbMATH Open0788.03007OpenAlexW2168410054MaRDI QIDQ4032871FDOQ4032871
Authors: Vladimir Rybakov 
Publication date: 1 April 1993
Published in: Journal of Symbolic Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2275439
Recommendations
intuitionistic propositional calculusfinite Kripke modelsalgorithm for deciding admissibility with parameters
Cites Work
Cited In (39)
- Unification in linear temporal logic LTL
- Inference rules in Nelson's logics, admissibility and weak admissibility
- Title not available (Why is that?)
- Linear temporal logic with until and next, logical consecutions
- DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
- Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
- Multiagent temporal logics, unification problems, and admissibilities
- Unification and Inference Rules in the Multi-modal Logic of Knowledge and Linear Time LTK
- Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
- 1995–1996 Winter Meeting of the Association for Symbolic Logic
- Intermediate logics and Visser's rules
- Unification, finite duality and projectivity in varieties of Heyting algebras
- Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
- Admissibility and unification in the modal logics related to S4.2
- Substitutions of \(\Sigma_1^0\)-sentences: Explorations between intuitionistic propositional logic and intuitionistic arithmetic
- Rules and meta-rules in the framework of possibility theory and possibilistic logic
- Admissible bases via stable canonical rules
- The decidability of dependency in intuitionistic propositional logic
- A Tableau Method for Checking Rule Admissibility in S4
- Best unifiers in transitive modal logics
- Extendible formulas in two variables in intuitionistic logic
- Rules with parameters in modal logic. I.
- The Context of Inference
- Title not available (Why is that?)
- Notes on my scientific life
- Inference rules in multi-agents' temporal logics
- 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
- The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\)
- The permutability of rules in the classical inferential calculus
- Multi-agent logics with dynamic accessibly relations, projective unifiers
- Decidability of Hybrid Logic with Local Common Knowledge Based on Linear Temporal Logic LTL
- On the admissible rules of intuitionistic propositional logic
- Describing a basis in semireduced form for inference rules of intuitionistic logic
- On Finite Model Property for Admissible Rules
- Admissible Rules of Lukasiewicz Logic
- Dynamic temporal logical operations in multi-agent logics
- Multi-agent temporal logics, information, unification, and projectivity
- Hereditarily structurally complete intermediate logics: Citkin's theorem via duality
- Canonical Extensions, Esakia Spaces, and Universal Models
This page was built for publication: Rules of inference with parameters for intuitionistic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4032871)
