Graham Priest. Towards non-being: the logic and metaphysics of intentionality. Oxford University Press, 2005, xi + 190 pp.

IF 0.7 3区 数学 Q1 LOGIC
Thomas Hofweber
{"title":"Graham Priest. Towards non-being: the logic and metaphysics of intentionality. Oxford University Press, 2005, xi + 190 pp.","authors":"Thomas Hofweber","doi":"10.1017/S1079898600001864","DOIUrl":null,"url":null,"abstract":"type-amalgamation property in the book. The model theoretic analysis also shows that the class of structures which have a smoothly approximable expansion can be characterized as the class of structures which satisfies nine model theoretic properties, a few of which have just been mentioned. Many of the results presented depend on weaker assumptions than smooth approximability, such as א0-categoricity and finite rank. As shown in [Kantor, Liebeck, Macpherson, op. cit.], every smoothly approximable structure M has the following property, called pseudofiniteness: If φ is a sentence which is true in M then φ is true in a finite substructure of M . It follows that the complete theory of a smoothly approximable structure is not finitely axiomatizable. By developing further the method of envelopes and techniques of G. Ahlbrandt and M. Ziegler (used for strongly minimal totally categorical theories) it is shown that the complete theory of any smoothly approximable structure is quasifinitely axiomatizable, meaning that the theory is axiomatized by a finite number of axiom schemes. This extends earlier results about pseudofiniteness and quasifinite axiomatizability for א0-categorical א0-stable theories. In the last chapter, which builds on methods used for quasifinite axiomatizability, decidability problems are considered. For instance, given a language with a finite signature containing only relation symbols and a sentence in this language, it is decidable whether the sentence has a stable homogeneous model. Also, in a language with finite signature, one can decide whether a sentence has a finite model with a given number of 4-types. For some results the classification of finite simple groups is used and a discussion of this is given at the end of the book. The book is technically difficult, proofs are often quite compressed and it expects that the reader is familiar with various notions from model theory and algebra; so the book demands plenty of the reader. An error (the statement of Lemma 2.4.8) is corrected in [G. Cherlin, M. Djordjević, E. Hrushovski, The Journal of Symbolic Logic, vol. 70 (2005), pp. 1359–1364]. Vera Koponen Department of Mathematics, Uppsala University, Box 480, 75106 Uppsala, Sweden. vera@math.uu.se.","PeriodicalId":55307,"journal":{"name":"Bulletin of Symbolic Logic","volume":"128 1","pages":"116 - 118"},"PeriodicalIF":0.7000,"publicationDate":"2008-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1017/S1079898600001864","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bulletin of Symbolic Logic","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.1017/S1079898600001864","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"LOGIC","Score":null,"Total":0}
引用次数: 0

Abstract

type-amalgamation property in the book. The model theoretic analysis also shows that the class of structures which have a smoothly approximable expansion can be characterized as the class of structures which satisfies nine model theoretic properties, a few of which have just been mentioned. Many of the results presented depend on weaker assumptions than smooth approximability, such as א0-categoricity and finite rank. As shown in [Kantor, Liebeck, Macpherson, op. cit.], every smoothly approximable structure M has the following property, called pseudofiniteness: If φ is a sentence which is true in M then φ is true in a finite substructure of M . It follows that the complete theory of a smoothly approximable structure is not finitely axiomatizable. By developing further the method of envelopes and techniques of G. Ahlbrandt and M. Ziegler (used for strongly minimal totally categorical theories) it is shown that the complete theory of any smoothly approximable structure is quasifinitely axiomatizable, meaning that the theory is axiomatized by a finite number of axiom schemes. This extends earlier results about pseudofiniteness and quasifinite axiomatizability for א0-categorical א0-stable theories. In the last chapter, which builds on methods used for quasifinite axiomatizability, decidability problems are considered. For instance, given a language with a finite signature containing only relation symbols and a sentence in this language, it is decidable whether the sentence has a stable homogeneous model. Also, in a language with finite signature, one can decide whether a sentence has a finite model with a given number of 4-types. For some results the classification of finite simple groups is used and a discussion of this is given at the end of the book. The book is technically difficult, proofs are often quite compressed and it expects that the reader is familiar with various notions from model theory and algebra; so the book demands plenty of the reader. An error (the statement of Lemma 2.4.8) is corrected in [G. Cherlin, M. Djordjević, E. Hrushovski, The Journal of Symbolic Logic, vol. 70 (2005), pp. 1359–1364]. Vera Koponen Department of Mathematics, Uppsala University, Box 480, 75106 Uppsala, Sweden. vera@math.uu.se.
格雷厄姆教士。走向非存在:意向性的逻辑和形而上学。牛津大学出版社,2005,11 + 190页。
书中的字体合并特性。模型理论分析还表明,具有光滑近似展开式的一类结构可以表征为满足九个模型理论性质的一类结构,其中一些性质刚才已经提到。所提出的许多结果依赖于较弱的假设,而不是光滑近似性,例如零类别和有限秩。如[Kantor, Liebeck, Macpherson,同前]所示,每一个光滑近似结构M都具有以下性质,称为伪有限性:如果φ是一个在M中为真的句子,则φ在M的有限子结构中为真。由此可见,光滑近似结构的完备理论不是有限公理化的。通过进一步发展G. Ahlbrandt和M. Ziegler的包络方法和技术(用于强极小全范畴理论),证明了任何光滑近似结构的完备理论是准有限公理化的,即该理论是由有限个公理方案公理化的。这扩展了先前关于零-范畴零稳定理论的伪有限性和准有限公理化性的结果。在最后一章中,建立了准有限公理化性的方法,考虑了可决性问题。例如,给定一种只包含关系符号的有限签名语言和该语言中的一个句子,该句子是否具有稳定的齐次模型是可判定的。此外,在具有有限签名的语言中,人们可以决定一个句子是否具有给定数量的4种类型的有限模型。对于某些结果,使用了有限单群的分类,并在本书的最后给出了对此的讨论。这本书在技术上是困难的,证明往往相当压缩,它期望读者熟悉模型理论和代数的各种概念;所以这本书对读者的要求很高。一个错误(引理2.4.8的陈述)在[G]中得到纠正。Cherlin, M. djordjeviki, E. Hrushovski,《符号逻辑学报》,vol. 70 (2005), pp. 1359-1364。乌普萨拉大学数学系,瑞典乌普萨拉75106号480号。vera@math.uu.se。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
CiteScore
0.60
自引率
0.00%
发文量
32
审稿时长
>12 weeks
期刊介绍: The Bulletin of Symbolic Logic was established in 1995 by the Association for Symbolic Logic to provide a journal of high standards that would be both accessible and of interest to as wide an audience as possible. It is designed to cover all areas within the purview of the ASL: mathematical logic and its applications, philosophical and non-classical logic and its applications, history and philosophy of logic, and philosophy and methodology of mathematics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信