检索结果-内蒙古大学图书馆

Discontinuities, tipping points, and singularities: the quest for a new social dynamics

ENVIRONMENT AND PLANNING B-PLANNING & DESIGN 2008年第3期35卷 379-380页

作者： Batty, Michael Centre for Advanced Spatial Analysis Univ. College London London WC1E 6BT 1-19 Torrington Place Gower Street United Kingdom

来源：评论

学校读者我要写书评

暂无评论

The selenoproteome exhibits widely varying, tissue-specific dependence on selenoprotein P for selenium supply

引用

NUCLEIC ACIDS RESEARCH 2007年第12期35卷 3963-3973页

作者： Hoffmann, Peter R. Hoge, Simone C. Li, Ping-An Hoffmann, Fukun W. Hashimoto, Ann C. Berry, Marla J. Univ Hawaii John A Burns Sch Med Dept Cell & Mol Biol Honolulu HI 96813 USA

Selenoprotein P (Sel P) is a selenium-rich glycoprotein believed to play a key role in selenium ( Se) transport throughout the body. Development of a Sel P knockout mouse model has supported this.notion and initial studies have indicated that selenium supply to various tissues is differentially affected by genetic deletion of Sel P. Se in the form of the amino acid, selenocysteine, is incorporated into selenoproteins at UGA codons. Thus, Se availability affects not only selenoprotein levels, but also the turnover of selenoprotein mRNAs via the nonsense-mediated decay pathway. We investigated how genetic deletion of Sel P in mice affected levels of the mRNAs encoding all known members of the murine selenoprotein family, as well as three non-selenoprotein factors involved in their synthesis, selenophosphate synthetase 1 (SPS1), SECIS-binding protein 2 (SBP2) and SECp43. Our findings present a comprehensive description of selenoprotein mRNA expression in the following murine tissues: brain, heart, intestine, kidney, liver, lung, spleen and testes. We also describe how abundance of selenoproteins and selenoprotein-synthesis factors are affected by genetic deletion of Sel P in some of these tissues, providing insight into how the presence of this selenoprotein influences selenoprotein mRNA levels, and thus, the selenoproteome.

关键词： .notion spleen codons mRNA levels selenocysteine selenium supply selenoproteins Nonsense-mediated Decay selenoproteome genetic deletion selenoprotein mRNAs selenoprotein family SECp

来源：评论

学校读者我要写书评

暂无评论

Pragmatic and idealized models of knowledge and ignorance

引用

AMERICAN PHILOSOPHICAL QUARTERLY 2005年第1期42卷 59-69页

作者： Walton, D Univ Winnipeg Winnipeg MB R3B 2E9 Canada

Discusses the pervasive assumption that knowledge can be a modality representing a rational agent's true and consistent beliefs. Views that it consists of true propositions; Pragmatism of the term knowledge being ... 详细信息

关键词： .notion representing shown opposed defined knows analytical philosophy collected ignorance false consistent represents AMERICAN PHILOSOPHICAL rational agent rationality assumptions true propositions so-called knowledge base conception of knowledge

来源：评论

学校读者我要写书评

暂无评论

Notes on quasiminimality and excellence

引用

BULLETIN OF SYMBOLIC LOGIC 2004年第3期10卷 334-366页

作者： Baldwin, JT Univ Illinois Dept Math Stat & Comp Sci Chicago IL USA

This paper ties together much of the model theory of the last 50 years. Shelah's attempts to generalize the Morley theorem beyond first order logic led to the.notion of excellence, which is a key to the structure theory of uncountable models. The.notion of Abstract Elementary Class arose naturally in attempting to prove the categoricity theorem for Lomega(1).omega (Q). More recently, Zilber has attempted to identify canonical mathematical structures as those whose theory (in an appropriate logic) is categorical in all powers. Zilber's trichotomy conjecture for first order categorical structures was refuted by Hrushovski, by the introducion of a special kind of Abstract Elementary Class. Zilber uses a powerful and essentailly infinitary variant on these techniques to investigate complex exponentiation. This not only demonstrates the relevance of Shelah's model theoretic investigations to mainstream mathematics but produces new results and conjectures in algebraic geometry.

关键词： .notion categorical prove nitary canonical algebraic Uses symbolic logic order logic Conjecture Morley theorem uncountable Abstract Elementary categoricity complex exponentiation NOTES ON QUASIMINIMALITY

来源：评论

学校读者我要写书评

暂无评论

Innocence and responsibility in War?

引用

CANADIAN JOURNAL OF PHILOSOPHY 2004年第4期34卷 485-506页

作者： McPherson, LK Tufts Univ Medford MA 02155 USA

Click to increase image sizeClick to decrease image size

关键词： .notion persons typically help principle accept defend WAR THEORY Responsibility in War Moral Innocence innocent civilians common view soldiers equal right kill Jeff McMahan innocence in war

来源：评论

学校读者我要写书评

暂无评论

Arguments for the continuity principle

引用

BULLETIN OF SYMBOLIC LOGIC 2002年第3期8卷 329-347页

作者： Van Atten, M Van Dalen, D Katholieke Univ Leuven Inst Philosophy Louvain Belgium Univ Utrecht Dept Philosophy NL-3584 CS Utrecht Netherlands

Together with themainar gumentinsection 2.1,sections 3.1 and 3.2s eemtoexhau stourarguments for continuity. Comparingthem, Brouwer s original formulation is the superior one. We note that 3.1 and 3.2 yield only negative results (there are no discontinuities), so Brouwer s continuity principle is appreciably stronger. We may also note that 3.1 and 3.2 are comparable in strength: the undecidability of identity for choice sequences already eliminates discontinuities, but it also rejects full PEM, hence 3.1 subsumes 3.2, not even considering the fact that 3.1 does not depend on KS. A few more observations may be added: the argument in 3.1 is perfectly generalandappliestoan.notion ofchoicesequence(sayovertheuniversal tree). Therefore it also applies to the lawlike sequences, which are given by pairs ( (n),Rn), where Rn = R0 for all n, and R0 is a law dening . Assuming that identity for lawlike sequences is not decidable, one gets negative continuity (i.e., absence of discontinuities) for lawlike sequences. Thereisnocompellingargumentfortheundecidabilityofidentityforlawlike sequences,althougharoutineBrouwerianweakcounterexampleshowsthat we cannot expect decidability. If one adds Church s Thesis, however, this undecidability can be proved. Brouwer kept clear of continuity for lawlike sequences,but theabove argumentsshowthat atleastnondiscontinuity can be defended.

关键词： .notion arguments principle initial functions Numbers continuity symbolic logic enumerable choice sequences WC segment Troelstra lawless sequences

来源：评论

学校读者我要写书评

暂无评论

Computability-theoretic complexity of countable structures

引用

BULLETIN OF SYMBOLIC LOGIC 2002年第4期8卷 457-477页

作者： Harizanov, VS George Washington Univ Dept Math Washington DC 20052 USA

1. Introduction 457 2. Elementary and atomic diagrams of prime, saturated, and other countable models 460 3. Complexity of diagrams of models of arithmetic 464 4. Turing degrees of isomorphism types 467 5. n-diagrams ... 详细信息

关键词： .notion isomorphism algebraic realized prime model theory diagrams proved obtain saturated MODELS OF ARITHMETIC symbolic logic COMPUTABILITY-THEORETIC COMPLEXITY OF COUNTABLE countable models Turing degrees computable structure complete theory

来源：评论

学校读者我要写书评

暂无评论

Step by recursive step: Church's analysis of effective calculability

引用

BULLETIN OF SYMBOLIC LOGIC 1997年第2期3卷 154-180页

作者： Sieg, W DEPARTMENTOF PHILOSOPHY CARNEGIE MELLONUNIVERSITY

Alonzo Church's mathematical work on computability and undecidability is well-known indeed, and we seem to have an excellent understanding of the context in which it arose. The approach Church took to the underlying conceptual issues, by contrast, is less well understood. Why for example, was ''Church's Thesis'' put forward publicly only in April 1935, when it had been formulated already in February/March 1934? Why did Church choose to formulate it then in terms of Godel's general recursiveness, not his own lambda-definability as he had done in 1934? A number of letters were exchanged between Church and Paul Bernays during the period from December 1934 to August 1937;they throw light on critical developments in Princeton during that period and reveal novel aspects of Church's distinctive contribution to the analysis of the informal.notion of effective calculability. In particular, they allow me to give informed, though still tentative answers to the questions I raised;the character of my answers is reflected by an alternative title for this paper, Why Church needed Godel's recursiveness for his Thesis. In Section 5, I contrast Church's analysis with that of Alan Turing and explore, in the very last section, an analogy with Dedekind's investigation of continuity.

关键词： .notion formulated Computability Church thesis symbolic logic Bernays CALCULABILITY RECURSIVE STEP CHURCH Alonzo Church general recursiveness

来源：评论

学校读者我要写书评

暂无评论

COMPUTABILITY AND RECURSION

引用

BULLETIN OF SYMBOLIC LOGIC 1996年第3期2卷 284-321页

作者： Soare, Robert I. Univ Chicago Dept Math Chicago IL 60637 USA

We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and"(general) recursiv... 详细信息

We consider the informal concept of "computability" or "effective calculability" and two of the formalisms commonly used to define it, "(Turing) computability" and"(general) recursiveness". We consider their origin, exact technical definition, concepts, history, general English meanings, how they became fixed in their present roles, how they were first and are now used, their impact on nonspecialists, how their use will affect the future content of the subject of computability theory, and its connection to other related areas.(1) After a careful historical and conceptual analysis of computability and recursion we make several recommendations in section 7 about preserving the intensional differences between the concepts of "computability" and "recursion." Specifically we recommend that: the term "recursive" should no longer carry the additional meaning of "computable" or "decidable;" functions defined using Turing machines, register machines, or their variants should be called "computable" rather than "recursive;" we should distinguish the intensional difference between Church's Thesis and Turing's Thesis, and use the latter particularly in dealing with mechanistic questions;the name of the subject should be "Computability Theory" or simply Computability rather than "Recursive Function Theory."

关键词： .notion recursion sets meanings consider name several functions ectively intensional computable Church thesis computability theory Turing Thesis Recursive Function

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：