ML is not finitely axiomatizable over Cheq

abstract. We show that the Medvedev logic ML is not finitely axiomatizable over the logic Cheq of chequered subsets of R. This gives a negative solution to one of the questions raised by Litak [2].

• Type: Conference
• Year: 2006
• Where: AIML
• Authors: Gaëlle Fontaine
• Keywords: AIML 2006, AIML 2008, Chequered Subsets, Logic Cheq, Medvedev Logic Ml