1.  29
    Undecidability of the Problem of Recognizing Axiomatizations of Superintuitionistic Propositional Calculi.Evgeny Zolin - 2014 - Studia Logica 102 (5):1021-1039.
    We give a new proof of the following result : it is undecidable whether a given calculus, that is a finite set of propositional formulas together with the rules of modus ponens and substitution, axiomatizes the classical logic. Moreover, we prove the same for every superintuitionistic calculus. As a corollary, it is undecidable whether a given calculus is consistent, whether it is superintuitionistic, whether two given calculi have the same theorems, whether a given formula is derivable in a given calculus. (...)
    Direct download (3 more)  
    Export citation  
    Bookmark   2 citations  
  2.  10
    Modal Definability of First-Order Formulas with Free Variables and Query Answering.Stanislav Kikot & Evgeny Zolin - 2013 - Journal of Applied Logic 11 (2):190-216.
  3.  13
    Local Goldblatt–Thomason Theorem.Evgeny Zolin - 2015 - Logic Journal of the IGPL 23 (6):861-880.