[Paper Review] Characteristic Formulas 50 Years Later (An Algebraic Account)

Alex Citkin|arXiv (Cornell University)|Jul 22, 2014

Advanced Algebra and Logic33 references3 citations

TL;DR

This paper generalizes Jankov's characteristic formulas to a broad class of logics by introducing an algebraic framework based on varieties with a ternary deductive (TD) term. It establishes that such varieties admit characteristic identities, enabling the construction of infinite independent sets of logics and proving decidability of equational logic in finitely axiomatized, pre-locally finite varieties.

ABSTRACT

The Jankov (characteristic) formulas were introduced by V.Jankov fifty tears ago in 1963. Nowadays the Jankov (or frame) formulas are used in virtually every branch of propositional logic: intermediate, modal, fuzzy, relevant, many-valued, etc. All these different logics have one thing in common: in one form or the other, they admit the deduction theorem. From a standpoint of algebraic logic it means that their corresponding varieties have a ternary deductive (TD) term. It is natural to extend the notion of characteristic formula to such varieties and, thus, apply this notion to an even broader class of logics, namely, to the logics which algebraic semantic is a variety with a TD term.

Motivation & Objective

• To extend the concept of Jankov's characteristic formulas beyond intermediate and modal logics to any logic whose algebraic semantics is a variety with a ternary deductive (TD) term.
• To provide a unified algebraic account of characteristic formulas that subsumes existing notions such as frame formulas, subframe formulas, and Jankov-de Jongh formulas.
• To demonstrate that the variety generated by all finite algebras in a finitely pre-approximated variety is the largest proper subvariety, thus establishing co-splitting behavior.
• To prove decidability of equational logic in finitely axiomatized, pre-locally finite varieties using the constructed characteristic identities.
• To generalize the method to quasivarieties and universal classes, including multiple-conclusion consequence relations, using negative diagrams and canonical rules.

Proposed method

• Define a characteristic identity for a finite algebra in a variety with a TD term using its positive and negative diagrams.
• Use the ternary deductive term to ensure that the characteristic identity captures the logical properties of the algebra in the variety.
• Prove that a subvariety not containing a given subdirectly irreducible algebra must be contained in the variety generated by all finite algebras of the original variety.
• Apply the concept of finite pre-approximation to show that the variety of finite algebras is co-splitting in the original variety.
• Leverage Harrop’s algorithm for finitely approximated varieties and extend the result to finitely pre-approximated ones via the TD term.
• Extend the framework to multiple-conclusion systems by using negative diagrams to define characteristic rules that detect embeddability without requiring subdirect irreducibility.

Experimental results

Research questions

• RQ1 Can the notion of characteristic formula be generalized beyond intermediate and modal logics to any logic with a ternary deductive term in its algebraic semantics?
• RQ2 Under what conditions does the variety generated by all finite algebras in a variety with a TD term become the largest proper subvariety?
• RQ3 Is equational logic decidable for finitely axiomatized, pre-locally finite varieties of algebras?
• RQ4 How can characteristic identities be adapted to quasivarieties and universal classes, particularly in the multiple-conclusion case?
• RQ5 What is the role of negative diagrams in constructing characteristic rules for partial algebras and what advantages do they offer over single-conclusion approaches?

Key findings

• Every variety with a ternary deductive term admits a characteristic identity constructed from the positive and negative diagrams of a finite algebra.
• The variety generated by all finite algebras in a finitely pre-approximated variety is the largest proper subvariety, making it co-splitting.
• If a variety is finitely approximated, its equational logic is decidable via Harrop’s algorithm; if not, the result extends to finitely pre-approximated varieties using the TD term.
• For pre-locally finite, finitely axiomatized varieties, equational logic is decidable, confirming a result previously established via pre-true identities.
• In the multiple-conclusion case, characteristic rules defined via negative diagrams can detect embeddability without requiring the source algebra to be subdirectly irreducible.
• The use of negative diagrams in partial algebras yields simpler and more general characteristic rules than in the single-conclusion case, as they do not depend on subdirect irreducibility.