Translator Disclaimer
Summer 1997 Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction
Osamu Takaki
Notre Dame J. Formal Logic 38(3): 350-373 (Summer 1997). DOI: 10.1305/ndjfl/1039700743

Abstract

We prove the strong normalization theorem for the natural deduction system for the constructive arithmetic TRDB (the system with Definition by Transfinite Recursion and Bar induction), which was introduced by Yasugi and Hayashi. We also establish the consistency of this system, applying the strong normalization theorem.

Citation

Download Citation

Osamu Takaki. "Strong Normalization Theorem for a Constructive Arithmetic with Definition by Transfinite Recursion and Bar Induction." Notre Dame J. Formal Logic 38 (3) 350 - 373, Summer 1997. https://doi.org/10.1305/ndjfl/1039700743

Information

Published: Summer 1997
First available in Project Euclid: 12 December 2002

zbMATH: 0937.03067
MathSciNet: MR1624946
Digital Object Identifier: 10.1305/ndjfl/1039700743

Subjects:
Primary: 03F05
Secondary: 03F10

Rights: Copyright © 1997 University of Notre Dame

JOURNAL ARTICLE
24 PAGES


SHARE
Vol.38 • No. 3 • Summer 1997
Back to Top