首页 > 最新文献

Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic最新文献

英文 中文
Decidable and Undecidable Theories 可判定理论和不可判定理论
Pub Date : 2022-02-01 DOI: 10.1142/9789811243851_0007
{"title":"Decidable and Undecidable Theories","authors":"","doi":"10.1142/9789811243851_0007","DOIUrl":"https://doi.org/10.1142/9789811243851_0007","url":null,"abstract":"","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126829875","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Algorithmic Randomness 算法的随机性
Pub Date : 2022-02-01 DOI: 10.1142/9789811243851_0008
{"title":"Algorithmic Randomness","authors":"","doi":"10.1142/9789811243851_0008","DOIUrl":"https://doi.org/10.1142/9789811243851_0008","url":null,"abstract":"","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130473394","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Nonstandard Numbers 非标准数字
Pub Date : 2022-02-01 DOI: 10.1142/9789811243851_0009
{"title":"Nonstandard Numbers","authors":"","doi":"10.1142/9789811243851_0009","DOIUrl":"https://doi.org/10.1142/9789811243851_0009","url":null,"abstract":"","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"2013 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121391088","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Propositional Logic 命题逻辑
Pub Date : 2022-02-01 DOI: 10.1142/9789811243851_0002
R. Lewis
{"title":"Propositional Logic","authors":"R. Lewis","doi":"10.1142/9789811243851_0002","DOIUrl":"https://doi.org/10.1142/9789811243851_0002","url":null,"abstract":"","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124059262","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Models of Predicate Logic 谓词逻辑模型
Pub Date : 2022-02-01 DOI: 10.1142/9789811243851_0004
{"title":"Models of Predicate Logic","authors":"","doi":"10.1142/9789811243851_0004","DOIUrl":"https://doi.org/10.1142/9789811243851_0004","url":null,"abstract":"","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"82 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125166121","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Foundations of Geometry 几何基础
Pub Date : 2022-02-01 DOI: 10.1142/9789811243851_0010
L. Clarke
{"title":"Foundations of Geometry","authors":"L. Clarke","doi":"10.1142/9789811243851_0010","DOIUrl":"https://doi.org/10.1142/9789811243851_0010","url":null,"abstract":"","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"41 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2022-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122316089","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Models of Set Theory 集合论模型
Pub Date : 2020-04-01 DOI: 10.1142/9789811201936_0008
P. Koepke
Transitive models of set theory, the relative consistency of the axiom of choice using the hereditarily ordinal definable sets, forcing conditions and generic filters, generic extensions, ZFC holds in generic extensions, the relative consistency of the continuum hypothesis and of the negation of the continuum hypothesis, possible behaviours of the function 2, the relative consistency of the negation of the axiom of choice.
集合论的传递模型,使用遗传有序可定义集合的选择公理的相对一致性,强制条件和一般滤波器,一般扩展,ZFC在一般扩展中的保持,连续统假设和连续统假设的否定的相对一致性,函数2的可能行为,选择公理否定的相对一致性。
{"title":"Models of Set Theory","authors":"P. Koepke","doi":"10.1142/9789811201936_0008","DOIUrl":"https://doi.org/10.1142/9789811201936_0008","url":null,"abstract":"Transitive models of set theory, the relative consistency of the axiom of choice using the hereditarily ordinal definable sets, forcing conditions and generic filters, generic extensions, ZFC holds in generic extensions, the relative consistency of the continuum hypothesis and of the negation of the continuum hypothesis, possible behaviours of the function 2, the relative consistency of the negation of the axiom of choice.","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128541969","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Zermelo–Fraenkel Set Theory Zermelo-Fraenkel集合理论
Pub Date : 2020-04-01 DOI: 10.1142/9789811201936_0003
James T Smith
The units on set theory and logic have used ZF set theory without specifying precisely what it is. To investigate which arguments are possible in ZF and which not, you must have a precise description of it. A major question asked during the development of ZF was what system of logic should be used as its framework. Logicians eventually agreed that the framework itself should not depend very much on set-theoretic reasoning. Investigators could then focus on the difficult problems of set theory: there would be little interplay between the framework and the subject under study. During 1920–1940, first-order logic crystallized as a convenient framework for the study of algebraic structures. Applying it does not require use of techniques commonly regarded as set-theoretic. Moreover, the Gödel completeness theorem shows that it encompasses (but doesn't necessarily simulate) many arguments that mathematicians commonly use to prove theorems expressed in a first-order language. Thus, to facilitate investigation of the scope of set theory, it seems appropriate to express it in a first-order language, and restrict it to use logic that is compatible with the first-order framework. When we apply set theory formulated that way, we can highlight the use of its major principles. They're explicitly stated in first-order set-theoretic axioms, and explicitly mentioned in first-order proofs. To be sure, some very elementary parts of set theory are involved in the underlying logical framework, necessary even to formulate those axioms and proofs. But the more powerful set-theoretic principles are displayed conspicuously. ZF is formulated in a first-order theory with minimal apparatus: • countably many variables, which we regard as varying over all sets; • no constants; • no operators; • just two predicates, equality and the binary membership predicate 0. The nonlogical axioms of ZF can be reduced to a small number, as follows. extensionality power set choice separation pair set foundation replacement union infinity The ZF axioms are kept to the minimum number in order to simplify studies of their properties. The list can be pared even further by deriving some axioms from others, but those arguments are uninformative. Each of these axioms is stated below in detail, with some remarks to show how the axioms are used to develop formally the set theory used in the various other units.
集合论和逻辑学的单元使用了ZF集合论,但没有明确说明它是什么。为了研究哪些参数在ZF中是可能的,哪些不是,您必须对它有一个精确的描述。在开发ZF的过程中,一个主要的问题是应该使用什么逻辑系统作为它的框架。逻辑学家最终一致认为,框架本身不应该太依赖于集合论推理。研究人员可以专注于集合论的难题:框架和被研究对象之间几乎没有相互作用。在1920-1940年间,一阶逻辑结晶为代数结构研究的一个方便的框架。应用它并不需要使用通常被认为是集合论的技术。此外,Gödel完备性定理表明,它包含(但不一定模拟)数学家通常用来证明用一阶语言表达的定理的许多论证。因此,为了便于研究集合论的范围,用一阶语言表达集合论似乎是合适的,并将其限制为使用与一阶框架兼容的逻辑。当我们以这种方式应用集合论时,我们可以强调其主要原理的使用。它们在一阶集合论公理中被明确地陈述,并且在一阶证明中被明确地提到。可以肯定的是,集合论的一些非常基本的部分涉及到潜在的逻辑框架,甚至是表述那些公理和证明所必需的。但更强大的集合论原理却得到了显著的展示。ZF用最小装置的一阶理论表示:•可数多个变量,我们认为它们在所有集合上都是变化的;•没有常量;•无操作员;•只有两个谓词,相等和二元成员谓词0。ZF的非逻辑公理可以简化为少量,如下。可拓性幂集选择分离对集基础置换并无穷为了简化对ZF公理性质的研究,ZF公理保持在最小数量。这个列表可以通过从其他公理中推导出一些公理来进一步缩减,但这些论证是没有信息的。下面将详细说明每一个公理,并说明如何使用这些公理来正式发展在各种其他单位中使用的集合论。
{"title":"Zermelo–Fraenkel Set Theory","authors":"James T Smith","doi":"10.1142/9789811201936_0003","DOIUrl":"https://doi.org/10.1142/9789811201936_0003","url":null,"abstract":"The units on set theory and logic have used ZF set theory without specifying precisely what it is. To investigate which arguments are possible in ZF and which not, you must have a precise description of it. A major question asked during the development of ZF was what system of logic should be used as its framework. Logicians eventually agreed that the framework itself should not depend very much on set-theoretic reasoning. Investigators could then focus on the difficult problems of set theory: there would be little interplay between the framework and the subject under study. During 1920–1940, first-order logic crystallized as a convenient framework for the study of algebraic structures. Applying it does not require use of techniques commonly regarded as set-theoretic. Moreover, the Gödel completeness theorem shows that it encompasses (but doesn't necessarily simulate) many arguments that mathematicians commonly use to prove theorems expressed in a first-order language. Thus, to facilitate investigation of the scope of set theory, it seems appropriate to express it in a first-order language, and restrict it to use logic that is compatible with the first-order framework. When we apply set theory formulated that way, we can highlight the use of its major principles. They're explicitly stated in first-order set-theoretic axioms, and explicitly mentioned in first-order proofs. To be sure, some very elementary parts of set theory are involved in the underlying logical framework, necessary even to formulate those axioms and proofs. But the more powerful set-theoretic principles are displayed conspicuously. ZF is formulated in a first-order theory with minimal apparatus: • countably many variables, which we regard as varying over all sets; • no constants; • no operators; • just two predicates, equality and the binary membership predicate 0. The nonlogical axioms of ZF can be reduced to a small number, as follows. extensionality power set choice separation pair set foundation replacement union infinity The ZF axioms are kept to the minimum number in order to simplify studies of their properties. The list can be pared even further by deriving some axioms from others, but those arguments are uninformative. Each of these axioms is stated below in detail, with some remarks to show how the axioms are used to develop formally the set theory used in the various other units.","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125321429","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cardinality and the Axiom of Choice 基数与选择公理
Pub Date : 2020-04-01 DOI: 10.1142/9789811201936_0006
{"title":"Cardinality and the Axiom of Choice","authors":"","doi":"10.1142/9789811201936_0006","DOIUrl":"https://doi.org/10.1142/9789811201936_0006","url":null,"abstract":"","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"177 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131877856","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
BACK MATTER 回到问题
Pub Date : 2020-04-01 DOI: 10.1142/9789811201936_bmatter
{"title":"BACK MATTER","authors":"","doi":"10.1142/9789811201936_bmatter","DOIUrl":"https://doi.org/10.1142/9789811201936_bmatter","url":null,"abstract":"","PeriodicalId":114605,"journal":{"name":"Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133172535","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Set Theory and Foundations of Mathematics: An Introduction to Mathematical Logic
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1