当前期刊: The Journal of Symbolic Logic Go to current issue    加入关注   
显示样式:        排序: IF: - GO 导出
我的关注
我的收藏
您暂时未登录!
登录
  • THE EXPONENTIAL DIOPHANTINE PROBLEM FOR
    J. Symb. Log. (IF 0.642) Pub Date : 2020-07-21
    MIHAI PRUNESCU

    We show that the set of natural numbers has an exponential diophantine definition in the rationals. It follows that the corresponding decision problem is undecidable.

    更新日期:2020-07-21
  • N-BERKELEY CARDINALS AND WEAK EXTENDER MODELS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-07-21
    RAFFAELLA CUTOLO

    For a given inner model N of ZFC, one can consider the relativized version of Berkeley cardinals in the context of ZFC, and ask if there can exist an “N-Berkeley cardinal.” In this article we provide a positive answer to this question. Indeed, under the assumption of a supercompact cardinal $\delta $ , we show that there exists a ZFC inner model N such that there is a cardinal which is N-Berkeley,

    更新日期:2020-07-21
  • COMPUTABLE LINEAR ORDERS AND PRODUCTS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-07-20
    ANDREY N. FROLOV; STEFFEN LEMPP; KENG MENG NG; GUOHUA WU

    We characterize the linear order types $\tau $ with the property that given any countable linear order $\mathcal {L}$ , $\tau \cdot \mathcal {L}$ is a computable linear order iff $\mathcal {L}$ is a computable linear order, as exactly the finite nonempty order types.

    更新日期:2020-07-20
  • VOICULESCU’S THEOREM FOR NONSEPARABLE -ALGEBRAS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-07-20
    ANDREA VACCARO

    We prove that Voiculescu’s noncommutative version of the Weyl-von Neumann Theorem can be extended to all unital, separably representable $\mathrm {C}^\ast $ -algebras whose density character is strictly smaller than the (uncountable) cardinal invariant $\mathfrak {p}$ . We show moreover that Voiculescu’s Theorem consistently fails for $\mathrm {C}^\ast $ -algebras of larger density character.

    更新日期:2020-07-20
  • HOW STRONG ARE SINGLE FIXED POINTS OF NORMAL FUNCTIONS?
    J. Symb. Log. (IF 0.642) Pub Date : 2020-07-20
    ANTON FREUND

    In a recent paper by M. Rathjen and the present author it has been shown that the statement “every normal function has a derivative” is equivalent to $\Pi ^1_1$ -bar induction. The equivalence was proved over $\mathbf {ACA_0}$ , for a suitable representation of normal functions in terms of dilators. In the present paper, we show that the statement “every normal function has at least one fixed point”

    更新日期:2020-07-20
  • FIRST-ORDER RECOGNIZABILITY IN FINITE AND PSEUDOFINITE GROUPS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-07-20
    YVES CORNULIER; JOHN S. WILSON

    It is known that there exists a first-order sentence that holds in a finite group if and only if the group is soluble. Here it is shown that the corresponding statements with ‘solubility’ replaced by ‘nilpotence’ and ‘perfectness’, among others, are false. These facts present difficulties for the study of pseudofinite groups. However, a very weak form of Frattini’s theorem on the nilpotence of the

    更新日期:2020-07-20
  • EQUATIONAL THEORIES OF FIELDS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-07-15
    AMADOR MARTIN-PIZARRO; MARTIN ZIEGLER

    A first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition. Equationality is a strengthening of stability. We show the equationality of the theory of proper extensions of algebraically closed fields and of the theory of separably closed

    更新日期:2020-07-15
  • ON CONFIGURATIONS CONCERNING CARDINAL CHARACTERISTICS AT REGULAR CARDINALS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-07-10
    OMER BEN-NERIA; SHIMON GARTI

    We study the consistency and consistency strength of various configurations concerning the cardinal characteristics $\mathfrak {s}_\theta , \mathfrak {p}_\theta , \mathfrak {t}_\theta , \mathfrak {g}_\theta , \mathfrak {r}_\theta $ at uncountable regular cardinals $\theta $ . Motivated by a theorem of Raghavan–Shelah who proved that $\mathfrak {s}_\theta \leq \mathfrak {b}_\theta $ , we explore in

    更新日期:2020-07-10
  • ON OBDD-BASED ALGORITHMS AND PROOF SYSTEMS THAT DYNAMICALLY CHANGE THE ORDER OF VARIABLES
    J. Symb. Log. (IF 0.642) Pub Date : 2020-06-22
    DMITRY ITSYKSON; ALEXANDER KNOP; ANDREI ROMASHCHENKO; DMITRY SOKOLOV

    In 2004 Atserias, Kolaitis, and Vardi proposed $\text {OBDD}$ -based propositional proof systems that prove unsatisfiability of a CNF formula by deduction of an identically false $\text {OBDD}$ from $\text {OBDD}$ s representing clauses of the initial formula. All $\text {OBDD}$ s in such proofs have the same order of variables. We initiate the study of $\text {OBDD}$ based proof systems that additionally

    更新日期:2020-06-22
  • A REFINEMENT OF THE RAMSEY HIERARCHY VIA INDESCRIBABILITY
    J. Symb. Log. (IF 0.642) Pub Date : 2020-06-22
    BRENT CODY

    We study large cardinal properties associated with Ramseyness in which homogeneous sets are demanded to satisfy various transfinite degrees of indescribability. Sharpe and Welch [25], and independently Bagaria [1], extended the notion of $\Pi ^1_n$ -indescribability where $n<\omega $ to that of $\Pi ^1_\xi $ -indescribability where $\xi \geq \omega $ . By iterating Feng’s Ramsey operator [12] on the

    更新日期:2020-06-22
  • HOMOGENEOUS STRUCTURES WITH NONUNIVERSAL AUTOMORPHISM GROUPS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-06-22
    WIESŁAW KUBIŚ; SAHARON SHELAH

    We present three examples of countable homogeneous structures (also called Fraïssé limits) whose automorphism groups are not universal, namely, fail to contain isomorphic copies of all automorphism groups of their substructures. Our first example is a particular case of a rather general construction on Fraïssé classes, which we call diversification, leading to automorphism groups containing copies

    更新日期:2020-06-22
  • THE KETONEN ORDER
    J. Symb. Log. (IF 0.642) Pub Date : 2020-06-18
    GABRIEL GOLDBERG

    We study a partial order on countably complete ultrafilters introduced by Ketonen [2] as a generalization of the Mitchell order. The following are our main results: the order is wellfounded; its linearity is equivalent to the Ultrapower Axiom, a principle introduced in the author’s dissertation [1]; finally, assuming the Ultrapower Axiom, the Ketonen order coincides with Lipschitz reducibility in the

    更新日期:2020-06-18
  • CODING IN GRAPHS AND LINEAR ORDERINGS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-06-18
    JULIA F. KNIGHT; ALEXANDRA A. SOSKOVA; STEFAN V. VATEV

    There is a Turing computable embedding $\Phi $ of directed graphs $\mathcal {A}$ in undirected graphs (see [15]). Moreover, there is a fixed tuple of formulas that give a uniform effective interpretation; i.e., for all directed graphs $\mathcal {A}$ , these formulas interpret $\mathcal {A}$ in $\Phi (\mathcal {A})$ . It follows that $\mathcal {A}$ is Medvedev reducible to $\Phi (\mathcal {A})$ uniformly;

    更新日期:2020-06-18
  • THE COMPLEXITY OF HOMEOMORPHISM RELATIONS ON SOME CLASSES OF COMPACTA
    J. Symb. Log. (IF 0.642) Pub Date : 2020-06-18
    PAWEŁ KRUPSKI; BENJAMIN VEJNAR

    We prove that the homeomorphism relation between compact spaces can be continuously reduced to the homeomorphism equivalence relation between absolute retracts, which strengthens and simplifies recent results of Chang and Gao, and Cieśla. It follows then that the homeomorphism relation of absolute retracts is Borel bireducible with the universal orbit equivalence relation. We also prove that the homeomorphism

    更新日期:2020-06-18
  • INTERPRETABILITY LOGICS AND GENERALISED VELTMAN SEMANTICS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-06-18
    LUKA MIKEC; MLADEN VUKOVIĆ

    We obtain modal completeness of the interpretability logics IL $\!\!\textsf {P}_{\textsf {0}}$ and IL R w.r.t. generalised Veltman semantics. Our proofs are based on the notion of full labels [2]. We also give shorter proofs of completeness w.r.t. the generalised semantics for many classical interpretability logics. We obtain decidability and finite model property w.r.t. the generalised semantics for

    更新日期:2020-06-18
  • DECIDING SOME MALTSEV CONDITIONS IN FINITE IDEMPOTENT ALGEBRAS
    J. Symb. Log. (IF 0.642) Pub Date : 2020-06-16
    ALEXANDR KAZDA; MATT VALERIOTE

    In this paper we investigate the computational complexity of deciding if the variety generated by a given finite idempotent algebra satisfies a special type of Maltsev condition that can be specified using a certain kind of finite labelled path. This class of Maltsev conditions includes several well known conditions, such as congruence permutability and having a sequence of n Jónsson terms, for some

    更新日期:2020-06-16
  • TWO NEW SERIES OF PRINCIPLES IN THE INTERPRETABILITY LOGIC OF ALL REASONABLE ARITHMETICAL THEORIES
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-12
    EVAN GORIS; JOOST J. JOOSTEN

    The provability logic of a theory T captures the structural behavior of formalized provability in T as provable in T itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability logics. Where provability logics are the same for all moderately sound theories of some minimal strength, interpretability logics do show variations.

    更新日期:2019-12-12
  • EHRENFEUCHT-FRAÏSSÉ GAMES ON A CLASS OF SCATTERED LINEAR ORDERS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-10
    FERESIANO MWESIGYE; JOHN KENNETH TRUSS

    Two structures A and B are n-equivalent if Player II has a winning strategy in the n-move Ehrenfeucht-Fraïssé game on A and B. In earlier articles we studied n-equivalence classes of ordinals and coloured ordinals. In this article we similarly treat a class of scattered order-types, focussing on monomials and sums of monomials in ω and its reverse ω*.

    更新日期:2019-12-10
  • ON THE EXISTENCE OF LARGE ANTICHAINS FOR DEFINABLE QUASI-ORDERS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-10
    BENJAMIN D. MILLER; ZOLTÁN VIDNYÁNSZKY

    We simultaneously generalize Silver’s perfect set theorem for co-analytic equivalence relations and Harrington-Marker-Shelah’s Dilworth-style perfect set theorem for Borel quasi-orders, establish the analogous theorem at the next definable cardinal, and give further generalizations under weaker definability conditions.

    更新日期:2019-12-10
  • ASSIGNING AN ISOMORPHISM TYPE TO A HYPERDEGREE
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-10
    HOWARD BECKER

    Let L be a computable vocabulary, let XL be the space of L-structures with universe ω and let $f:{2^\omega } \to {X_L}$ be a hyperarithmetic function such that for all $x,y \in {2^\omega }$ , if $x{ \equiv _h}y$ then $f\left( x \right) \cong f\left( y \right)$ . One of the following two properties must hold. (1) The Scott rank of f (0) is $\omega _1^{CK} + 1$ . (2) For all $x \in {2^\omega },f\left(

    更新日期:2019-12-10
  • PREDICATIVE COLLAPSING PRINCIPLES
    J. Symb. Log. (IF 0.642) Pub Date : 2019-12-09
    ANTON FREUND

    We show that arithmetical transfinite recursion is equivalent to a suitable formalization of the following: For every ordinal α there exists an ordinal β such that $1 + \beta \cdot \left( {\beta + \alpha } \right)$ (ordinal arithmetic) admits an almost order preserving collapse into β. Arithmetical comprehension is equivalent to a statement of the same form, with $\beta \cdot \alpha$ at the place of

    更新日期:2019-12-09
  • SLOW P-POINT ULTRAFILTERS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-26
    RENLING JIN

    We answer a question of Blass, Di Nasso, and Forti [2, 7] by proving, assuming Continuum Hypothesis or Martin’s Axiom, that (1) there exists a P-point which is not interval-to-one and (2) there exists an interval-to-one P-point which is neither quasi-selective nor weakly Ramsey.

    更新日期:2019-11-26
  • THE CONSISTENCY STRENGTH OF LONG PROJECTIVE DETERMINACY
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-18
    JUAN P. AGUILERA; SANDRA MÜLLER

    We determine the consistency strength of determinacy for projective games of length ω2. Our main theorem is that $\Pi _{n + 1}^1 $ -determinacy for games of length ω2 implies the existence of a model of set theory with ω + n Woodin cardinals. In a first step, we show that this hypothesis implies that there is a countable set of reals A such that Mn (A), the canonical inner model for n Woodin cardinals

    更新日期:2019-11-18
  • A MINIMAL PAIR IN THE GENERIC DEGREES
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-12
    DENIS R. HIRSCHFELDT

    We show that there is a minimal pair in the nonuniform generic degrees, and hence also in the uniform generic degrees. This fact contrasts with Igusa’s result that there are no minimal pairs for relative generic computability and answers a basic structural question mentioned in several papers in the area.

    更新日期:2019-11-12
  • RESTRICTED MAD FAMILIES
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-05
    OSVALDO GUZMÁN; MICHAEL HRUŠÁK; OSVALDO TÉLLEZ

    Let ${\cal I}$ be an ideal on ω. By cov ${}_{}^{\rm{*}}({\cal I})$ we denote the least size of a family ${\cal B} \subseteq {\cal I}$ such that for every infinite $X \in {\cal I}$ there is $B \in {\cal B}$ for which $B\mathop \cap \nolimits X$ is infinite. We say that an AD family ${\cal A} \subseteq {\cal I}$ is a MAD family restricted to ${\cal I}$ if for every infinite $X \in {\cal I}$ there is

    更新日期:2019-11-05
  • FACTORIALS OF INFINITE CARDINALS IN ZF PART I: ZF RESULTS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-04
    GUOZHEN SHEN; JIACHEN YUAN

    For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove in ZF (without the axiom of choice) several results concerning this notion, among which are the following:

    更新日期:2019-11-04
  • FACTORIALS OF INFINITE CARDINALS IN ZF PART II: CONSISTENCY RESULTS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-11-04
    GUOZHEN SHEN; JIACHEN YUAN

    For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove by the method of permutation models that the following statements are consistent with ZF:

    更新日期:2019-11-04
  • TRUTH AND FEASIBLE REDUCIBILITY
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-20
    ALI ENAYAT; MATEUSZ ŁEŁYK; BARTOSZ WCISŁO

    Let ${\cal T}$ be any of the three canonical truth theories CT− (compositional truth without extra induction), FS− (Friedman–Sheard truth without extra induction), or KF− (Kripke–Feferman truth without extra induction), where the base theory of ${\cal T}$ is PA (Peano arithmetic). We establish the following theorem, which implies that ${\cal T}$ has no more than polynomial speed-up over PA.

    更新日期:2019-09-20
  • INDESTRUCTIBILITY OF THE TREE PROPERTY
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-16
    RADEK HONZIK; ŠÁRKA STEJSKALOVÁ

    In the first part of the article, we show that if $\omega \le \kappa < \lambda$ are cardinals, ${\kappa ^{ < \kappa }} = \kappa$ , and λ is weakly compact, then in $V\left[M {\left( {\kappa ,\lambda } \right)} \right]$ the tree property at $$\lambda = \left( {\kappa ^{ + + } } \right)^{V\left[ {\left( {\kappa ,\lambda } \right)} \right]} $$ is indestructible under all ${\kappa ^ + }$ -cc forcing notions

    更新日期:2019-09-16
  • THE DETERMINED PROPERTY OF BAIRE IN REVERSE MATH
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-10
    ERIC P. ASTOR; DAMIR DZHAFAROV; ANTONIO MONTALBÁN; REED SOLOMON; LINDA BROWN WESTRICK

    We define the notion of a completely determined Borel code in reverse mathematics, and consider the principle $CD - PB$ , which states that every completely determined Borel set has the property of Baire. We show that this principle is strictly weaker than $AT{R_0}$ . Any ω-model of $CD - PB$ must be closed under hyperarithmetic reduction, but $CD - PB$ is not a theory of hyperarithmetic analysis.

    更新日期:2019-09-10
  • FORCING AND THE HALPERN–LÄUCHLI THEOREM
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-09
    NATASHA DOBRINEN; DANIEL HATHAWAY

    We investigate the effects of various forcings on several forms of the Halpern– Läuchli theorem. For inaccessible κ, we show they are preserved by forcings of size less than κ. Combining this with work of Zhang in [17] yields that the polarized partition relations associated with finite products of the κ-rationals are preserved by all forcings of size less than κ over models satisfying the Halpern–

    更新日期:2019-09-09
  • RANDOMNESS NOTIONS AND REVERSE MATHEMATICS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-09
    ANDRÉ NIES; PAUL SHAFER

    We investigate the strength of a randomness notion ${\cal R}$ as a set-existence principle in second-order arithmetic: for each Z there is an X that is ${\cal R}$ -random relative to Z. We show that the equivalence between 2-randomness and being infinitely often C-incompressible is provable in $RC{A_0}$ . We verify that $RC{A_0}$ proves the basic implications among randomness notions: 2-random $\Rightarrow$

    更新日期:2019-09-09
  • CHAITIN’S Ω AS A CONTINUOUS FUNCTION
    J. Symb. Log. (IF 0.642) Pub Date : 2019-09-09
    RUPERT HÖLZL; WOLFGANG MERKLE; JOSEPH MILLER; FRANK STEPHAN; LIANG YU

    We prove that the continuous function ${\rm{\hat \Omega }}:2^\omega \to $ that is defined via $X \mapsto \mathop \sum \limits_n 2^{ - K\left( {Xn} \right)} $ for all $X \in {2^\omega }$ is differentiable exactly at the Martin-Löf random reals with the derivative having value 0; that it is nowhere monotonic; and that $\mathop \smallint \nolimits _0^1{\rm{\hat{\Omega }}}\left( X \right)\,{\rm{d}}X$ is

    更新日期:2019-09-09
  • CHOICE-FREE STONE DUALITY
    J. Symb. Log. (IF 0.642) Pub Date : 2019-08-29
    NICK BEZHANISHVILI; WESLEY H. HOLLIDAY

    The standard topological representation of a Boolean algebra via the clopen sets of a Stone space requires a nonconstructive choice principle, equivalent to the Boolean Prime Ideal Theorem. In this article, we describe a choice-free topological representation of Boolean algebras. This representation uses a subclass of the spectral spaces that Stone used in his representation of distributive lattices

    更新日期:2019-08-29
  • THE WADGE ORDER ON THE SCOTT DOMAIN IS NOT A WELL-QUASI-ORDER
    J. Symb. Log. (IF 0.642) Pub Date : 2019-08-29
    JACQUES DUPARC; LOUIS VUILLEUMIER

    We prove that the Wadge order on the Borel subsets of the Scott domain is not a well-quasi-order, and that this feature even occurs among the sets of Borel rank at most 2. For this purpose, a specific class of countable 2-colored posets $\mathbb{P}_{emb} $ equipped with the order induced by homomorphisms is embedded into the Wadge order on the $\Delta _2^0 $ -degrees of the Scott domain. We then show

    更新日期:2019-08-29
  • HAMEL SPACES AND DISTAL EXPANSIONS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-08-29
    ALLEN GEHRET; TRAVIS NELL

    In this note, we construct a distal expansion for the structure $$\left( {; + , < ,H} \right)$$ , where $H \subseteq $ is a dense $Q$ -vector space basis of $R$ (a so-called Hamel basis). Our construction is also an expansion of the dense pair $\left( {; + , < ,} \right)$ and has full quantifier elimination in a natural language.

    更新日期:2019-08-29
  • MULTIPLE CHOICES IMPLY THE INGLETON AND KREIN–MILMAN AXIOMS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-07-12
    MARIANNE MORILLON

    In set theory without the Axiom of Choice, we consider Ingleton’s axiom which is the ultrametric counterpart of the Hahn–Banach axiom. We show that in ZFA, i.e., in the set theory without the Axiom of Choice weakened to allow “atoms,” Ingleton’s axiom does not imply the Axiom of Choice (this solves in ZFA a question raised by van Rooij, [27]). We also prove that in ZFA, the “multiple choice” axiom

    更新日期:2019-07-12
  • ON ISOMORPHISM CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-06-13
    URI ANDREWS; SERIKZHAN A. BADAEV

    We examine how degrees of computably enumerable equivalence relations (ceers) under computable reduction break down into isomorphism classes. Two ceers are isomorphic if there is a computable permutation of ω which reduces one to the other. As a method of focusing on nontrivial differences in isomorphism classes, we give special attention to weakly precomplete ceers. For any degree, we consider the

    更新日期:2019-06-13
  • A GAME CHARACTERIZING BAIRE CLASS 1 FUNCTIONS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-06-06
    VIKTOR KISS

    Duparc introduced a two-player game for a function f between zero-dimensional Polish spaces in which Player II has a winning strategy iff f is of Baire class 1. We generalize this result by defining a game for an arbitrary function f : X → Y between arbitrary Polish spaces such that Player II has a winning strategy in this game iff f is of Baire class 1. Using the strategy of Player II, we reprove

    更新日期:2019-06-06
  • COHERENT EXTENSION OF PARTIAL AUTOMORPHISMS, FREE AMALGAMATION AND AUTOMORPHISM GROUPS
    J. Symb. Log. (IF 0.642) Pub Date : 2019-05-06
    DAOUD SINIORA; SŁAWOMIR SOLECKI

    We give strengthened versions of the Herwig–Lascar and Hodkinson–Otto extension theorems for partial automorphisms of finite structures. Such strengthenings yield several combinatorial and group-theoretic consequences for homogeneous structures. For instance, we establish a coherent form of the extension property for partial automorphisms for certain Fraïssé classes. We deduce from these results that

    更新日期:2019-05-06
Contents have been reproduced by permission of the publishers.
导出
全部期刊列表>>
微生物研究
虚拟特刊
亚洲大洋洲地球科学
NPJ欢迎投稿
自然科研论文编辑
ERIS期刊投稿
欢迎阅读创刊号
自然职场,为您触达千万科研人才
spring&清华大学出版社
城市可持续发展前沿研究专辑
Springer 纳米技术权威期刊征稿
全球视野覆盖
施普林格·自然新
chemistry
物理学研究前沿热点精选期刊推荐
自然职位线上招聘会
欢迎报名注册2020量子在线大会
化学领域亟待解决的问题
材料学研究精选新
GIANT
ACS ES&T Engineering
ACS ES&T Water
屿渡论文,编辑服务
阿拉丁试剂right
上海中医药大学
浙江大学
西湖大学
化学所
北京大学
山东大学
隐藏1h前已浏览文章
课题组网站
新版X-MOL期刊搜索和高级搜索功能介绍
ACS材料视界
南方科技大学
南开大学
清华大学
天合科研
x-mol收录
试剂库存
down
wechat
bug