( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Decidability results for sets with atoms.

, , и . ACM Trans. Comput. Log., 7 (2): 269-301 (2006)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Eugenio Rivera

Eugenio Fava

Eugenio Amato

Eugenio Polito

Eugenio Corecco

 

Другие публикации лиц с тем же именем

The Bernays - Schönfinkel - Ramsey class for set theory: decidability., и . J. Symb. Log., 77 (3): 896-918 (2012)Rasiowa-Sikorski Style Relational Elementary Set Theory., , и . RelMiCS, том 3051 из Lecture Notes in Computer Science, стр. 215-226. Springer, (2003)Mapping Sets and Hypersets into Numbers., , , и . Fundam. Informaticae, 140 (3-4): 307-328 (2015)An Environment for Stepwise Map Specification and Reasoning in Prolog I: Three Language Extension Mechanisms., , и . APPIA-GULP-PRODE, стр. 87-. Facultad de Informática, Universidad Politécnica de Madrid, (2002)Set-syllogistics meet combinatorics., , и . Math. Struct. Comput. Sci., 27 (2): 296-310 (2017)Theory-Specific Automated Reasoning., и . 25 Years GULP, том 6125 из Lecture Notes in Computer Science, Springer, (2010)Automation of Aggregate Theories: The Cornerstones of Equational Expressibility., , и . APPIA-GULP-PRODE, стр. 275-. Facultad de Informática, Universidad Politécnica de Madrid, (2002)Instructing Equational Set-Reasoning with Otter., , и . IJCAR, том 2083 из Lecture Notes in Computer Science, стр. 152-167. Springer, (2001)Set Graphs. V. On representing graphs as membership digraphs., и . J. Log. Comput., 25 (3): 899-919 (2015)Decidability of ∃*∀-Sentences in Membership Theories., , и . Math. Log. Q., (1996)