The nonaxiomatizability of (Formula Presented) by finitely many schemata

Saharon Shelah*, Charles Steinhorn

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

Abstract

Under set-theoretic hypotheses, it is proved by Magidor and Malitz that logic with the Magidor-Malitz quantifier in the Ki-interpretation is recursively axiomatizable. It is shown here, under no additional set- theoretic hypotheses, that this logic cannot be axiomatized by finitely many schemata.

Original languageEnglish
Pages (from-to)1-13
Number of pages13
JournalNotre Dame Journal of Formal Logic
Volume31
Issue number1
DOIs
StatePublished - 1990

Fingerprint

Dive into the research topics of 'The nonaxiomatizability of (Formula Presented) by finitely many schemata'. Together they form a unique fingerprint.

Cite this