Definable isomorphism problem

02/23/2018
by   Khadijeh Keshvardoost, et al.
0

We investigate the isomorphism problem in the setting of definable sets (equivalent to sets with atoms): given two definable relational structures, are they related by a definable isomorphism? Under mild assumptions on the underlying structure of atoms, we prove decidability of the problem. The core result is parameter-elimination: existence of an isomorphism definable with parameters implies existence of an isomorphism definable without parameters.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/06/2023

Most likely balls in Banach spaces: existence and non-existence

We establish a general criterion for the existence of convex sets of fix...
research
05/04/2021

Coin Flipping of Any Constant Bias Implies One-Way Functions

We show that the existence of a coin-flipping protocol safe against any ...
research
04/14/2021

The theory of hereditarily bounded sets

We show that for any k∈ω, the structure (H_k,∈) of sets that are heredit...
research
10/04/2011

On the Parameterized Complexity of Default Logic and Autoepistemic Logic

We investigate the application of Courcelle's Theorem and the logspace v...
research
02/01/2012

Reasoning about Unreliable Actions

We analyse the philosopher Davidson's semantics of actions, using a stro...
research
08/23/2018

Substitutive structure of Jeandel-Rao aperiodic tilings

We describe the substitutive structure of Jeandel-Rao aperiodic Wang til...
research
04/08/2023

No-Existence Of Generalize Diffusion

We show that given two arbitrary states |ψ⟩,|ϕ⟩ it is impossible to comp...

Please sign up or login with your details

Forgot password? Click here to reset