The theory of hereditarily bounded sets

04/14/2021
by   Emil Jeřábek, et al.
0

We show that for any k∈ω, the structure (H_k,∈) of sets that are hereditarily of size at most k is decidable. We provide a transparent complete axiomatization of its theory, a quantifier elimination result, and tight bounds on its computational complexity. This stands in stark contrast to the structure V_ω=⋃_k H_k of hereditarily finite sets, which is well known to be bi-interpretable with the standard model of arithmetic (ℕ,+,·).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/08/2021

Presburger arithmetic with threshold counting quantifiers is easy

We give a quantifier elimination procedures for the extension of Presbur...
research
05/04/2023

The complexity of Presburger arithmetic with power or powers

We investigate expansions of Presburger arithmetic, i.e., the theory of ...
research
06/01/2018

The Complexity of Bisimulation and Simulation on Finite Systems

In this paper the computational complexity of the (bi)simulation problem...
research
02/23/2018

Definable isomorphism problem

We investigate the isomorphism problem in the setting of definable sets ...
research
08/15/2018

A theory of finite structures

We develop a novel formal theory of finite structures, based on a view o...
research
10/17/2018

On the computational complexity of MSTD sets

We outline a general algorithm for verifying whether a subset of the int...
research
11/06/2017

Computational Flows in Arithmetic

A computational flow is a pair consisting of a sequence of computational...

Please sign up or login with your details

Forgot password? Click here to reset