Another Representation of Integers in Logic

スポンサーリンク

概要

• 論文の詳細を見る

• In first-order logic, natural numbers are usually represented by the terms constructed from the constant 0 and the successor function s( . ). Addition is defined recursively by two program clauses. In this paper we present another representation based on difference, and show that addition is defined by a unit clause, thus without recursion.

• 一般社団法人情報処理学会の論文
• 1993-03-31

著者

• Ohuchi Azuma

  Faculty Of Engineering Hokkaido University

• Kurihara Masahito

  Faculty Of Engineering Hokkaido University

関連論文

• Implementation of Conditional Term Rewriting Systems equipped with Meta-computation(Theory of Rewriting Systems and Its Applications)
• Modular Term Rewriting Systems with Shared Constructors
• Decomposable Termination of Composable Term Rewriting Systems
• Another Representation of Integers in Logic
• Another Representation of Integers in Logic
• Another Representation of Integers in Logic

スポンサーリンク