Jankov-style Formulas and Refutation Systems

• Authors: Alex Citkin
• Languages of publication: PL

Abstracts

PL

The paper studies the logics which algebraic semantics comprises of the Hilbert algebras endowed with additional operations - the regular algebras. With any finite subdirectly irreducible regular algebra one can associate a Jankov formula. In its turn, the Jankov formulas can be used as anti-axioms for a refutation system. It is proven that a logic has a complete refutation system based on Jankov formulas if and only if this logic enjoys finite model property. Also, such a refutation system is finite, that is, it contains a finite number of axioms and anti-axioms, if and and only if the logic is tabular.

Keywords

PL

• Publisher: [unknown2]
• Journal: Reports on Mathematical Logic
• Year: 2013
• Volume: 48

Dates

published

2013

online

07 - 07 - 2015

Contributors

author

Alex Citkin