학술논문
On proving consistency of equational theories in Bounded Arithmetic
Document Type
Working Paper
Author
Source
Subject
Language
Abstract
We consider pure equational theories that allow substitution but disallow induction, which we denote as PETS, based on recursive definition of their function symbols. We show that the Bounded Arithmetic theory $S^1_2$ proves the consistency of PETS. Our approach employs models for PETS based on approximate values resembling notions from domain theory in Bounded Arithmetic, which may be of independent interest.