DeepAI AI Chat
Log In Sign Up

On proving consistency of equational theories in Bounded Arithmetic

03/09/2022
by   Arnold Beckmann, et al.
0

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

11/05/2020

Iterated multiplication in VTC^0

We show that VTC^0, the basic theory of bounded arithmetic corresponding...
09/27/2018

Induction rules in bounded arithmetic

We study variants of Buss's theories of bounded arithmetic axiomatized b...
11/06/2017

Computational Flows in Arithmetic

A computational flow is a pair consisting of a sequence of computational...
10/26/2017

Recursive functions and existentially closed structures

The purpose of this paper is to clarify the relationship between various...
01/27/2023

An Arithmetic Theory for the Poly-Time Random Functions

We introduce a new bounded theory RS^1_2 and show that the functions whi...
04/07/2019

Hierarchic Superposition Revisited

Many applications of automated deduction require reasoning in first-orde...
05/12/2021

Semantics, Verification, and Efficient Implementations for Tristate Numbers

Extended Berkeley Packet Filter(BPF)is an in-kernel, register-based virt...