Lindstroem’s theorem, both syntax and semantics free

DANIEL GAINA; TOMASZ KOWALSKI

首页> 外文期刊>Journal of logic and computation >Lindstroem’s theorem, both syntax and semantics free

【24h】

Lindstroem’s theorem, both syntax and semantics free

机译：Lindstroem’s theorem, both syntax and semantics free

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相关主题

摘要

Lindstroem’s theorem characterizes first-order logic in terms of its essential model theoretic properties. One cannot gainexpressive power extending first-order logic without losing at least one of compactness or downward L?wenheim–Skolemproperty. We cast this result in an abstract framework of institution theory, which does not assume any internal structureeither for sentences or for models, so it is more general than the notion of abstract logic usually used in proofs of Lindstr?m’stheorem; indeed, it can be said that institutional model theory is both syntax and semantics free. Our approach takes advantageof the methods of institutional model theory to provide a structured proof of Lindstr?m’s theorem at a level of abstractionapplicable to any logical system that is strong enough to describe its own concept of isomorphism and its own concept ofelementary equivalence.We apply our results to some logical systems formalized as institutions and widely used in computerscience practice.

著录项

来源
《Journal of logic and computation》 |2022年第5期|942-975|共34页
作者
DANIEL GAINA; TOMASZ KOWALSKI;
展开▼
作者单位

Department of Mathematics and Statistics, La TrobeUniversity, Melbourne VIC 3086, Australia and Department of Logic, Institute ofPhilosophy, Jagiellonian University, Krakow 31-044, Poland;

Institute of Mathematics for Industry, Kyushu University,Fukuoka 819-0395, Japan;

展开▼
收录信息
原文格式 PDF
正文语种英语
中图分类
关键词

Lindstroem’s theorem, both syntax and semantics free

摘要

著录项

相关主题

期刊订阅