Well-Quasi Orders in Computation, Logic, Language and Reasoning:A Unifying Concept of Proof Theory, Automata Theory, Formal Languages and Descriptive Set Theory(Trends in Logic)

在计算、逻辑、语言与推理方面的拟序:证明理论、自动机理论、形式语言与描述性集合论的统一概念

逻辑学

原   价:
1767.5
售   价:
1414.00
优惠
平台大促 低至8折优惠
发货周期:预计8-10周发货
出  版 社
出版时间
2019年12月30日
装      帧
精装
ISBN
9783030302283
复制
页      码
402
语      种
英文
综合评分
暂无评分
我 要 买
- +
库存 50 本
  • 图书详情
  • 目次
  • 买家须知
  • 书评(0)
  • 权威书评(0)
图书简介
This book bridges the gaps between logic, mathematics and computer science by delving into the theory of well-quasi orders, also known as wqos. This highly active branch of combinatorics is deeply rooted in and between many fields of mathematics and logic, including proof theory, commutative algebra, braid groups, graph theory, analytic combinatorics, theory of relations, reverse mathematics and subrecursive hierarchies. As a unifying concept for slick finiteness or termination proofs, wqos have been rediscovered in diverse contexts, and proven to be extremely useful in computer science.The book introduces readers to the many facets of, and recent developments in, wqos through chapters contributed by scholars from various fields. As such, it offers a valuable asset for logicians, mathematicians and computer scientists, as well as scholars and students.
本书暂无推荐
本书暂无推荐
看了又看
  • 上一个
  • 下一个