Scholarlink

Throughout this chapter, we require that all formulae are written in Polish notation and that the variables are among v0, v1, v2, . . . Notice that the former requirement is just another notation which does not involve brackets, and that by the Variable Substitution Theorem 2.13, the latter requirement gives us semantically equivalent formulae.

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

Maximally Consistent Extensions

  • 章节

  • 发表日期：

    2025年

查看全文
  • Lorenz Halbeisen,
  • Regula Krapf

摘要

Throughout this chapter, we require that all formulae are written in Polish notation and that the variables are among v0, v1, v2, . . . Notice that the former requirement is just another notation which does not involve brackets, and that by the Variable Substitution Theorem 2.13, the latter requirement gives us semantically equivalent formulae.