{"title":"Finite and Algorithmic Model Theory","authors":"J. Esparza, C. Michaux, C. Steinhorn","doi":"10.1017/CBO9780511974960","DOIUrl":"https://doi.org/10.1017/CBO9780511974960","url":null,"abstract":"Intended for researchers and graduate students in theoretical computer science and mathematical logic, this volume contains accessible surveys by leading researchers from areas of current work in logical aspects of computer science, where both finite and infinite model-theoretic methods play an important role. Notably, the articles in this collection emphasize points of contact and connections between finite and infinite model theory in computer science that may suggest new directions for interaction. Among the topics discussed are: algorithmic model theory, descriptive complexity theory, finite model theory, finite variable logic, model checking, model theory for restricted classes of finite structures, and spatial databases. The chapters all include extensive bibliographies facilitating deeper exploration of the literature and further research.","PeriodicalId":229879,"journal":{"name":"London Mathematical Society lecture note series","volume":"379 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-04-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128966587","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}
{"title":"Forcing with Random Variables and Proof Complexity","authors":"J. Krajícek","doi":"10.1007/11780342_29","DOIUrl":"https://doi.org/10.1007/11780342_29","url":null,"abstract":"","PeriodicalId":229879,"journal":{"name":"London Mathematical Society lecture note series","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129254650","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}
{"title":"Surveys in Combinatorics 2013","authors":"S. Blackburn, S. Gerke, M. Wildon","doi":"10.1017/CBO9781139506748","DOIUrl":"https://doi.org/10.1017/CBO9781139506748","url":null,"abstract":"Preface 1. Graph removal lemmas David Conlon and Jacob Fox 2. The geometry of covering codes: small complete caps and saturating sets in Galois spaces Massimo Giulietti 3. Bent functions and their connections to combinatorics Tor Helleseth and Alexander Kholosha 4. The complexity of change Jan van den Heuvel 5. How symmetric can maps on surfaces be? Jozef Siran 6. Some open problems on permutation patterns Einar Steingrimsson 7. The world of hereditary graph classes viewed through Truemper configurations Kristina Vuskovic 8. Structure in minor-closed classes of matroids Jim Geelen, Bert Gerards and Geoff Whittle 9. Automatic counting of tilings of skinny plane regions Shalosh B. Ekhad and Doron Zeilberger.","PeriodicalId":229879,"journal":{"name":"London Mathematical Society lecture note series","volume":"409 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130217236","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}
{"title":"Surveys in Combinatorics 2015","authors":"","doi":"10.1017/CBO9781316106853","DOIUrl":"https://doi.org/10.1017/CBO9781316106853","url":null,"abstract":"Preface Artur Czumaj, Agelos Georgakopolous, Daniel Kral', Vadim Lozin and Oleg Pikhurko 1. Ramsey classes: examples and constructions Manuel Bodirsky 2. Recent developments in graph Ramsey theory David Conlon, Jacob Fox and Benny Sudakov 3. Controllability and matchings in random bipartite graphs Paul Balister and Stefanie Gerke 4. Some old and new problems in combinatorial geometry I: around Borsuk's problem Gil Kalai 5. Randomly generated groups Tomasz Luczak 6. Curves over finite fields and linear recurring sequences Omran Ahmadi and Gary McGuire 7. New tools and results in graph minor structure theory Sergey Norin 8. Well quasi-order in combinatorics: embeddings and homomorphisms Sophie Huczynska and Nik Ruskuc 9. Constructions of block codes from algebraic curves over finite fields Liming Ma and Chaoping Xing.","PeriodicalId":229879,"journal":{"name":"London Mathematical Society lecture note series","volume":"424 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130382678","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}
{"title":"Independence-Friendly Logic - a Game-Theoretic Approach","authors":"A. Mann, G. Sandu, M. Sevenster","doi":"10.1017/CBO9780511981418","DOIUrl":"https://doi.org/10.1017/CBO9780511981418","url":null,"abstract":"Preface 1. Introduction 2. Game theory 3. First-order logic 4. Independence-friendly (IF) logic 5. Properties of IF logic 6. Expressive power of IF logic 7. Probabilistic IF logic 8. Further topics References Index.","PeriodicalId":229879,"journal":{"name":"London Mathematical Society lecture note series","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121167130","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号
求助内容：
应助结果提醒方式：