What is an inference rule?

DOI10.2307/2275447zbMath0761.03010OpenAlexW2074585109MaRDI QIDQ4032879

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

modal logicvalidityadmissible rulesadmissibilityEXPTIME-completestructure inferencederivable rulesPSPACE- complete

Mathematics Subject Classification ID

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

Related Items (10)

Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property ⋮ Does the deduction theorem fail for modal logic? ⋮ Reflecting rules: a note on generalizing the deduction theorem ⋮ A simple tableau system for the logic of elsewhere ⋮ Using typed lambda calculus to implement formal systems on a machine ⋮ On negation: Pure local rules ⋮ The pleasures of anticipation: Enriching intuitionistic logic ⋮ A nonstandard approach to the logical omniscience problem ⋮ A nonstandard approach to the logical omniscience problem ⋮ Explicating logical independence

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Logical equations and admissible rules of inference with parameters in modal provability logics
• Simple consequence relations
• Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
• Semantical investigations in Heyting's intuitionistic logic
• Derivability of admissible rules
• Propositional dynamic logic of regular programs
• Relationships between nondeterministic and deterministic tape complexities
• What is Logic?
• DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
• Classifying the computational complexity of problems
• Reduction of second‐order logic to modal logic
• The logical consequence relation of propositional tense logic
• The Computational Complexity of Provability in Systems of Modal Propositional Logic
• The relative efficiency of propositional proof systems
• BASES OF ADMISSIBLE RULES OF THE MODAL SYSTEM $ \mathrm{Grz}$ AND OF INTUITIONISTIC LOGIC
• The Semantics of First Degree Entailment

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