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
Recommendations
admissible rulesmodal logicvalidityadmissibilityEXPTIME-completestructure inferencederivable rulesPSPACE- complete
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)
Cites Work
- Propositional dynamic logic of regular programs
- Relationships between nondeterministic and deterministic tape complexities
- The Semantics of First Degree Entailment
- Title not available (Why is that?)
- Semantical investigations in Heyting's intuitionistic logic
- Title not available (Why is that?)
- Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus
- The relative efficiency of propositional proof systems
- Derivability of admissible rules
- What is Logic?
- Simple consequence relations
- The Computational Complexity of Provability in Systems of Modal Propositional Logic
- Classifying the computational complexity of problems
- Title not available (Why is that?)
- Logical equations and admissible rules of inference with parameters in modal provability logics
- DECIDABILITY OF ADMISSIBILITY IN THE MODAL SYSTEM Grz AND IN INTUITIONISTIC LOGIC
- BASES OF ADMISSIBLE RULES OF THE MODAL SYSTEM $ \mathrm{Grz}$ AND OF INTUITIONISTIC LOGIC
- Reduction of second‐order logic to modal logic
- The logical consequence relation of propositional tense logic
Cited In (14)
- The pleasures of anticipation: Enriching intuitionistic logic
- Criteria for admissibility of inference rules. Modal and intermediate logics with the branching property
- A nonstandard approach to the logical omniscience problem
- Inference in action
- A simple tableau system for the logic of elsewhere
- Explicating logical independence
- From \((AB)a\) infer \(A^*a\)
- On negation: Pure local rules
- About the unification types of modal logics
- Reflecting rules: a note on generalizing the deduction theorem
- A nonstandard approach to the logical omniscience problem
- Admissible Rules of Lukasiewicz Logic
- Does the deduction theorem fail for modal logic?
- Using typed lambda calculus to implement formal systems on a machine
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)