Annals of Pure and Applied Logic最新文献

英文中文

Extender-based Magidor-Radin forcings without top extenders

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-03-21 DOI: 10.1016/j.apal.2025.103584

Moti Gitik , Sittinon Jirattikansakul

Continuing [1], we develop a version of Extender-based Magidor-Radin forcing where there are no extenders on the top ordinal. As an application, we provide another approach to obtain a failure of SCH on a club subset of an inaccessible cardinal, and a model where the cardinal arithmetic behaviors are different on stationary classes, whose union is the club, is provided. The cardinals and the cofinalities outside the clubs are not affected by the forcings.

引用次数: 0

Upward Löwenheim-Skolem-Tarski numbers for abstract logics

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-03-19 DOI: 10.1016/j.apal.2025.103583

Victoria Gitman , Jonathan Osinski

Galeotti, Khomskii and Väänänen recently introduced the notion of the upward Löwenheim-Skolem-Tarski number for a logic, strengthening the classical notion of a Hanf number. A cardinal κ is the upward Löwenheim-Skolem-Tarski number (ULST number) of a logic

L

if it is the least cardinal with the property that whenever M is a model of size at least κ satisfying a sentence φ in

L

, then there are arbitrarily large models satisfying φ and having M as a substructure. The substructure requirement is what differentiates the ULST number from the Hanf number and gives the notion large cardinal strength. While it is a theorem of ZFC that every logic has a Hanf number, Galeotti, Khomskii and Väänänen showed that the existence of the ULST number for second-order logic implies the existence of a partially extendible cardinal. We answer positively their conjecture that the ULST number for second-order logic is the least extendible cardinal.

We define the strong ULST number by strengthening the substructure requirement to elementary substructure. We investigate the ULST and strong ULST numbers for several classical strong logics: infinitary logics, the equicardinality logic, logic with the well-foundedness quantifier, second-order logic, and sort logics. We show that the ULST and the strong ULST numbers are characterized in some cases by classical large cardinals and in some cases by natural new large cardinal notions that they give rise to. We show that for some logics the notions of the ULST number, strong ULST number and least strong compactness cardinal coincide, while for others, it is consistent that they can be separated. Finally, we introduce a natural large cardinal notion characterizing strong compactness cardinals for the equicardinality logic.

{"title":"Upward Löwenheim-Skolem-Tarski numbers for abstract logics","authors":"Victoria Gitman , Jonathan Osinski","doi":"10.1016/j.apal.2025.103583","DOIUrl":"10.1016/j.apal.2025.103583","url":null,"abstract":"<div><div>Galeotti, Khomskii and Väänänen recently introduced the notion of the upward Löwenheim-Skolem-Tarski number for a logic, strengthening the classical notion of a Hanf number. A cardinal κ is the upward Löwenheim-Skolem-Tarski number (ULST number) of a logic <math><mi>L</mi></math> if it is the least cardinal with the property that whenever M is a model of size at least κ satisfying a sentence φ in <math><mi>L</mi></math>, then there are arbitrarily large models satisfying φ and having M as a substructure. The substructure requirement is what differentiates the ULST number from the Hanf number and gives the notion large cardinal strength. While it is a theorem of ZFC that every logic has a Hanf number, Galeotti, Khomskii and Väänänen showed that the existence of the ULST number for second-order logic implies the existence of a partially extendible cardinal. We answer positively their conjecture that the ULST number for second-order logic is the least extendible cardinal.</div><div>We define the strong ULST number by strengthening the substructure requirement to elementary substructure. We investigate the ULST and strong ULST numbers for several classical strong logics: infinitary logics, the equicardinality logic, logic with the well-foundedness quantifier, second-order logic, and sort logics. We show that the ULST and the strong ULST numbers are characterized in some cases by classical large cardinals and in some cases by natural new large cardinal notions that they give rise to. We show that for some logics the notions of the ULST number, strong ULST number and least strong compactness cardinal coincide, while for others, it is consistent that they can be separated. Finally, we introduce a natural large cardinal notion characterizing strong compactness cardinals for the equicardinality logic.</div></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"176 8","pages":"Article 103583"},"PeriodicalIF":0.6,"publicationDate":"2025-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143748012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Piecewise convex embeddability on linear orders

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-03-13 DOI: 10.1016/j.apal.2025.103581

Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein

Given a nonempty set

L

of linear orders, we say that the linear order L is

L

-convex embeddable into the linear order

L^{'}

if it is possible to partition L into convex sets indexed by some element of

L

which are isomorphic to convex subsets of

L^{'}

ordered in the same way. This notion generalizes convex embeddability and (finite) piecewise convex embeddability (both studied in [13]), which are the special cases

L = {1}

and

L = Fin

. We focus mainly on the behavior of these relations on the set of countable linear orders, first characterizing when they are transitive, and hence a quasi-order. We then study these quasi-orders from a combinatorial point of view, and analyze their complexity with respect to Borel reducibility. Finally, we extend our analysis to uncountable linear orders.

{"title":"Piecewise convex embeddability on linear orders","authors":"Martina Iannella , Alberto Marcone , Luca Motto Ros , Vadim Weinstein","doi":"10.1016/j.apal.2025.103581","DOIUrl":"10.1016/j.apal.2025.103581","url":null,"abstract":"<div><div>Given a nonempty set <math><mi>L</mi></math> of linear orders, we say that the linear order L is <math><mi>L</mi></math>-convex embeddable into the linear order <math><msup><mrow><mi>L</mi></mrow><mrow><mo>′</mo></mrow></msup></math> if it is possible to partition L into convex sets indexed by some element of <math><mi>L</mi></math> which are isomorphic to convex subsets of <math><msup><mrow><mi>L</mi></mrow><mrow><mo>′</mo></mrow></msup></math> ordered in the same way. This notion generalizes convex embeddability and (finite) piecewise convex embeddability (both studied in [13]), which are the special cases <math><mi>L</mi><mo>=</mo><mo>{</mo><mn>1</mn><mo>}</mo></math> and <math><mi>L</mi><mo>=</mo><mrow><mi>Fin</mi></mrow></math>. We focus mainly on the behavior of these relations on the set of countable linear orders, first characterizing when they are transitive, and hence a quasi-order. We then study these quasi-orders from a combinatorial point of view, and analyze their complexity with respect to Borel reducibility. Finally, we extend our analysis to uncountable linear orders.</div></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"176 8","pages":"Article 103581"},"PeriodicalIF":0.6,"publicationDate":"2025-03-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143769065","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Cardinal characteristics on bounded generalised Baire spaces

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-03-12 DOI: 10.1016/j.apal.2025.103582

Tristan van der Vlugt

We will give an overview of four families of cardinal characteristics defined on subspaces

\prod_{α \in κ} b (α)

of the generalised Baire space

{}^{κ}κ

, where κ is strongly inaccessible and

b \in^{κ} κ

. The considered families are bounded versions of the dominating, eventual difference, localisation and antilocalisation numbers, and their dual cardinals. We investigate parameters for which these cardinals are nontrivial and how the cardinals relate to each other and to other cardinals of the generalised Cichoń diagram. Finally we prove that different choices of parameters may lead to consistently distinct cardinals.

引用次数: 0

P-measures in models without P-points

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-03-10 DOI: 10.1016/j.apal.2025.103579

Piotr Borodulin-Nadzieja , Jonathan Cancino-Manríquez , Adam Morawski

We answer in negative the problem if the existence of a P-measure implies the existence of a P-point. Namely, we show that if we add random reals to a certain ‘unique P-point’ model, then in the resulting model we will have a P-measure but not P-points. Also, we investigate the question if there is a P-measure in the Silver model. We show that rapid filters cannot be extended to a P-measure in the extension by ω product of Silver forcings and that in the model obtained by the countable support

ω_{2}

-iteration of countable product of Silver forcings there are no P-measures of countable Maharam type.

引用次数: 0

A complete invariant system for noetherian BL-algebras and more general L-algebras

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-03-07 DOI: 10.1016/j.apal.2025.103580

Wolfgang Rump

Main results on BL-algebras, including their classification in the finite case, are reconsidered and extended to a class of L-algebras X with prime factorization, including BL-algebras with ascending chain condition for its lattice. The weighted forest associated with a finite BL-algebra reappears as a canonical L-subalgebra

\tilde{P} (X)

of prime elements in the self-similar closure

S (X)

where

\tilde{P} (X)

is completely determined by its underlying poset (not necessarily a forest), while the weights are associated with existing powers of the prime elements in X. These invariants determine X within its self-similar closure

S (X) = S (\tilde{P} (X))

. The three basic types of BL-algebras are related to concepts of L-algebras with further-reaching significance in quantum theory.

{"title":"A complete invariant system for noetherian BL-algebras and more general L-algebras","authors":"Wolfgang Rump","doi":"10.1016/j.apal.2025.103580","DOIUrl":"10.1016/j.apal.2025.103580","url":null,"abstract":"<div><div>Main results on BL-algebras, including their classification in the finite case, are reconsidered and extended to a class of L-algebras X with prime factorization, including BL-algebras with ascending chain condition for its lattice. The weighted forest associated with a finite BL-algebra reappears as a canonical L-subalgebra <math><mover><mrow><mi>P</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><mi>X</mi><mo>)</mo></math> of prime elements in the self-similar closure <math><mi>S</mi><mo>(</mo><mi>X</mi><mo>)</mo></math> where <math><mover><mrow><mi>P</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><mi>X</mi><mo>)</mo></math> is completely determined by its underlying poset (not necessarily a forest), while the weights are associated with existing powers of the prime elements in X. These invariants determine X within its self-similar closure <math><mi>S</mi><mo>(</mo><mi>X</mi><mo>)</mo><mo>=</mo><mi>S</mi><mo>(</mo><mover><mrow><mi>P</mi></mrow><mrow><mo>˜</mo></mrow></mover><mo>(</mo><mi>X</mi><mo>)</mo><mo>)</mo></math>. The three basic types of BL-algebras are related to concepts of L-algebras with further-reaching significance in quantum theory.</div></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"176 7","pages":"Article 103580"},"PeriodicalIF":0.6,"publicationDate":"2025-03-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143620540","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Tight cofinitary groups

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-03-04 DOI: 10.1016/j.apal.2025.103570

Vera Fischer , L. Schembecker , David Schrittesser

We introduce the notion of a tight cofinitary group, which captures forcing indestructibility of maximal cofinitary groups for a long list of partial orders, including Cohen, Sacks, Miller, Miller partition forcing and Shelah's poset for diagonalizing maximal ideals. Introducing a new robust coding technique, we establish the relative consistency of

a_{g} = d < c = ℵ_{2}

alongside the existence of a

Δ_{3}^{1}

-well-order of the reals and a co-analytic witness for

a_{g}

引用次数: 0

A finitary Kronecker's lemma and large deviations in the strong law of large numbers on Banach spaces

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-03-04 DOI: 10.1016/j.apal.2025.103569

Morenikeji Neri

We explore the computational content of Kronecker's lemma via the proof-theoretic perspective of proof mining and utilise the resulting finitary variant of this fundamental result to provide new rates for the Strong Law of Large Numbers for random variables taking values in type p Banach spaces, which in particular are very uniform in the sense that they do not depend on the distribution of the random variables. Furthermore, we provide computability-theoretic arguments to demonstrate the ineffectiveness of Kronecker's lemma and investigate the result from the perspective of Reverse Mathematics. In addition, we demonstrate how this ineffectiveness from Kronecker's lemma trickles down to the Strong Law of Large Numbers by providing a construction that shows that computable rates of convergence are not always possible. Lastly, we demonstrate how Kronecker's lemma falls under a class of deterministic formulas whose solution to their Dialectica interpretation satisfies a continuity property and how, for such formulas, one obtains an upgrade principle that allows one to lift computational interpretations of deterministic results to quantitative results for their probabilistic analogue. This result generalises the previous work of the author and Pischke.

我们通过证明挖掘的证明论视角探索克罗内克两难的计算内容，并利用这一基本结果的有限变体，为在 p 型巴拿赫空间取值的随机变量的强大数定律提供新的速率，特别是在不依赖于随机变量分布的意义上，这种速率是非常均匀的。此外，我们还提供了可计算性理论论据来证明克罗内克∞的无效性，并从逆数学的角度研究了这一结果。此外，我们还提供了一个构造，说明可计算的收敛率并不总是可能的，以此证明克罗内克两难的无效性是如何向下渗透到大数强律的。最后，我们证明了克罗内克两难如何属于一类确定性公式，其辩证解释的解满足连续性属性，以及对于这类公式，我们如何获得一个升级原理，允许我们将确定性结果的计算解释提升为其概率类似的定量结果。这一结果概括了作者和皮施克之前的工作。

{"title":"A finitary Kronecker's lemma and large deviations in the strong law of large numbers on Banach spaces","authors":"Morenikeji Neri","doi":"10.1016/j.apal.2025.103569","DOIUrl":"10.1016/j.apal.2025.103569","url":null,"abstract":"<div><div>We explore the computational content of Kronecker's lemma via the proof-theoretic perspective of proof mining and utilise the resulting finitary variant of this fundamental result to provide new rates for the Strong Law of Large Numbers for random variables taking values in type p Banach spaces, which in particular are very uniform in the sense that they do not depend on the distribution of the random variables. Furthermore, we provide computability-theoretic arguments to demonstrate the ineffectiveness of Kronecker's lemma and investigate the result from the perspective of Reverse Mathematics. In addition, we demonstrate how this ineffectiveness from Kronecker's lemma trickles down to the Strong Law of Large Numbers by providing a construction that shows that computable rates of convergence are not always possible. Lastly, we demonstrate how Kronecker's lemma falls under a class of deterministic formulas whose solution to their Dialectica interpretation satisfies a continuity property and how, for such formulas, one obtains an upgrade principle that allows one to lift computational interpretations of deterministic results to quantitative results for their probabilistic analogue. This result generalises the previous work of the author and Pischke.</div></div>","PeriodicalId":50762,"journal":{"name":"Annals of Pure and Applied Logic","volume":"176 6","pages":"Article 103569"},"PeriodicalIF":0.6,"publicationDate":"2025-03-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143562528","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Universally Sacks-indestructible combinatorial families of reals

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-03-03 DOI: 10.1016/j.apal.2025.103566

V. Fischer , L. Schembecker

We introduce the notion of an arithmetical type of combinatorial family of reals, which serves to generalize different types of families such as mad families, maximal cofinitary groups, ultrafilter bases, splitting families and other similar types of families commonly studied in combinatorial set theory.

We then prove that every combinatorial family of reals of arithmetical type which is indestructible by the product of Sacks forcing

S^{ℵ_{0}}

is in fact universally Sacks-indestructible, i.e. it is indestructible by any countably supported iteration or product of Sacks-forcing of any length. Further, under

CH

we present a unified construction of universally Sacks-indestructible families for various arithmetical types of families. In particular we prove the existence of a universally Sacks-indestructible maximal cofinitary group under

CH

引用次数: 0

Iterated reduced powers of collapsing algebras

IF 0.6 2区数学 Q2 LOGIC

Annals of Pure and Applied Logic

Pub Date : 2025-02-28 DOI: 10.1016/j.apal.2025.103567

Miloš S. Kurilić

<div><div><math><mrow><mi>rp</mi></mrow><mo>(</mo><mi>B</mi><mo>)</mo></math> denotes the reduced power <math><msup><mrow><mi>B</mi></mrow><mrow><mi>ω</mi></mrow></msup><mo>/</mo><mi>Φ</mi></math> of a Boolean algebra <math><mi>B</mi></math>, where Φ is the Fréchet filter on ω. We investigate iterated reduced powers (<math><msup><mrow><mi>rp</mi></mrow><mrow><mn>0</mn></mrow></msup><mo>(</mo><mi>B</mi><mo>)</mo><mo>=</mo><mi>B</mi></math> and <math><msup><mrow><mi>rp</mi></mrow><mrow><mi>n</mi><mo>+</mo><mn>1</mn></mrow></msup><mo>(</mo><mi>B</mi><mo>)</mo><mo>=</mo><mrow><mi>rp</mi></mrow><mo>(</mo><msup><mrow><mi>rp</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>(</mo><mi>B</mi><mo>)</mo><mo>)</mo></math>) of collapsing algebras and our main intention is to classify the algebras <math><msup><mrow><mi>rp</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>(</mo><mrow><mi>Col</mi></mrow><mo>(</mo><mi>λ</mi><mo>,</mo><mi>κ</mi><mo>)</mo><mo>)</mo></math>, <math><mi>n</mi><mo>≥</mo><mn>1</mn></math>, up to isomorphism of their Boolean completions. In particular, assuming that SCH and <math><mi>h</mi><mo>=</mo><msub><mrow><mi>ω</mi></mrow><mrow><mn>1</mn></mrow></msub></math> hold, we show that for any cardinals <math><mi>λ</mi><mo>≥</mo><mi>ω</mi></math> and <math><mi>κ</mi><mo>≥</mo><mn>2</mn></math> such that <math><mi>κ</mi><mi>λ</mi><mo>></mo><mi>ω</mi></math> and <math><mrow><mi>cf</mi></mrow><mo>(</mo><mi>λ</mi><mo>)</mo><mo>≤</mo><mi>c</mi></math> we have <math><mrow><mi>ro</mi></mrow><mo>(</mo><msup><mrow><mi>rp</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>(</mo><mrow><mi>Col</mi></mrow><mo>(</mo><mi>λ</mi><mo>,</mo><mi>κ</mi><mo>)</mo><mo>)</mo><mo>)</mo><mo>≅</mo><mrow><mi>Col</mi></mrow><mo>(</mo><msub><mrow><mi>ω</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msup><mrow><mo>(</mo><msup><mrow><mi>κ</mi></mrow><mrow><mo><</mo><mi>λ</mi></mrow></msup><mo>)</mo></mrow><mrow><mi>ω</mi></mrow></msup><mo>)</mo></math>, for each <math><mi>n</mi><mo>≥</mo><mn>1</mn></math>; more precisely,<math><mrow><mi>ro</mi></mrow><mo>(</mo><msup><mrow><mi>rp</mi></mrow><mrow><mi>n</mi></mrow></msup><mo>(</mo><mrow><mi>Col</mi></mrow><mo>(</mo><mi>λ</mi><mo>,</mo><mi>κ</mi><mo>)</mo><mo>)</mo><mo>)</mo><mo>≅</mo><mrow><mo>{</mo><mtable><mtr><mtd><mrow><mi>Col</mi></mrow><mo>(</mo><msub><mrow><mi>ω</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><mi>c</mi><mo>)</mo><mo>,</mo><mspace></mspace></mtd><mtd><mtext> if </mtext><msup><mrow><mi>κ</mi></mrow><mrow><mo><</mo><mi>λ</mi></mrow></msup><mo>≤</mo><mi>c</mi><mo>;</mo></mtd></mtr><mtr><mtd><mrow><mi>Col</mi></mrow><mo>(</mo><msub><mrow><mi>ω</mi></mrow><mrow><mn>1</mn></mrow></msub><mo>,</mo><msup><mrow><mi>κ</mi></mrow><mrow><mo><</mo><mi>λ</mi></mrow></msup><mo>)</mo><mo>,</mo><mspace></mspa

引用次数: 0

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Annals of Pure and Applied 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.

﹀