Anticancer Photodynamic Therapy Properties of Sulfur‐Doped Graphene Quantum Dot and Methylene Blue Preparations in MCF‐7 Breast Cancer Cell Culture

Photodynamic therapy (PDT) is a field with many applications including chemotherapy. Graphene quantum dots (GQDs) exhibit a variety of unique properties and can be used in PDT to generate singlet oxygen that destroys pathogenic bacteria and cancer cells. The PDT agent, methylene blue (MB), like GQDs, has been successfully exploited to destroy bacteria and cancer cells by increasing reactive oxygen species generation. Recently, combinations of GQDs and MB have been shown to destroy pathogenic bacteria via increased singlet oxygen generation. Here, we performed a spectrophotometric assay to detect and measure the uptake of GQDs, MB and several GQD‐MB combinations in MCF‐7 breast cancer cells. Then, we used a cell counting method to evaluate the cytotoxicity of GQDs, MB and a 1:1 GQD:MB preparation. Singlet oxygen generation in cells was then detected and measured using singlet oxygen sensor green. The dye, H₂DCFDA, was used to measure reactive oxygen species production. We found that GQD and MB uptake into MCF‐7 cells occurred, but that MB, followed by 1:1 GQD:MB, caused superior cytotoxicity and singlet oxygen and reactive oxygen species generation. Our results suggest that methylene blue's effect against MCF‐7 cells is not potentiated by GQDs, either in light or dark conditions.     

Interstitial and pseudo gaps in models of Peano Arithmetic

In this paper we study the automorphism groups of models of Peano Arithmetic. Kossak, Kotlarski, and Schmerl [9] shows that the stabilizer of an unbounded element a of a countable recursively saturated model of Peano Arithmetic M is a maximal subgroup of Aut(M) if and only if the type of a is selective. We extend this result by showing that if M is a countable arithmetically saturated model of Peano Arithmetic, Ω ? M is a very good interstice, and a ∈ Ω, then the stabilizer of a is a maximal subgroup of Aut(M) if and only if the type of a is selective and rational (© 2010 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

Decoding in the automorphism group of a recursively saturated model of arithmetic

The main result of this paper partially answers a question raised in 11 about the existence of countable just recursively saturated models of Peano Arithmetic with non‐isomorphic automorphism groups. We show the existence of infinitely many countable just recursively saturated models of Peano Arithmetic such that their automorphism groups are not topologically isomorphic. We also discuss maximal open subgroups of the automorphism group of a countable arithmetically saturated model of in a very good interstice.