On the Expressiveness of Büchi Arithmetic

10/24/2020
by   Christoph Haase, et al.
0

We show that the existential fragment of Büchi arithmetic is strictly less expressive than full Büchi arithmetic of any base, and moreover establish that its Σ_2-fragment is already expressively complete. Furthermore, we show that regular languages of polynomial growth are definable in the existential fragment of Büchi arithmetic.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/15/2018

Rigid models of Presburger arithmetic

We present a description of rigid models of Presburger arithmetic (i.e.,...
research
02/17/2019

Applicability of Partial Ternary Full Adder in Ternary Arithmetic Units

This paper explores whether or not a complete ternary full adder, whose ...
research
02/10/2022

Complexity of Arithmetic in Warded Datalog+-

Warded Datalog+- extends the logic-based language Datalog with existenti...
research
04/10/2023

Fast polynomial arithmetic in homomorphic encryption with cyclo-multiquadratic fields

This work provides refined polynomial upper bounds for the condition num...
research
10/25/2016

On the optimality of ternary arithmetic for compactness and hardware design

In this paper, the optimality of ternary arithmetic is investigated unde...
research
07/27/2018

Enumerating Cryptarithms Using Deterministic Finite Automata

A cryptarithm is a mathematical puzzle where given an arithmetic equatio...
research
01/06/2021

On long arithmetic progressions in binary Morse-like words

We present results on the existence of long arithmetic progressions in t...

Please sign up or login with your details

Forgot password? Click here to reset