This new volume of the [-series is written as an introduction to first order stability theory. It is organized around the the spectrum problem: calculate the number of models a first order theory T has in each uncountable cardinal. To solve this problem a generalization of the notion of algebraic independence "nonforking" was developed. In this text the abstract properties of this relation (in contrast to other books which begin with the technical description). The important notions of orthogonality and regularity are carefully developed: this machinery is then applied to the spectrum problem. Complete proofs of the Vaught conjecture for omega-stable theories are presented here for the first time in book form. Considerable effort has been made by the author to provide much needed examples. In particular, the book contains the first publication of Shelah's infamous example showing the necessity of his methods to solve Vaught's conjecture for omega-stable theories. The connections of abstract stability theory with algebra particularly with the theory of modules are emphasized.
{"title":"Fundamentals of Stability Theory","authors":"J. Baldwin","doi":"10.1017/9781316717035","DOIUrl":"https://doi.org/10.1017/9781316717035","url":null,"abstract":"This new volume of the [-series is written as an introduction to first order stability theory. It is organized around the the spectrum problem: calculate the number of models a first order theory T has in each uncountable cardinal. To solve this problem a generalization of the notion of algebraic independence \"nonforking\" was developed. In this text the abstract properties of this relation (in contrast to other books which begin with the technical description). The important notions of orthogonality and regularity are carefully developed: this machinery is then applied to the spectrum problem. Complete proofs of the Vaught conjecture for omega-stable theories are presented here for the first time in book form. Considerable effort has been made by the author to provide much needed examples. In particular, the book contains the first publication of Shelah's infamous example showing the necessity of his methods to solve Vaught's conjecture for omega-stable theories. The connections of abstract stability theory with algebra particularly with the theory of modules are emphasized.","PeriodicalId":400496,"journal":{"name":"Perspectives in Logic","volume":"108 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127941803","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}
Stability theory began in the early 1960s with the work of Michael Morley, and progressed in the 1970s through Shelah's research in model-theoretic classification theory. In the mid-1990s, stability theory both influences and is influenced by number theory, algebraic group theory, Riemann surfaces and representation theory of modules. The aim of this text is to provide students with a quick route from basic model theory to research in stability theory, and to give an introduction to classification theory with an exposition of Morley's categoricity theorem.
{"title":"Essential Stability Theory","authors":"S. Buechler","doi":"10.1017/9781316717257","DOIUrl":"https://doi.org/10.1017/9781316717257","url":null,"abstract":"Stability theory began in the early 1960s with the work of Michael Morley, and progressed in the 1970s through Shelah's research in model-theoretic classification theory. In the mid-1990s, stability theory both influences and is influenced by number theory, algebraic group theory, Riemann surfaces and representation theory of modules. The aim of this text is to provide students with a quick route from basic model theory to research in stability theory, and to give an introduction to classification theory with an exposition of Morley's categoricity theorem.","PeriodicalId":400496,"journal":{"name":"Perspectives in Logic","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134410395","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}
Pub Date : 2013-07-31DOI: 10.1017/cbo9781139032636
H. Barendregt, W. Dekkers, R. Statman
This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.
{"title":"Lambda Calculus with Types","authors":"H. Barendregt, W. Dekkers, R. Statman","doi":"10.1017/cbo9781139032636","DOIUrl":"https://doi.org/10.1017/cbo9781139032636","url":null,"abstract":"This handbook with exercises reveals in formalisms, hitherto mainly used for hardware and software design and verification, unexpected mathematical beauty. The lambda calculus forms a prototype universal programming language, which in its untyped version is related to Lisp, and was treated in the first author's classic The Lambda Calculus (1984). The formalism has since been extended with types and used in functional programming (Haskell, Clean) and proof assistants (Coq, Isabelle, HOL), used in designing and verifying IT products and mathematical proofs. In this book, the authors focus on three classes of typing for lambda terms: simple types, recursive types and intersection types. It is in these three formalisms of terms and types that the unexpected mathematical beauty is revealed. The treatment is authoritative and comprehensive, complemented by an exhaustive bibliography, and numerous exercises are provided to deepen the readers' understanding and increase their confidence using types.","PeriodicalId":400496,"journal":{"name":"Perspectives in Logic","volume":"28 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127001558","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}
Pub Date : 2012-01-16DOI: 10.1017/cbo9781139031905
H. Schwichtenberg, S. Wainer
Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gdel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to 11-CA0. Ordinal analysis and the (Schwichtenberg-Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and 11-CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.
{"title":"Proofs and Computations","authors":"H. Schwichtenberg, S. Wainer","doi":"10.1017/cbo9781139031905","DOIUrl":"https://doi.org/10.1017/cbo9781139031905","url":null,"abstract":"Driven by the question, 'What is the computational content of a (formal) proof?', this book studies fundamental interactions between proof theory and computability. It provides a unique self-contained text for advanced students and researchers in mathematical logic and computer science. Part I covers basic proof theory, computability and Gdel's theorems. Part II studies and classifies provable recursion in classical systems, from fragments of Peano arithmetic up to 11-CA0. Ordinal analysis and the (Schwichtenberg-Wainer) subrecursive hierarchies play a central role and are used in proving the 'modified finite Ramsey' and 'extended Kruskal' independence results for PA and 11-CA0. Part III develops the theoretical underpinnings of the first author's proof assistant MINLOG. Three chapters cover higher-type computability via information systems, a constructive theory TCF of computable functionals, realizability, Dialectica interpretation, computationally significant quantifiers and connectives and polytime complexity in a two-sorted, higher-type arithmetic with linear logic.","PeriodicalId":400496,"journal":{"name":"Perspectives in Logic","volume":"46 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-01-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114454576","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
扫码关注我们
求助内容：
应助结果提醒方式：