首页 > 最新文献

The Bulletin of Symbolic Logic最新文献

英文 中文
POUR-EL’S LANDSCAPE 景观
Pub Date : 2024-05-09 DOI: 10.1017/bsl.2024.26
Taishi Kurahashi, A. Visser
{"title":"POUR-EL’S LANDSCAPE","authors":"Taishi Kurahashi, A. Visser","doi":"10.1017/bsl.2024.26","DOIUrl":"https://doi.org/10.1017/bsl.2024.26","url":null,"abstract":"","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-05-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140994591","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
CATEGORICAL QUANTIFICATION 分类量化
Pub Date : 2024-01-24 DOI: 10.1017/bsl.2024.3
Constantin C. Brîncuş
{"title":"CATEGORICAL QUANTIFICATION","authors":"Constantin C. Brîncuş","doi":"10.1017/bsl.2024.3","DOIUrl":"https://doi.org/10.1017/bsl.2024.3","url":null,"abstract":"","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139602276","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
POINCARÉ-WEYL’S PREDICATIVITY: GOING BEYOND 庞加莱-韦尔的预测性:超越
Pub Date : 2024-01-19 DOI: 10.1017/bsl.2024.2
A. Avron
. On the basis of Poincar´e and Weyl’s view of predicativity as invariance, we develop an extensive framework for predicative, type-free first-order set theory in which Γ 0 and much bigger ordinals can be defined as von-Neumann ordinals. This refutes the accepted view of Γ 0 as the “limit of predicativity”.
在波恩卡和韦尔将谓性视为不变性的基础上,我们发展了一个广泛的谓性、无类型一阶集合论框架,在这个框架中,Γ 0 和更大的序可以被定义为冯-诺伊曼序。这驳斥了Γ 0 是 "谓性极限 "的公认观点。
{"title":"POINCARÉ-WEYL’S PREDICATIVITY: GOING BEYOND","authors":"A. Avron","doi":"10.1017/bsl.2024.2","DOIUrl":"https://doi.org/10.1017/bsl.2024.2","url":null,"abstract":". On the basis of Poincar´e and Weyl’s view of predicativity as invariance, we develop an extensive framework for predicative, type-free first-order set theory in which Γ 0 and much bigger ordinals can be defined as von-Neumann ordinals. This refutes the accepted view of Γ 0 as the “limit of predicativity”.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2024-01-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"139613497","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
A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF 的代数扩展中不可定义性的拓扑方法
Pub Date : 2023-09-29 DOI: 10.1017/bsl.2023.37
KIRSTEN EISENTRÄGER, RUSSELL MILLER, CALEB SPRINGER, LINDA WESTRICK
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
此内容的摘要不可用,因此提供了预览。当您可以访问此内容时,可以通过“保存PDF”操作按钮获得完整的PDF。
{"title":"A TOPOLOGICAL APPROACH TO UNDEFINABILITY IN ALGEBRAIC EXTENSIONS OF","authors":"KIRSTEN EISENTRÄGER, RUSSELL MILLER, CALEB SPRINGER, LINDA WESTRICK","doi":"10.1017/bsl.2023.37","DOIUrl":"https://doi.org/10.1017/bsl.2023.37","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135243194","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}
引用次数: 2
BSL volume 29 issue 3 Cover and Front matter BSL第29卷第3期封面和封面问题
Pub Date : 2023-09-01 DOI: 10.1017/bsl.2023.35
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
此内容的摘要不可用,因此提供了预览。当您可以访问此内容时,可以通过“保存PDF”操作按钮获得完整的PDF。
{"title":"BSL volume 29 issue 3 Cover and Front matter","authors":"","doi":"10.1017/bsl.2023.35","DOIUrl":"https://doi.org/10.1017/bsl.2023.35","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135688059","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
BSL volume 29 issue 3 Cover and Back matter BSL第29卷第3期封面和封底
Pub Date : 2023-09-01 DOI: 10.1017/bsl.2023.36
An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.
此内容的摘要不可用,因此提供了预览。当您可以访问此内容时,可以通过“保存PDF”操作按钮获得完整的PDF。
{"title":"BSL volume 29 issue 3 Cover and Back matter","authors":"","doi":"10.1017/bsl.2023.36","DOIUrl":"https://doi.org/10.1017/bsl.2023.36","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. As you have access to this content, a full PDF is available via the ‘Save PDF’ action button.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135688179","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
John MacFarlane, Philosophical Logic: A Contemporary Introduction, Routledge Contemporary Introductions to Philosophy, Routledge, New York, and London, 2021, xx + 238 pp. 约翰·麦克法兰,哲学逻辑:当代导论,劳特利奇当代哲学导论,劳特利奇,纽约和伦敦,2021年,xx + 238页。
Pub Date : 2023-09-01 DOI: 10.1017/bsl.2023.28
Bruno Bentzen
An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
此内容的摘要不可用,因此提供了预览。有关如何访问此内容的信息,请使用上面的获取访问链接。
{"title":"John MacFarlane, Philosophical Logic: A Contemporary Introduction, Routledge Contemporary Introductions to Philosophy, Routledge, New York, and London, 2021, xx + 238 pp.","authors":"Bruno Bentzen","doi":"10.1017/bsl.2023.28","DOIUrl":"https://doi.org/10.1017/bsl.2023.28","url":null,"abstract":"An abstract is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135687673","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
THREE PAPERS ON RECENT WORK ON META-VALIDITY - David Ripley, One step is enough. Journal of Philosophical Logic, vol. 51 (2022), pp. 1233–1259. - Isabella McAllister, Classical logic is not uniquely characterizable. Journal of Philosophical Logic, vol. 51 (2022), pp. 1345–1365. - Rea Golan, There is no tenable notion of global metainferential validity. Analysis, vol. 81 (2021), no. 3, pp. 411–420. 三篇关于元效度的最新研究——大卫·里普利,一步就够了。哲学逻辑杂志,vol. 51 (2022), pp. 1233-1259。——伊莎贝拉·麦卡利斯特,经典逻辑不是唯一可表征的。哲学逻辑学报,vol. 51 (2022), pp. 1345-1365。——雷亚·戈兰,没有一个站得住脚的全球元指效度概念。分析,vol. 81 (2021), no。3,第411-420页。
Pub Date : 2023-09-01 DOI: 10.1017/bsl.2023.17
Chris Scambler
THREE PAPERS ON RECENT WORK ON META-VALIDITY - David Ripley, One step is enough. Journal of Philosophical Logic, vol. 51 (2022), pp. 1233–1259. - Isabella McAllister, Classical logic is not uniquely characterizable. Journal of Philosophical Logic, vol. 51 (2022), pp. 1345–1365. - Rea Golan, There is no tenable notion of global metainferential validity. Analysis, vol. 81 (2021), no. 3, pp. 411–420. - Volume 29 Issue 3
三篇关于元效度的最新研究——大卫·里普利,一步就够了。哲学逻辑杂志,vol. 51 (2022), pp. 1233-1259。——伊莎贝拉·麦卡利斯特,经典逻辑不是唯一可表征的。哲学逻辑学报,vol. 51 (2022), pp. 1345-1365。——雷亚·戈兰,没有一个站得住脚的全球元指效度概念。分析,vol. 81 (2021), no。3,第411-420页。-第29卷第3期
{"title":"THREE PAPERS ON RECENT WORK ON META-VALIDITY - David Ripley, <i>One step is enough</i>. Journal of Philosophical Logic, vol. 51 (2022), pp. 1233–1259. - Isabella McAllister, <i>Classical logic is not uniquely characterizable</i>. Journal of Philosophical Logic, vol. 51 (2022), pp. 1345–1365. - Rea Golan, <i>There is no tenable notion of global metainferential validity</i>. Analysis, vol. 81 (2021), no. 3, pp. 411–420.","authors":"Chris Scambler","doi":"10.1017/bsl.2023.17","DOIUrl":"https://doi.org/10.1017/bsl.2023.17","url":null,"abstract":"THREE PAPERS ON RECENT WORK ON META-VALIDITY - David Ripley, One step is enough. Journal of Philosophical Logic, vol. 51 (2022), pp. 1233–1259. - Isabella McAllister, Classical logic is not uniquely characterizable. Journal of Philosophical Logic, vol. 51 (2022), pp. 1345–1365. - Rea Golan, There is no tenable notion of global metainferential validity. Analysis, vol. 81 (2021), no. 3, pp. 411–420. - Volume 29 Issue 3","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135688180","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
ASYMMETRIC CUT AND CHOOSE GAMES 非对称切割和选择游戏
Pub Date : 2023-07-28 DOI: 10.1017/bsl.2023.31
Christopher Henney-Turner, P. Holy, Philipp Schlicht, Philip Welch
{"title":"ASYMMETRIC CUT AND CHOOSE GAMES","authors":"Christopher Henney-Turner, P. Holy, Philipp Schlicht, Philip Welch","doi":"10.1017/bsl.2023.31","DOIUrl":"https://doi.org/10.1017/bsl.2023.31","url":null,"abstract":"","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-07-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"91460681","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}
引用次数: 1
INTERLEAVING LOGIC AND COUNTING 交错逻辑和计数
Pub Date : 2023-07-26 DOI: 10.1017/bsl.2023.30
J. van Benthem, Thomas F. Icard
Reasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common linguistic usage and its extension into the broader practice of natural language plus “grassroots mathematics”. We begin with a brief review of FO(#), first-order logic with counting operators and cardinality comparisons. This system is known to be of very high complexity, and drowns out finer aspects of the combination of logic and counting. We therefore move to a small fragment that can represent numerical syllogisms and basic reasoning about comparative size: monadic first-order logic with counting, MFO(#). We provide normal forms that allow for axiomatization, determine which arithmetical notions can be defined on finite and on infinite models, and conversely, we discuss which logical notions can be defined out of purely arithmetical ones, and what sort of (non-)classical logics can be induced. Next, we investigate a series of strengthenings of MFO(#), again using normal form methods. The monadic second-order version is close, in a precise sense, to additive Presburger Arithmetic, while versions with the natural device of tuple counting take us to Diophantine equations, making the logic undecidable. We also define a system ML(#) that combines basic modal logic over binary accessibility relations with counting, needed to formulate ubiquitous reasoning patterns such as the Pigeonhole Principle. We prove decidability of ML(#), and provide a new kind of bisimulation matching the expressive power of the language. As a complement to the fragment approach pursued here, we also discuss two other ways of lowering the complexity of FO(#) by changing the semantics of counting in natural ways. A first approach replaces cardinalities by abstract but well-motivated values of “mass” or other mereological aggregating notions. A second approach keeps the cardinalities but generalizes the meaning of counting to work in models that allow dependencies between variables. Finally, we return to our starting point in natural language, confronting the architecture of our formal systems with linguistic quantifier vocabulary and syntax, as well as with natural reasoning modules such as the monotonicity calculus. In addition to these encounters with formal semantics, we discuss the role of counting in semantic evaluation procedures for quantifier expressions and determine, for instance, which binary quantifiers are computable by finite “semantic automata”. We conclude with some general thoughts on yet further entanglements of logic and counting in formal systems, on rethinking the qualitative/quantitative divide, and on connecting our analysis to empirical findings in cognitive science.
自然语言中的量词推理结合了逻辑和算术的特点,超越了定性和定量的严格区分。我们的主题是在日常语言使用中出现的这种风格的合作,以及它在自然语言加“草根数学”的更广泛实践中的延伸。我们首先简要回顾一下FO(#),一阶逻辑与计数运算符和基数比较。众所周知,这个系统非常复杂,并且淹没了逻辑和计数结合的更精细的方面。因此,我们转向一个可以表示数值三段论和关于比较大小的基本推理的小片段:带计数的一元一阶逻辑,MFO(#)。我们提供了允许公理化的正规形式,确定了哪些算术概念可以在有限模型和无限模型上定义,相反,我们讨论了哪些逻辑概念可以从纯算术概念中定义,以及可以归纳出哪种(非)经典逻辑。接下来,我们研究了MFO(#)的一系列增强,同样使用范式方法。一元二阶版本在精确意义上接近于加性普雷斯伯格算术,而具有元组计数自然装置的版本将我们带入丢番图方程,使逻辑不可判定。我们还定义了一个系统ML(#),它将二进制可访问性关系上的基本模态逻辑与计数结合在一起,这是制定泛在推理模式(如鸽子洞原则)所需的。我们证明了ML(#)的可判定性,并提供了一种与语言的表达能力相匹配的新型双模拟。作为本文所追求的片段方法的补充,我们还讨论了另外两种通过以自然方式改变计数语义来降低FO(#)复杂性的方法。第一种方法是用抽象但动机良好的“质量”价值或其他气象学聚合概念取代基数。第二种方法保留基数,但将计数的含义推广到允许变量之间依赖的模型中。最后,我们回到自然语言的起点,用语言量词词汇和语法以及自然推理模块(如单调性演算)来面对我们的形式系统的架构。除了这些与形式语义的接触之外,我们还讨论了计数在量词表达式的语义评估过程中的作用,并确定,例如,哪些二进制量词是由有限的“语义自动机”计算的。我们总结了一些关于逻辑和计数在形式系统中进一步纠缠的一般性想法,关于重新思考定性/定量划分,以及将我们的分析与认知科学的经验发现联系起来。
{"title":"INTERLEAVING LOGIC AND COUNTING","authors":"J. van Benthem, Thomas F. Icard","doi":"10.1017/bsl.2023.30","DOIUrl":"https://doi.org/10.1017/bsl.2023.30","url":null,"abstract":"Reasoning with quantifier expressions in natural language combines logical and arithmetical features, transcending strict divides between qualitative and quantitative. Our topic is this cooperation of styles as it occurs in common linguistic usage and its extension into the broader practice of natural language plus “grassroots mathematics”. We begin with a brief review of FO(#), first-order logic with counting operators and cardinality comparisons. This system is known to be of very high complexity, and drowns out finer aspects of the combination of logic and counting. We therefore move to a small fragment that can represent numerical syllogisms and basic reasoning about comparative size: monadic first-order logic with counting, MFO(#). We provide normal forms that allow for axiomatization, determine which arithmetical notions can be defined on finite and on infinite models, and conversely, we discuss which logical notions can be defined out of purely arithmetical ones, and what sort of (non-)classical logics can be induced. Next, we investigate a series of strengthenings of MFO(#), again using normal form methods. The monadic second-order version is close, in a precise sense, to additive Presburger Arithmetic, while versions with the natural device of tuple counting take us to Diophantine equations, making the logic undecidable. We also define a system ML(#) that combines basic modal logic over binary accessibility relations with counting, needed to formulate ubiquitous reasoning patterns such as the Pigeonhole Principle. We prove decidability of ML(#), and provide a new kind of bisimulation matching the expressive power of the language. As a complement to the fragment approach pursued here, we also discuss two other ways of lowering the complexity of FO(#) by changing the semantics of counting in natural ways. A first approach replaces cardinalities by abstract but well-motivated values of “mass” or other mereological aggregating notions. A second approach keeps the cardinalities but generalizes the meaning of counting to work in models that allow dependencies between variables. Finally, we return to our starting point in natural language, confronting the architecture of our formal systems with linguistic quantifier vocabulary and syntax, as well as with natural reasoning modules such as the monotonicity calculus. In addition to these encounters with formal semantics, we discuss the role of counting in semantic evaluation procedures for quantifier expressions and determine, for instance, which binary quantifiers are computable by finite “semantic automata”. We conclude with some general thoughts on yet further entanglements of logic and counting in formal systems, on rethinking the qualitative/quantitative divide, and on connecting our analysis to empirical findings in cognitive science.","PeriodicalId":22265,"journal":{"name":"The Bulletin of Symbolic Logic","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2023-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"86423408","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}
引用次数: 1
期刊
The Bulletin of Symbolic 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