Decision Procedures for Some Fragments of Set Theory. - Alfredo Ferro; Eugenio G. Omodeo; Jacob T. Schwartz (CADE, 1980)

Three existence principles in a modal calculus without descriptions contained in A. Bressan's MCν. - Eugenio Giovanni Omodeo (Notre Dame J. Formal Log., 1980)

Decidability and Proof Procedures for Set Theory with a Choice Operator. - Eugenio G. Omodeo (1984)

Towards Practical Implementations of Syllogistic. - Susanna Ghelfo; Eugenio G. Omodeo (European Conference on Computer Algebra (2), 1985)

Hints for the Design of a Set Calculus Oriented to Automated Deduction. - Eugenio G. Omodeo (Foundations of Logic and Functional Programming, 1986)

The Automation of Syllogistic I. Syllogistic Normal Forms. - Domenico Cantone; Susanna Ghelfo; Eugenio G. Omodeo (J. Symb. Comput., 1988)

Computable set theory. Volume 1. - Domenico Cantone; Alfredo Ferro; Eugenio G. Omodeo (Clarendon Press / Oxford University Press, 1989)

On the Decidability of Formulae Involving Continuous and Closed Functions. - Domenico Cantone; Eugenio G. Omodeo (IJCAI, 1989)

Truth Tables for a Combinatorial Kernel of Set Theories. - Eugenio G. Omodeo; Franco Parlamento; Alberto Policriti (ECAI, 1990)

The Automation of Syllogistic. - Domenico Cantone; Eugenio G. Omodeo; Alberto Policriti (J. Autom. Reason., 1990)

{log}: A Logic Programming Language with Finite Sets. - Agostino Dovier; Eugenio G. Omodeo; Enrico Pontelli; Gianfranco Rossi (ICLP, 1991)

Embedding Finite Sets in a Logic Programming Language. - Agostino Dovier; Eugenio G. Omodeo; Enrico Pontelli; Gianfranco Rossi (ELP, 1992)

Che Genere di Insiemi/Multi-insiemi/Iper-insiemi Incorporare nella Programazione Logica? - Eugenio G. Omodeo; Alberto Policriti; Gianfranco Rossi (GULP, 1993)

Decision Procedures for Set/Hyperset Contexts. - Eugenio G. Omodeo; Alberto Policriti (DISCO, 1993)

Unification of Hyperset Terms. - Davide Aliffi; Gianfranco Rossi; Agostino Dovier; Eugenio G. Omodeo (ICLP Workshop on Logic Programming with Sets, 1993)

Extensional and Intensional Sets in CLP with Intensional Negation. - Paola Bruscoli; Gianfranco Rossi; Agostino Dovier; Eugenio G. Omodeo; Enrico Pontelli (ICLP Workshop on Logic Programming with Sets, 1993)

A Derived Algorithm for Evaluating varepsilon-Expressions over Abstract Sets. - Eugenio G. Omodeo; Franco Parlamento; Alberto Policriti (J. Symb. Comput., 1993)

Solving Systems of Equations over Hypersets. - Agostino Dovier; Eugenio G. Omodeo; Alberto Policriti; Gianfranco Rossi (GULP-PRODE (1), 1994)

Solvable set/hyperset context. - Eugenio G. Omodeo (JFPLC, 1995)

A Language for Programming in Logic with Finite Sets. - Agostino Dovier; Eugenio G. Omodeo; Enrico Pontelli; Gianfranco Rossi (J. Log. Program., 1996)

Decidability of ∃*∀-Sentences in Membership Theories. - Eugenio G. Omodeo; Franco Parlamento; Alberto Policriti (Math. Log. Q., 1996)

Global Skolemization with Grouped Quantifiers. - Domenico Cantone; Marianna Nicolosi Asmundo; Eugenio G. Omodeo (APPIA-GULP-PRODE, 1997)

Plan of Activities on the Map Calculus. - Andrea Formisano 001; Eugenio G. Omodeo; Marco Temperini (APPIA-GULP-PRODE, 1998)

An Equational Re-engineering of Set Theories. - Andrea Formisano 001; Eugenio G. Omodeo (FTP (LNCS Selection), 1998)

Transitive Venn diagrams with applications to the decision problem in set theory. - Domenico Cantone; Eugenio G. Omodeo; Pietro Ursino (APPIA-GULP-PRODE, 1999)

Solvable Set/Hyperset Contexts: II. A Goal-Driven Unification Algorithm for the Blended Case. - Agostino Dovier; Eugenio G. Omodeo; Alberto Policriti (Appl. Algebra Eng. Commun. Comput., 1999)

Goals and Benchmarks for Automated Map Reasoning. - Andrea Formisano 001; Eugenio G. Omodeo; Marco Temperini (J. Symb. Comput., 2000)

Algebraic Semantics of ER-Models in the Context of the Calculus of Relations. II: Dynamic View. - Ernst-Erich Doberkat; Eugenio G. Omodeo (RelMiCS, 2001)

Instructing Equational Set-Reasoning with Otter. - Andrea Formisano 001; Eugenio G. Omodeo; Marco Temperini (IJCAR, 2001)

A graphical approach to relational reasoning. - Andrea Formisano 001; Eugenio G. Omodeo; Marta Simeoni (RelMiS, 2001)

Layered map reasoning: An experimental approach put to trial on sets. - Andrea Formisano 001; Eugenio G. Omodeo; Marco Temperini (APPIA-GULP-PRODE, 2001)

Algebraic semantics of ER-models in the context of the calculus of relations. - Eugenio G. Omodeo; Ernst-Erich Doberkat (RelMiS, 2001)

Set Theory for Computing - From Decision Procedures to Declarative Programming with Sets - Domenico Cantone; Eugenio G. Omodeo; Alberto Policriti (Springer, 2001)

An Environment for Stepwise Map Specification and Reasoning in Prolog I: Three Language Extension Mechanisms. - Pasquale Caianiello; Stefania Costantini; Eugenio G. Omodeo (APPIA-GULP-PRODE, 2002)

Automation of Aggregate Theories: The Cornerstones of Equational Expressibility. - Andrea Formisano 001; Eugenio G. Omodeo; Alberto Policriti (APPIA-GULP-PRODE, 2002)

A 'Theory' Mechanism for a Proof-Verifier Based on First-Order Set Theory. - Eugenio G. Omodeo; Jacob T. Schwartz (Computational Logic: Logic Programming and Beyond, 2002)

Formative Processes with Applications to the Decision Problem in Set Theory, I. Powerset and Singleton Operators. - Domenico Cantone; Pietro Ursino; Eugenio G. Omodeo (Inf. Comput., 2002)

An Environment for Specifying Properties of Dyadic Relations and Reasoning about Them: I: Language Extension Mechanisms. - Pasquale Caianiello; Stefania Costantini; Eugenio G. Omodeo (Theory and Applications of Relational Structures as Knowledge Instruments, 2003)

Rasiowa-Sikorski Style Relational Elementary Set Theory. - Eugenio G. Omodeo; Ewa Orlowska; Alberto Policriti (RelMiCS, 2003)

Mappings Between Domain Models in Answer Set Programming. - Stefania Costantini; Andrea Formisano 001; Eugenio G. Omodeo (APPIA-GULP-PRODE, 2003)

Notes from the Logbook of a Proof-Checker's Project. - Domenico Cantone; Eugenio G. Omodeo; Jacob T. Schwartz; Pietro Ursino (Verification: Theory and Practice, 2003)

Compiling dyadic first-order specifications into map algebra. - Domenico Cantone; Andrea Formisano 001; Eugenio G. Omodeo; Calogero G. Zarba (Theor. Comput. Sci., 2003)

ER modelling from first relational principles. - Ernst-Erich Doberkat; Eugenio G. Omodeo (Theor. Comput. Sci., 2004)

Three-variable statements of set-pairing. - Andrea Formisano 001; Eugenio G. Omodeo; Alberto Policriti (Theor. Comput. Sci., 2004)

The axiom of elementary sets on the edge of Peircean expressibility. - Andrea Formisano 001; Eugenio G. Omodeo; Alberto Policriti (J. Symb. Log., 2005)

An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-classical Logics. - Andrea Formisano 001; Eugenio G. Omodeo; Ewa Orlowska (Theory and Applications of Relational Structures as Knowledge Instruments, 2006)

A Computerized Referee. - Eugenio G. Omodeo; Domenico Cantone; Alberto Policriti; Jacob T. Schwartz (Reasoning, Action and Interaction in AI Theories and Systems, 2006)

Decidability results for sets with atoms. - Agostino Dovier; Andrea Formisano 001; Eugenio G. Omodeo (ACM Trans. Comput. Log., 2006)

Theory-Specific Automated Reasoning. - Andrea Formisano 001; Eugenio G. Omodeo (25 Years GULP, 2010)

The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability. - Eugenio G. Omodeo; Alberto Policriti (J. Symb. Log., 2010)

Computational Logic and Set Theory - Applying Formalized Logic to Analysis. - Jacob T. Schwartz; Domenico Cantone; Eugenio G. Omodeo (Springer, 2011)

On the Elimination of Quantifiers through Descriptors in Predicate Logic. - Domenico Cantone; Marianna Nicolosi Asmundo; Eugenio G. Omodeo (CILC, 2012)

A graphical representation of relational formulae with complementation. - Domenico Cantone; Andrea Formisano 001; Marianna Nicolosi Asmundo; Eugenio Giovanni Omodeo (RAIRO Theor. Informatics Appl., 2012)

The Bernays - Schönfinkel - Ramsey class for set theory: decidability. - Eugenio G. Omodeo; Alberto Policriti (J. Symb. Log., 2012)

Infinity, in short. - Eugenio G. Omodeo; Alberto Policriti; Alexandru I. Tomescu (J. Log. Comput., 2012)

A Proof-checking Experiment on Representing Graphs as Membership Digraphs. - Pierpaolo Calligaris; Eugenio G. Omodeo; Alexandru I. Tomescu (CILC, 2013)

Proof Verification within Set Theory. - Eugenio G. Omodeo (CILC, 2013)

The Representation of Boolean Algebras in the Spotlight of a Proof Checker. - Rodica Ceterchi; Eugenio G. Omodeo; Alexandru I. Tomescu (CILC, 2014)

Hyper-Extensionality and One-Node Elimination on Membership Graphs. - Eugenio G. Omodeo; Carla Piazza; Alberto Policriti; Alexandru I. Tomescu (CILC, 2014)

Reasoning about connectivity without paths. - Alberto Casagrande; Eugenio G. Omodeo (ICTCS, 2014)

Set Graphs. III. Proof Pearl: Claw-Free Graphs Mirrored into Transitive Hereditarily Finite Sets. - Eugenio G. Omodeo; Alexandru I. Tomescu (J. Autom. Reason., 2014)

A Diophantine representation of Wolstenholme's pseudoprimality. - Luca Vallata; Eugenio G. Omodeo (CILC, 2015)

Mapping Sets and Hypersets into Numbers. - Giovanna D'Agostino; Eugenio G. Omodeo; Alberto Policriti; Alexandru I. Tomescu (Fundam. Informaticae, 2015)

Set Graphs. V. On representing graphs as membership digraphs. - Eugenio G. Omodeo; Alexandru I. Tomescu (J. Log. Comput., 2015)

Banishing Ultrafilters from Our Consciousness. - Domenico Cantone; Eugenio G. Omodeo; Alberto Policriti (Martin Davis on Computability, Computational Logic, and Mathematical Foundations, 2016)

Martin Davis's Bibliography 1950-2015. - Eugenio G. Omodeo (Martin Davis on Computability, Computational Logic, and Mathematical Foundations, 2016)

On Sets and Graphs: Perspectives on Logic and Combinatorics - Eugenio G. Omodeo; Alberto Policriti; Alexandru I. Tomescu (Springer, 2017)

Set-syllogistics meet combinatorics. - Eugenio G. Omodeo; Alberto Policriti; Alexandru I. Tomescu (Math. Struct. Comput. Sci., 2017)

Can a Single Equation Witness that every r.e. Set Admits a Finite-fold Diophantine Representation? - Domenico Cantone; Eugenio G. Omodeo (CILC, 2018)

On Perfect Matchings for some Bipartite Graphs. - Alberto Casagrande; Francesco Di Cosmo; Eugenio G. Omodeo (SETS@ABZ, 2018)

Does Every Recursively Enumerable Set Admit a Finite-Fold Diophantine Representation? - Domenico Cantone; Alberto Casagrande; Francesco Fabris; Eugenio G. Omodeo (CILC, 2019)

Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory. - Domenico Cantone; Andrea De Domenico; Pietro Maugeri; Eugenio G. Omodeo (CILC, 2019)

A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals. - Gabriele Buriola; Domenico Cantone; Gianluca Cincotti; Eugenio G. Omodeo; Gaetano T. Spartà (CILC, 2020)

A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF. - Domenico Cantone; Andrea De Domenico; Pietro Maugeri; Eugenio G. Omodeo (CILC, 2020)

From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory. - Domenico Cantone; Eugenio G. Omodeo; Mattia Panettiere (ICTCS, 2020)

Complexity assessments for decidable fragments of set theory. II: A taxonomy for 'small' languages involving membership. - Domenico Cantone; Pietro Maugeri; Eugenio G. Omodeo (Theor. Comput. Sci., 2020)

Very Weak, Essentially Undecidabile Set Theories. - Domenico Cantone; Eugenio G. Omodeo; Mattia Panettiere (CILC, 2021)

A Decidable Theory Treating Addition of Differentiable Real Functions. - Gabriele Buriola; Domenico Cantone; Gianluca Cincotti; Eugenio G. Omodeo; Gaetano T. Spartà (ICTCS, 2021)

Two Crucial Cubic-Time Components of Polynomial-Maximal Decidable Boolean Languages. - Domenico Cantone; Pietro Maugeri; Eugenio G. Omodeo (ICTCS, 2021)

Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae. - Domenico Cantone; Andrea De Domenico; Pietro Maugeri; Eugenio G. Omodeo (CoRR, 2021)

Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case. - Domenico Cantone; Andrea De Domenico; Pietro Maugeri; Eugenio G. Omodeo (Fundam. Informaticae, 2021)

Preface. - Alberto Casagrande; Eugenio G. Omodeo; Maurizio Proietti (Fundam. Informaticae, 2021)

A Brief History of Singlefold Diophantine Definitions. - Domenico Cantone; Luca Cuzziol; Eugenio G. Omodeo (CILC, 2023)

Continued Hereditarily Finite Sets Approximations. - Domenico Cantone; Eugenio G. Omodeo; Alberto Policriti (CILC, 2023)

Obituary of Martin Davis (1928-2023). - Alberto Policriti; Eugenio G. Omodeo; Liesbeth De Mol (IEEE Ann. Hist. Comput., 2023)

A decidable theory involving addition of differentiable real functions. - Gabriele Buriola; Domenico Cantone; Gianluca Cincotti; Eugenio G. Omodeo; Gaetano T. Spartà (Theor. Comput. Sci., 2023)

Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages. - Domenico Cantone; Pietro Maugeri; Eugenio G. Omodeo (Theor. Comput. Sci., 2023)

Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs. - Domenico Cantone; Eugenio G. Omodeo; Mattia Panettiere (J. Log. Comput., 2023)

Onset and Today's Perspectives of Multilevel Syllogistic. - Domenico Cantone; Eugenio G. Omodeo (From Computational Logic to Computational Biology, 2024)

A Sound and Complete Validity Test for Formulas in Extensional Multi-level Syllogistic. - Alfredo Ferro; Eugenio G. Omodeo (From Computational Logic to Computational Biology, 2024)

On Generalised Ackermann Encodings - The Basis Issue. - Simone Boscaratto; Eugenio G. Omodeo; Alberto Policriti (CILC, 2024)

Some Decidability Issues Concerning C^n Real Functions. - Gabriele Buriola; Domenico Cantone; Gianluca Cincotti; Eugenio G. Omodeo; Gaetano T. Spartà (CILC, 2024)

In Memory of Martin Davis. - Wesley Calvert; Valentina S. Harizanov; Eugenio G. Omodeo; Alberto Policriti; Alexandra Shlapentokh (CoRR, 2024)

Diophantine Modeling of Provability in Algebraic Logic. - Andrea Formisano 001; Isacco Gavazzi; Eugenio G. Omodeo (CILC, 2025)

Key Metalogical Propositions on a Variant of Hilbert's Epsilon-Calculus. - Domenico Cantone; Marianna Nicolosi Asmundo; Eugenio G. Omodeo (CILC, 2025)

Martin Davis: An Overview of his Work in Logic, Computer Science, and Philosophy. - Liesbeth De Mol; Yuri V. Matiyasevich; Eugenio G. Omodeo; Alberto Policriti; Wilfried Sieg; Elaine J. Weyuker (CoRR, 2025)

Decision algorithms for fragments of real analysis. III: A theory of differentiable functions with (semi-)open intervals. - Gabriele Buriola; Domenico Cantone; Gianluca Cincotti; Eugenio G. Omodeo; Gaetano T. Spartà (CoRR, 2025)