Number theoretic density and logical limit laws
著者
書誌事項
Number theoretic density and logical limit laws
(Mathematical surveys and monographs, v. 86)
American Mathematical Society, c2001
大学図書館所蔵 全43件
  青森
  岩手
  宮城
  秋田
  山形
  福島
  茨城
  栃木
  群馬
  埼玉
  千葉
  東京
  神奈川
  新潟
  富山
  石川
  福井
  山梨
  長野
  岐阜
  静岡
  愛知
  三重
  滋賀
  京都
  大阪
  兵庫
  奈良
  和歌山
  鳥取
  島根
  岡山
  広島
  山口
  徳島
  香川
  愛媛
  高知
  福岡
  佐賀
  長崎
  熊本
  大分
  宮崎
  鹿児島
  沖縄
  韓国
  中国
  タイ
  イギリス
  ドイツ
  スイス
  フランス
  ベルギー
  オランダ
  スウェーデン
  ノルウェー
  アメリカ
注記
Includes bibliographical references (p. 281-283) and indexes
内容説明・目次
内容説明
This book shows how a study of generating series (power series in the additive case and Dirichlet series in the multiplicative case), combined with structure theorems for the finite models of a sentence, lead to general and powerful results on limit laws, including $0 - 1$ laws. The book is unique in its approach to giving a combined treatment of topics from additive as well as from multiplicative number theory, in the setting of abstract number systems, emphasizing the remarkable parallels in the two subjects.Much evidence is collected to support the thesis that local results in additive systems lift to global results in multiplicative systems. All necessary material is given to understand thoroughly the method of Compton for proving logical limit laws, including a full treatment of Ehrenfeucht-Fraisse games, the Feferman-Vaught Theorem, and Skolem's quantifier elimination for finite Boolean algebras. An intriguing aspect of the book is to see so many interesting tools from elementary mathematics pull together to answer the question: What is the probability that a randomly chosen structure has a given property? Prerequisites are undergraduate analysis and some exposure to abstract systems.
目次
Additive number systems: Background from analysis Counting functions, fundamental identities Density and partition sets The case $\rho = 1$ The case $0 < \rho < 1$ Monadic second-order limit laws Multiplicative number systems: Background from analysis Counting functions and fundamental identities Density and partition sets The case $\alpha = 0$ The case $0 < \alpha < \infty$ First-order limit laws Appendix A. Formal power series Appendix B. Refined counting Appendix C. Consequences of $\delta(\mathsf P) = 0$ Appendix D. On the monotonicity of $a(n)$ when $p(n) \leq 1$ Appendix E. Results of Woods Bibliography Symbol index Subject index.
「Nielsen BookData」 より