Zobrazeno 1 - 10
of 65
pro vyhledávání: '"Omodeo, E."'
Autor:
Foglia E., Garagiola E, Ferrario LB, Ladisa V, Scorza A, Rambaldi A, Cairoli R, Medaglia ML, Simona M, Sale EO, Omodeo E, Zinzani PL, Esposti M, Alberti L, Marcias M, Mulas MF, Satta V, Melis E, Onnis S, Croce D
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od______1299::d8f14b54dcf028f4777c73b356ee633b
https://hdl.handle.net/10281/409349
https://hdl.handle.net/10281/409349
Publikováno v:
Scopus-Elsevier
This paper enriches a pre-existing decision algorithm, which in its turn augmented a fragment of Tarski’s elementary algebra with one-argument real functions endowed with continuous first derivative. In its present (still quantifier-free) version,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::0f1c8eb17236e7700f30b13209dd6cd4
http://hdl.handle.net/11368/3005853
http://hdl.handle.net/11368/3005853
We recently undertook an investigation aimed at identifying small fragments of set theory (which in most cases are sublanguages of Multi-Level Syllogistic) endowed with polynomial-time satisfiability decision tests, potentially useful for automated p
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::46a2ebca445708dcd232c9867a2860ae
http://hdl.handle.net/20.500.11769/382659
http://hdl.handle.net/20.500.11769/382659
Publikováno v:
Scopus-Elsevier
The Davis-Putnam-Robinson theorem showed that every partially computable m-ary function f(a_1, . . . , a_m) = c on the natural numbers can be specified by means of an exponential Diophantine formula involving, along with parameters a_1, . . . , a_m,
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::1c29fbc7fd21a59b9ca01fb47df57076
http://hdl.handle.net/20.500.11769/382661
http://hdl.handle.net/20.500.11769/382661
A translation is proposed of conjunctions of literals of the forms x = y z, x /= y z, and x ∈ y, where x, y, z stand for variables ranging over the von Neumann universe of sets, into unquantified Boolean formulae of a rather simple conjunctive norm
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::fd64b7e18465da80588822a88274c915
http://hdl.handle.net/11368/2978347
http://hdl.handle.net/11368/2978347
Publikováno v:
Scopus-Elsevier
We enrich a pre-existing decision algorithm, which in its turn augmented a fragment of Tarski’s elementary algebra with one-argument functions enjoying significant properties such as continuity and differentiability. We also pave the way to further
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::13fa0d83e24a1152814512dc1422d058
https://hdl.handle.net/11368/2978349
https://hdl.handle.net/11368/2978349
Publikováno v:
Scopus-Elsevier
Inspired by some recent revisitations of the Cantor-Bernstein theorem, in particular its formalizations in ZF carried out via the proof assistant AProS by W. Sieg and P. Walsh, we are carrying out the proof of a related graph-theoretical proposition.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::6aa88e441454e547171b90ca98d8d5f2
http://hdl.handle.net/11368/2929132
http://hdl.handle.net/11368/2929132
Publikováno v:
Le Matematiche; 2021, Vol. 76 Issue 1, p133-160, 28p
