Logical equations and admissible rules of inference with parameters in modal provability logics

DOI10.1007/BF00935600MaRDI QIDQ805609zbMATH OpenOpenAlexFDO

Authors Vladimir Rybakov

Publication date 1990

Published in Studia Logica (Search for Journal in Brave)

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

zbMATH Keywords

admissible inference rulesalgorithmsGödel-Löb logicmodal provability logicssolvability of logical equations

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Modal logic (including the logic of norms) (03B45) Gödel numberings and issues of incompleteness (03F40)

Review text

The aim of this paper is to study admissible inference rules for the modal provability logics GL and S. It is proved that none of these logics has a basis for admissible rules in a finite number of variables, in particular, they do not have finite bases. It is proved that GL and S are decidable by admissibility, some algorithms are found which recognize admissibility of usual inference rules and inference rules in generalized form - inference rules with parameters (or metavariables). By using recognizability of admissibility of inference rules with parameters, we can recognize solvability of logical equations in GL and S and construct some of their solutions. Thus, the analogues of H. Friedman's problem for GL and S are affirmatively solved, the analogues of A. Kuznetsov's problem of finiteness of a basis for admissible rules for GL and S have negative solutions, and the problems of solvability of logical equations in GL and S have positive solutions.

Recommendations

• ADMISSIBILITY OF RULES OF INFERENCE, AND LOGICAL EQUATIONS, IN MODAL LOGICS AXIOMATIZING PROVABILITY
• scientific article; zbMATH DE number 4164801
• scientific article; zbMATH DE number 3959387
• Decidability of the admissibility problem in layer-finite logics
• An admissibility criterion for inference rules with metavariables in the modal logic S4._N

Cites work

• Admissible rules for logics containing S4.3
• Arithmetical necessity, provability and intuitionistic logic
• BASES OF ADMISSIBLE RULES OF THE MODAL SYSTEM $ \mathrm{Grz}$ AND OF INTUITIONISTIC LOGIC
• DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
• scientific article; zbMATH DE number 3963790 (Why is no real title available?)
• scientific article; zbMATH DE number 3769602 (Why is no real title available?)
• scientific article; zbMATH DE number 3485746 (Why is no real title available?)
• ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC
• One hundred and two problems in mathematical logic
• Provability interpretations of modal logic
• The Logic of Provability

Cited in

(13)

• Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
• Deductive systems with multiple-conclusion rules and the disjunction property
• Rules with parameters in modal logic. I.
• scientific article; zbMATH DE number 4164801 (Why is no real title available?)
• An admissibility criterion for inference rules with metavariables in the modal logic S4._N
• What is an inference rule?
• ADMISSIBILITY OF RULES OF INFERENCE, AND LOGICAL EQUATIONS, IN MODAL LOGICS AXIOMATIZING PROVABILITY
• DECIDABILITY OF ADMISSIBILITY: ON A PROBLEM BY FRIEDMAN AND ITS SOLUTION BY RYBAKOV
• Satisfiability in Boolean logic (SAT problem) is polynomial
• Rules admissible in transitive temporal logic \(\mathrm{T}_{\mathrm{S}4}\), sufficient condition
• Best unifiers in transitive modal logics
• Admissible inference rules and semantic property of modal logics
• Linear temporal logic with until and next, logical consecutions

This page was built for publication: Logical equations and admissible rules of inference with parameters in modal provability logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q805609)