DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV

DOI10.1017/BSL.2020.43OpenAlexW3091951649MaRDI QIDQ5009678

Jeroen P. Goudsmit

Publication date: 5 August 2021

Published in: The Bulletin of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/bsl.2020.43

zbMATH Keywords

intuitionistic logicadmissible rules

Mathematics Subject Classification ID

Abstract deductive systems (03B22) Subsystems of classical logic (including intuitionistic logic) (03B20) Intermediate logics (03B55)

Cites Work

• Unification and admissible rules for paraconsistent minimal Johanssons' logic J and positive intuitionistic logic \(\mathbf{IPC}^+\)
• Extendible formulas in two variables in intuitionistic logic
• Locally finite reducts of Heyting algebras and canonical formulas
• Finite frames fail: how infinity works its way into the semantics of admissibility
• Intermediate logics and Visser's rules
• Unification, finite duality and projectivity in varieties of Heyting algebras
• Intermediate logics and the de Jongh property
• Best unifiers in transitive modal logics
• A note on admissible rules and the disjunction property in intermediate logics
• On Bellissima's construction of the finitely generated free Heyting algebras, and beyond
• Unification in linear temporal logic LTL
• On disjunctions and existential statements in intuitionistic systems of logic
• Logical equations and admissible rules of inference with parameters in modal provability logics
• Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
• An effective representation for finitely generated free interior algebras
• Decidability of the admissibility problem in layer-finite logics
• Admissible rules for logics containing S4.3
• Elementary theories of free topo-Boolean and pseudo-Boolean algebras
• A criterion for admissibility of rules in the modal system S4 and intuitionistic logic
• Bases of admissible rules of the logics S4 and Int
• Equations in free topoboolean algebra
• Unification theory
• On two problems of Harvey Friedman
• Solvability of logical equations in the modal system Grz and intuitionistic logic
• Constructivism in mathematics. An introduction. Volume II
• Some remarks on the concept of completeness of the propositional calculus. I
• Free S5 algebras
• Intuitionistic propositional logic is polynomial-space complete
• Admissibility of logical inference rules
• Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
• The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\)
• The finite model property with respect to admissibility for superintuitionistic logic
• Free Heyting algebras
• On not strengthening intuitionistic logic
• A rule-completeness theorem
• On closed elements in closure algebras
• On the admissible rules of intuitionistic propositional logic
• Construction of an Explicit Basis for Rules Admissible in Modal System S4
• Admissibility in Finitely Generated Quasivarieties
• Jankov’s Theorems for Intermediate Logics in the Setting of Universal Models
• A Resolution/Tableaux Algorithm for Projective Approximations in IPC
• Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül
• Canonical rules
• DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
• On formulas of one variable in intuitionistic propositional calculus
• CRITERIA FOR ADMISSIBILITY OF RULES OF INFERENCE WITH PARAMETERS IN THE INTUITIONISTIC PROPOSITIONAL CALCULUS
• On an interpretation of second order quantification in first order intuitionistic propositional logic
• Canonical formulas for K4. Part I: Basic results
• Rules of inference with parameters for intuitionistic logic
• One hundred and two problems in mathematical logic
• Independent bases for rules admissible in pretabular logics
• Unification in intuitionistic logic
• Intermediate logics preserving admissible inference rules of heyting calculus
• Unification through projectivity
• Tabular Logics with no Finite Bases for Inference Rules
• On Finite Model Property for Admissible Rules
• ADMISSIBILITY OF RULES OF INFERENCE, AND LOGICAL EQUATIONS, IN MODAL LOGICS AXIOMATIZING PROVABILITY
• Finitely generated free Heyting algebras
• BASES OF ADMISSIBLE RULES OF THE MODAL SYSTEM $ \mathrm{Grz}$ AND OF INTUITIONISTIC LOGIC
• Description of Modal Logics Inheriting Admissible Rules for K4
• Finitely generated free Heyting algebras: the well-founded initial segment
• Writing out unifiers for formulas with coefficients in intuitionistic logic
• Unifiers in transitive modal logics for formulas with coefficients (meta-variables)
• Description of modal logics inheriting admissible rules for S4
• Note on Rules of Inference
• An application of kripke's completeness theorem for intuitionism to superconstructive propositional calculi
• Admissible Rules of Modal Logics
• Rules and arithmetics
• A(nother) characterization of intuitionistic propositional logic
• Unification theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV