Scholarlink

Over forty years ago, E.P. Specker and C. Blatter discovered an astonishing meta-theorem about combinatorial counting functions definable in Monadic Second Order Logic ( \(\textrm{MSOL}\) ). In this talk we discuss extensions and limit of this theorem and its wide-ranging applications.

错误：搜索内容不能为空，请输入英文关键词
错误：关键词超出字数限制，请精简
高级检索

The Specker-Blatter Theorem: An Application of Logic to Combinatorial Counting

  • 会议论文

  • 发表日期：

    2025年

查看全文
  • Johann A. Makowsky

摘要

Over forty years ago, E.P. Specker and C. Blatter discovered an astonishing meta-theorem about combinatorial counting functions definable in Monadic Second Order Logic ( \(\textrm{MSOL}\) ). In this talk we discuss extensions and limit of this theorem and its wide-ranging applications.