scholarly journals From Decidability to Undecidability by Considering Regular Sets of Instances

Author(s):  
Petra Wolf
Keyword(s):  
Optimization ◽  
2020 ◽  
pp. 1-33
Author(s):  
Samir Adly ◽  
Florent Nacry ◽  
Lionel Thibault

Author(s):  
Tuomas Orponen

AbstractI prove that closed n-regular sets $$E \subset {\mathbb {R}}^{d}$$ E ⊂ R d with plenty of big projections have big pieces of Lipschitz graphs. In particular, these sets are uniformly n-rectifiable. This answers a question of David and Semmes from 1993.


1993 ◽  
Vol 3 (1) ◽  
pp. 1-24 ◽  
Author(s):  
S. L. Bloom ◽  
Z. Ésik
Keyword(s):  

We show that, aside from the semiring equations, three equations and two equation schemes characterize the semiring of regular sets with the Kleene star operation.


1997 ◽  
pp. 19-24
Author(s):  
Dexter C. Kozen
Keyword(s):  

1977 ◽  
pp. 19-24
Author(s):  
Dexter C. Kozen
Keyword(s):  

Sign in / Sign up

Export Citation Format

Share Document