Showing cs.LOShow all
3 papers · 1 filter
cs.LO2025
Decision algorithms for fragments of real analysis. III: A theory of differentiable functions with (semi-)open intervals
G. Buriola, D. Cantone, G. Cincotti +2
This paper enriches preexisting satisfiability tests for unquantified languages, which in turn augment a fragment of Tarski's elementary algebra with unary real functions possessin…
cs.LO2025
Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy
Liesbeth De Mol, Yuri V. Matiyasevich, Eugenio G. Omodeo +3
In his autobiographic essay written in 1999, ``From logic to computer science and back'', Martin David Davis (3/8/1928--1/1/2023) indicated that he viewed himself as a logician \em…
cs.LO2021
Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae
Domenico Cantone, Andrea De Domenico, Pietro Maugeri +1
As a contribution to quantitative set-theoretic inferencing, a translation is proposed of conjunctions of literals of the forms , , and $z =\{x…