What is an inference rule?

DOI10.2307/2275447zbMATH Open0761.03010OpenAlexW2074585109MaRDI QIDQ4032879FDOQ4032879

Authors Ronald Fagin, Joseph Y. Halpern, Moshe Y. Vardi

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/2275447

zbMATH Keywords

admissible rulesmodal logicvalidityadmissibilityEXPTIME-completestructure inferencederivable rulesPSPACE- complete

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Other nonclassical logic (03B60) Classical propositional logic (03B05) Modal logic (including the logic of norms) (03B45) Classical first-order logic (03B10) Structure of proofs (03F07) Complexity of proofs (03F20)

Recommendations

• Complexity of admissible rules
• On the rules of intermediate logics
• Table admissible inference rules
• Admissible rules: from characterizations to applications
• On rules

Cites work

• scientific article; zbMATH DE number 4014675 (Why is no real title available?)
• scientific article; zbMATH DE number 3670430 (Why is no real title available?)
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• BASES OF ADMISSIBLE RULES OF THE MODAL SYSTEM $ \mathrm{Grz}$ AND OF INTUITIONISTIC LOGIC
• Classifying the computational complexity of problems
• DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
• Derivability of admissible rules
• 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
• Propositional dynamic logic of regular programs
• Reduction of second‐order logic to modal logic
• Relationships between nondeterministic and deterministic tape complexities
• Semantical investigations in Heyting's intuitionistic logic
• Simple consequence relations
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The Semantics of First Degree Entailment
• The logical consequence relation of propositional tense logic
• The relative efficiency of propositional proof systems
• What is Logic?

Cited in

(15)

• Inference in action
• Explicating logical independence
• A simple tableau system for the logic of elsewhere
• About the unification types of modal logics
• From \((AB)a\) infer \(A^*a\)
• Does the deduction theorem fail for modal logic?
• A nonstandard approach to the logical omniscience problem
• Reflecting rules: a note on generalizing the deduction theorem
• WHAT IS A RULE OF INFERENCE?
• Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
• Using typed lambda calculus to implement formal systems on a machine
• Admissible Rules of Lukasiewicz Logic
• A nonstandard approach to the logical omniscience problem
• The pleasures of anticipation: Enriching intuitionistic logic
• On negation: Pure local rules

This page was built for publication: What is an inference rule?

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