Decidability of theories and sets of sentences

Results 1 to 10 of about 56 (48)

Decidability bounds for Presburger arithmetic extended by sine [PDF]

Annals of Pure and Applied Logic, 2022
We consider Presburger arithmetic extended by the sine function, call this extension sine-Presburger arithmetic ($\sin$-PA), and systematically study decision problems for sets of sentences in $\sin$-PA.
Eion Blanchard, Philipp Hieronymi
semanticscholar +1 more source

Approximate NFA Universality and Related Problems Motivated by Information Theory [PDF]

Theoretical Computer Science, 2022
In coding and information theory, it is desirable to construct maximal codes that can be either variable length codes or error control codes of fixed length.
S. Konstantinidis +4 more
semanticscholar +1 more source

An effective version of Wilkie's theorem of the complement and some effective o-minimality results

Annals of Pure and Applied Logic, 2004
Wilkie (Selecta Math. (N.S.) 5 (1999) 397) proved a “theorem of the complement” which implies that in order to establish the o-minimality of an expansion of R with C∞ functions it suffices to obtain uniform (in the parameters) bounds on the number of ...
A. Berarducci, Tamara Servi
semanticscholar +1 more source

A review of data abstraction. [PDF]