On the nonaxiomatizability of some logics by finitely many schemas (Q1820771): Difference between revisions

After giving a definition of schema, the authors prove that the class of \((\beth_{\omega},\aleph_ 0)\) two-cardinal models, albeit recursively axiomatizable, cannot be axiomatized by finitely many schemata. As an application, it is shown that no finite collection of schemata suffice to axiomatize the logic with the quantifier ''there exist at least \(\kappa\) many'', where \(\kappa\) is a strong limit cardinal. In a final note it is announced that the same result has been proved by the first author to hold for the logic with the binary Magidor-Malitz quantifier in the \(\aleph_ 1\)-interpretation.