Entailment multipliers: an algebraic characterization of validity for classical and modal logics

Authors:
Marcelo Finger;Mauricio S. C. Hernandes
Affiliations:
Department of Computer Science, Institute of Mathematics and Statistics, University of Sao Paulo;Department of Computer Science, Institute of Mathematics and Statistics, University of Sao Paulo
Venue:
WoLLIC'10 Proceedings of the 17th international conference on Logic, language, information and computation
Year:
2010

Citing 7
Cited 0

The relative complexity of NP search problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proof complexity in algebraic systems and bounded depth Frege systems with modular counting

Computational Complexity
Modal logic

Modal logic
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Good Degree Lower Bounds on Nullstellensatz Refutations of the Induction Principle

CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Polynomial Ring Calculus for Many-Valued Logics

ISMVL '05 Proceedings of the 35th International Symposium on Multiple-Valued Logic
Cut and Pay

Journal of Logic, Language and Information

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a novel algebraic characterisation of the classical notion of validity in terms of boolean rings, called entailment multipliers. We demonstrate the existence of such multipliers and show how they can be used to derive stronger entailment statements. An interesting property of multipliers lies in their behaviour as invariants in a proof, a fact that is used to show how several inference systems can be employed to compute entailment multipliers. A similar characterisation of validity for modal logics is presented.