TY - JOUR
T1 - The nonaxiomatizability of (Formula Presented) by finitely many schemata
AU - Shelah, Saharon
AU - Steinhorn, Charles
PY - 1990
Y1 - 1990
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84972500017&partnerID=8YFLogxK
U2 - 10.1305/ndjfl/1093635328
DO - 10.1305/ndjfl/1093635328
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84972500017
SN - 0029-4527
VL - 31
SP - 1
EP - 13
JO - Notre Dame Journal of Formal Logic
JF - Notre Dame Journal of Formal Logic
IS - 1
ER -