DeepAI AI Chat
Log In Sign Up

Decidability of the existential fragment of some infinitely generated trace monoids: an application to ordinals

05/08/2018
by   Alexis Bès, et al.
0

Diekert, Matiyasevich and Muscholl proved that the existential first-order theory of a trace monoid over a finite alphabet is decidable. We extend this result to a natural class of trace monoids with infinitely many generators. As an application, we prove that for every ordinal λ less than ε_0, the existential theory of the set of successor ordinals less than λ equipped with multiplication is decidable.

READ FULL TEXT

page 1

page 2

page 3

page 4

03/04/2018

Complexity and (un)decidability of fragments of 〈 ω^ω^λ; ×〉

We specify the frontier of decidability for fragments of the first-order...
01/12/2022

Sparse trace tests

We establish how the coefficients of a sparse polynomial system influenc...
04/01/2021

On Generalizing Trace Minimization

Ky Fan's trace minimization principle is extended along the line of the ...
09/18/2023

𝔽-valued trace of a finite-dimensional commutative 𝔽-algebra

A non-zero 𝔽-valued 𝔽-linear map on a finite dimensional 𝔽-algebra is ca...
10/08/2018

1-Safe Petri nets and special cube complexes: equivalence and applications

Nielsen, Plotkin, and Winskel (1981) proved that every 1-safe Petri net ...
03/23/2023

On Generalizing Trace Minimization Principles, II

This paper is concerned with establishing a trace minimization principle...
03/04/2019

Differentiable Causal Computations via Delayed Trace

We investigate causal computations taking sequences of inputs to sequenc...