Scholarlink

In Chap.  4 we have defined the class \(\textbf{T}^\omega \) of numeric terms. The definition mechanism we used was that of primitive recursion; in this type of recursion an ordering of the schematic function symbols is required. However, in practice of recursive definitions, cyclic calls among different defined functions cannot be avoided (we will see examples in Chap.  7 ).

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

Point Transition Systems

  • 章节

  • 发表日期：

    2026年

查看全文
  • Alexander Leitsch,
  • David Michael Cerna,
  • Anela Lolic

摘要

In Chap.  4 we have defined the class \(\textbf{T}^\omega \) of numeric terms. The definition mechanism we used was that of primitive recursion; in this type of recursion an ordering of the schematic function symbols is required. However, in practice of recursive definitions, cyclic calls among different defined functions cannot be avoided (we will see examples in Chap.  7 ).