Diego Castaño, José Patricio Díaz Varela, Gabriel Savoy
The axiomatic system introduced by H'ajek axiomatizes first-order logic based on BL-chains. In this study, we extend this system with the axiom $(forall x phi)^2 leftrightarrow forall x phi^2$ and the infinitary rule [ frac{phi vee (alpha to beta^n):n in mathbb{N}}{phi vee (alpha to alpha & beta)} ] to achieve strong completeness with respect to continuous t-norms.
阿杰克（H'ajek）引入的公理系统将基于BL-链的一阶逻辑公理化。在本研究中，我们用公理$(forall x phi)^2 leftrightarrow forall x phi^2$ 和无穷规则来扩展这个系统：n in mathbb{N}}{phi vee (alpha toalpha & beta)} ]来实现关于连续规范的强完备性。
{"title":"Strong completeness for the predicate logic of the continuous t-norms","authors":"Diego Castaño, José Patricio Díaz Varela, Gabriel Savoy","doi":"arxiv-2408.04792","DOIUrl":"https://doi.org/arxiv-2408.04792","url":null,"abstract":"The axiomatic system introduced by H'ajek axiomatizes first-order logic\u0000based on BL-chains. In this study, we extend this system with the axiom\u0000$(forall x phi)^2 leftrightarrow forall x phi^2$ and the infinitary rule\u0000[ frac{phi vee (alpha to beta^n):n in mathbb{N}}{phi vee (alpha to\u0000alpha & beta)} ] to achieve strong completeness with respect to continuous\u0000t-norms.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"31 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945479","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}
For cardinals $mathfrak{a}$ and $mathfrak{b}$, we write $mathfrak{a}=^astmathfrak{b}$ if there are sets $A$ and $B$ of cardinalities $mathfrak{a}$ and $mathfrak{b}$, respectively, such that there are partial surjections from $A$ onto $B$ and from $B$ onto $A$. $=^ast$-equivalence classes are called surjective cardinals. In this article, we show that $mathsf{ZF}+mathsf{DC}_kappa$, where $kappa$ is a fixed aleph, cannot prove that surjective cardinals form a cardinal algebra, which gives a negative solution to a question proposed by Truss [J. Truss, Ann. Pure Appl. Logic 27, 165--207 (1984)]. Nevertheless, we show that surjective cardinals form a ``surjective cardinal algebra'', whose postulates are almost the same with those of a cardinal algebra, except that the refinement postulate is replaced by the finite refinement postulate. This yields a smoother proof of the cancellation law for surjective cardinals, which states that $mcdotmathfrak{a}=^ast mcdotmathfrak{b}$ implies $mathfrak{a}=^astmathfrak{b}$ for all cardinals $mathfrak{a},mathfrak{b}$ and all nonzero natural numbers $m$.
对于红心$mathfrak{a}$和$mathfrak{b}$，如果存在红心分别为$mathfrak{a}$和$mathfrak{b}$的集合$A$和$B$，从而存在从$A$到$B$和从$B$到$A$的偏射，我们就写$mathfrak{a}=^astmathfrak{b}$。$=^ast$-等价类被称为投射红心。在本文中，我们证明了$mathsf{ZF}+mathsf{DC}_kappa$，其中$kappa$是一个固定的aleph，不能证明投射红心构成了一个红心代数，这给出了特鲁斯[J. Truss, Ann. Pure Appl. Logic 27,165--207 (1984)]提出的一个问题的否定解答。然而，我们证明了投射红心构成了一个 "投射红心代数"，其公设与红心代数的公设几乎相同，只是细化公设被有限细化公设所取代。对于所有的红心数$mathfrak{a}, mathfrak{b}$和所有非零自然数$m$来说，这意味着$mathfrak{a}=^astmathfrak{b}$。
{"title":"A note on surjective cardinals","authors":"Jiaheng Jin, Guozhen Shen","doi":"arxiv-2408.04287","DOIUrl":"https://doi.org/arxiv-2408.04287","url":null,"abstract":"For cardinals $mathfrak{a}$ and $mathfrak{b}$, we write\u0000$mathfrak{a}=^astmathfrak{b}$ if there are sets $A$ and $B$ of cardinalities\u0000$mathfrak{a}$ and $mathfrak{b}$, respectively, such that there are partial\u0000surjections from $A$ onto $B$ and from $B$ onto $A$. $=^ast$-equivalence\u0000classes are called surjective cardinals. In this article, we show that\u0000$mathsf{ZF}+mathsf{DC}_kappa$, where $kappa$ is a fixed aleph, cannot prove\u0000that surjective cardinals form a cardinal algebra, which gives a negative\u0000solution to a question proposed by Truss [J. Truss, Ann. Pure Appl. Logic 27,\u0000165--207 (1984)]. Nevertheless, we show that surjective cardinals form a\u0000``surjective cardinal algebra'', whose postulates are almost the same with\u0000those of a cardinal algebra, except that the refinement postulate is replaced\u0000by the finite refinement postulate. This yields a smoother proof of the\u0000cancellation law for surjective cardinals, which states that\u0000$mcdotmathfrak{a}=^ast mcdotmathfrak{b}$ implies\u0000$mathfrak{a}=^astmathfrak{b}$ for all cardinals $mathfrak{a},mathfrak{b}$\u0000and all nonzero natural numbers $m$.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"18 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945519","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}
We exhibit a forcing for producing a model with no nowhere dense ultrafilters that satisfies the full Sacks Property. By interleaving this forcing with other forcing notions, a model containing a $(2, {aleph}_{0})$-selective ultrafilter, but no nowhere dense ultrafilters is produced. It is thus proved that the existence of $(2, {aleph}_{0})$-selective ultrafilters does not imply the existence of nowhere dense ultrafilters.
{"title":"Adding ultrafilters to Shelah's model for no nowhere dense ultrafilters","authors":"Dilip Raghavan, Juris Stepr= ans","doi":"arxiv-2408.04446","DOIUrl":"https://doi.org/arxiv-2408.04446","url":null,"abstract":"We exhibit a forcing for producing a model with no nowhere dense ultrafilters\u0000that satisfies the full Sacks Property. By interleaving this forcing with other\u0000forcing notions, a model containing a $(2, {aleph}_{0})$-selective\u0000ultrafilter, but no nowhere dense ultrafilters is produced. It is thus proved\u0000that the existence of $(2, {aleph}_{0})$-selective ultrafilters does not imply\u0000the existence of nowhere dense ultrafilters.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"27 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945520","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}
In Remarks on Galois Cohomology and Definability [2], Pillay introduced definable Galois cohomology, a model-theoretic generalization of Galois cohomology. Let $M$ be an atomic and strongly $omega$-homogeneous structure over a set of parameters $A$. Let $B$ be a normal extension of $A$ in $M$. We show that a short exact sequence of automorphism groups $1 to text{Aut}(M/B) to text{Aut}(M/A) to text{Aut}(B/A) to 1$ induces a short exact sequence in definable Galois cohomology. Our result complements the long exact sequence in definable Galois cohomology developed in More on Galois cohomology, definability and differential algebraic groups [3].
{"title":"The short exact sequence in definable Galois cohomology","authors":"David Meretzky","doi":"arxiv-2408.04147","DOIUrl":"https://doi.org/arxiv-2408.04147","url":null,"abstract":"In Remarks on Galois Cohomology and Definability [2], Pillay introduced\u0000definable Galois cohomology, a model-theoretic generalization of Galois\u0000cohomology. Let $M$ be an atomic and strongly $omega$-homogeneous structure\u0000over a set of parameters $A$. Let $B$ be a normal extension of $A$ in $M$. We\u0000show that a short exact sequence of automorphism groups $1 to text{Aut}(M/B)\u0000to text{Aut}(M/A) to text{Aut}(B/A) to 1$ induces a short exact sequence\u0000in definable Galois cohomology. Our result complements the long exact sequence\u0000in definable Galois cohomology developed in More on Galois cohomology,\u0000definability and differential algebraic groups [3].","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"48 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945521","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}
Diego Castaño, José Patricio Díaz Varela, Gabriel Savoy
We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm. We exhibit a finitary propositional calculus and show that it is finitely strongly complete with respect to this logic. This propositional calculus is then expanded with an infinitary rule to achieve strong completeness. These results are derived from properties of monadic MValgebras: functional representations of simple and finitely subdirectly irreducible algebras, as well as the finite embeddability property. We also show similar completeness theorems for the extension of the logic based on models with bounded universe.
我们研究了基于卢卡西维茨 t 规范的逻辑的 S5 模扩展。我们展示了一个有限命题微积分，并证明它相对于该逻辑是有限强完备的。我们展示了一个有限命题微积分，并证明它相对于这个逻辑是有限强完备的。然后用一个无穷规则对这个命题微积分进行扩展，以实现强完备性。这些结果源自单元 MV 对象的性质：简单和有限次直接不可还原对象的函数表示，以及有限可嵌入性性质。我们还展示了基于有界宇宙模型的逻辑扩展的类似完备性定理。
{"title":"Strong standard completeness theorems for S5-modal Lukasiewicz logics","authors":"Diego Castaño, José Patricio Díaz Varela, Gabriel Savoy","doi":"arxiv-2408.04757","DOIUrl":"https://doi.org/arxiv-2408.04757","url":null,"abstract":"We study the S5-modal expansion of the logic based on the Lukasiewicz t-norm.\u0000We exhibit a finitary propositional calculus and show that it is finitely\u0000strongly complete with respect to this logic. This propositional calculus is\u0000then expanded with an infinitary rule to achieve strong completeness. These\u0000results are derived from properties of monadic MValgebras: functional\u0000representations of simple and finitely subdirectly irreducible algebras, as\u0000well as the finite embeddability property. We also show similar completeness\u0000theorems for the extension of the logic based on models with bounded universe.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"81 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945517","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}
We build on a 1990 paper of Bukovsky and Coplakova-Hartova. First, we remove the hypothesis of $textsf{CH}$ from one of their minimality results. Then, using a measurable cardinal, we show that there is a $|aleph_2^V|=aleph_1$-minimal extension that is not a $|aleph_3^V|=aleph_1$-extension, answering the first of their questions.
{"title":"On Namba Forcing and Minimal Collapses","authors":"Maxwell Levine","doi":"arxiv-2408.03487","DOIUrl":"https://doi.org/arxiv-2408.03487","url":null,"abstract":"We build on a 1990 paper of Bukovsky and Coplakova-Hartova. First, we remove\u0000the hypothesis of $textsf{CH}$ from one of their minimality results. Then,\u0000using a measurable cardinal, we show that there is a\u0000$|aleph_2^V|=aleph_1$-minimal extension that is not a\u0000$|aleph_3^V|=aleph_1$-extension, answering the first of their questions.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"46 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945524","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}
Md Shahi Amran Hossain, Abu Shad Ahammed, Divya Prakash Biswas, Roman Obermaisser
A significant part of contemporary research in autonomous vehicles is dedicated to the development of safety critical systems where state-of-the-art artificial intelligence (AI) algorithms, like computer vision (CV), can play a major role. Vision models have great potential for the real-time detection of numerous traffic signs and obstacles, which is essential to avoid accidents and protect human lives. Despite vast potential, computer vision-based systems have critical safety concerns too if the traffic condition drifts over time. This paper represents an analysis of how data drift can affect the performance of vision models in terms of traffic sign detection. The novelty in this research is provided through a YOLO-based fusion model that is trained with drifted data from the CARLA simulator and delivers a robust and enhanced performance in object detection. The enhanced model showed an average precision of 97.5% compared to the 58.27% precision of the original model. A detailed performance review of the original and fusion models is depicted in the paper, which promises to have a significant impact on safety-critical automotive systems.
{"title":"Impact Analysis of Data Drift Towards The Development of Safety-Critical Automotive System","authors":"Md Shahi Amran Hossain, Abu Shad Ahammed, Divya Prakash Biswas, Roman Obermaisser","doi":"arxiv-2408.04476","DOIUrl":"https://doi.org/arxiv-2408.04476","url":null,"abstract":"A significant part of contemporary research in autonomous vehicles is\u0000dedicated to the development of safety critical systems where state-of-the-art\u0000artificial intelligence (AI) algorithms, like computer vision (CV), can play a\u0000major role. Vision models have great potential for the real-time detection of\u0000numerous traffic signs and obstacles, which is essential to avoid accidents and\u0000protect human lives. Despite vast potential, computer vision-based systems have\u0000critical safety concerns too if the traffic condition drifts over time. This\u0000paper represents an analysis of how data drift can affect the performance of\u0000vision models in terms of traffic sign detection. The novelty in this research\u0000is provided through a YOLO-based fusion model that is trained with drifted data\u0000from the CARLA simulator and delivers a robust and enhanced performance in\u0000object detection. The enhanced model showed an average precision of 97.5%\u0000compared to the 58.27% precision of the original model. A detailed performance\u0000review of the original and fusion models is depicted in the paper, which\u0000promises to have a significant impact on safety-critical automotive systems.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969400","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}
Rescue stations around the world receive millions of emergency rescue calls each year, most of which are due to health complications. Due to the high frequency and necessity of rescue services, there is always an increasing demand for quick, accurate, and coordinated responses from rescue personnel to save lives and mitigate damage. This paper introduces a rescue health management software solution designed to improve the efficiency and effectiveness of rescue situational awareness by rapidly assessing the health status of emergency patients using AI-driven decision support systems. The novelty in this software approach is it's user-centered design principles to ensure that its solutions are specifically tailored to meet the unique requirements of emergency responders. It used pre-trained machine learning models with rescue data and accepted new patient's input data to provide a probability of the major health complications so that rescue personnel can expedite treatment plan following the outcome. The paper focuses primarily on the software development and implementation steps with three use cases, while also providing a short overview of the previous machine learning-based development phases.
{"title":"Smart Health Software to Support Rescue Personnel in Emergency Situations","authors":"Abu Shad Ahammed, Roman Obermaisser","doi":"arxiv-2408.03739","DOIUrl":"https://doi.org/arxiv-2408.03739","url":null,"abstract":"Rescue stations around the world receive millions of emergency rescue calls\u0000each year, most of which are due to health complications. Due to the high\u0000frequency and necessity of rescue services, there is always an increasing\u0000demand for quick, accurate, and coordinated responses from rescue personnel to\u0000save lives and mitigate damage. This paper introduces a rescue health\u0000management software solution designed to improve the efficiency and\u0000effectiveness of rescue situational awareness by rapidly assessing the health\u0000status of emergency patients using AI-driven decision support systems. The\u0000novelty in this software approach is it's user-centered design principles to\u0000ensure that its solutions are specifically tailored to meet the unique\u0000requirements of emergency responders. It used pre-trained machine learning\u0000models with rescue data and accepted new patient's input data to provide a\u0000probability of the major health complications so that rescue personnel can\u0000expedite treatment plan following the outcome. The paper focuses primarily on\u0000the software development and implementation steps with three use cases, while\u0000also providing a short overview of the previous machine learning-based\u0000development phases.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"8 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945522","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}
By Lindstr"{o}m's theorems, the expressive power of first order logic (and similarly continuous logic) is not strengthened without losing some interesting property. Weakening it, is however less harmless and has been payed attention by some authors. Affine continuous logic is the fragment of continuous logic obtained by avoiding the connectives $wedge,vee$. This reduction leads to the affinization of most basic tools and technics of continuous logic such as the ultraproduct construction, compactness theorem, type, saturation etc. The affine variant of the ultraproduct construction is the ultramean construction where ultrafilters are replaced with maximal finitely additive probability measures. A consequence of this relaxation is that compact structures with at least two elements have now proper elementary extensions. In particular, they have non-categorical theories in the new setting. Thus, a model theoretic framework for study of such structures is provided. A more remarkable aspect of this logic is that the type spaces are compact convex sets. The extreme types then play a crucial role in the study of affine theories. In this text, we present the foundations of affine continuous model theory.
{"title":"Elements of affine model theory","authors":"Seyed-Mohammad Bagheri","doi":"arxiv-2408.03555","DOIUrl":"https://doi.org/arxiv-2408.03555","url":null,"abstract":"By Lindstr\"{o}m's theorems, the expressive power of first order logic (and\u0000similarly continuous logic) is not strengthened without losing some interesting\u0000property. Weakening it, is however less harmless and has been payed attention\u0000by some authors. Affine continuous logic is the fragment of continuous logic\u0000obtained by avoiding the connectives $wedge,vee$. This reduction leads to the\u0000affinization of most basic tools and technics of continuous logic such as the\u0000ultraproduct construction, compactness theorem, type, saturation etc. The\u0000affine variant of the ultraproduct construction is the ultramean construction\u0000where ultrafilters are replaced with maximal finitely additive probability\u0000measures. A consequence of this relaxation is that compact structures with at\u0000least two elements have now proper elementary extensions. In particular, they\u0000have non-categorical theories in the new setting. Thus, a model theoretic\u0000framework for study of such structures is provided. A more remarkable aspect of\u0000this logic is that the type spaces are compact convex sets. The extreme types\u0000then play a crucial role in the study of affine theories. In this text, we\u0000present the foundations of affine continuous model theory.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"11 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141945523","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}
The original notion of Solovay reducibility was introduced by Robert M. Solovay (unpublished notes) in 1975 as a measure of relative randomness. The S2a-reducibility introduced by Xizhong Zheng and Robert Rettinger (DOI:10.1007/978-3-540-27798-9_39) in 2004 is a modification of Solovay reducibility suitable for computably approximable (c.a.) reals. We demonstrate that Solovay reducibility implies S2a-reducibility on the set of c.a. reals, even with the same constant, but not vice versa.
{"title":"Solovay reducibility implies S2a-reducibility","authors":"Ivan Titov","doi":"arxiv-2408.04074","DOIUrl":"https://doi.org/arxiv-2408.04074","url":null,"abstract":"The original notion of Solovay reducibility was introduced by Robert M.\u0000Solovay (unpublished notes) in 1975 as a measure of relative randomness. The S2a-reducibility introduced by Xizhong Zheng and Robert Rettinger\u0000(DOI:10.1007/978-3-540-27798-9_39) in 2004 is a modification of Solovay\u0000reducibility suitable for computably approximable (c.a.) reals. We demonstrate that Solovay reducibility implies S2a-reducibility on the set\u0000of c.a. reals, even with the same constant, but not vice versa.","PeriodicalId":501306,"journal":{"name":"arXiv - MATH - Logic","volume":"33 1","pages":""},"PeriodicalIF":0.0,"publicationDate":"2024-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141969401","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：