Eugenio G. Omodeo
- Computational Theory and Mathematics top 2%
- Artificial Intelligence top 5%
- Computer Networks and Communications top 10%
- Geometry and Topology top 10%
- Discrete Mathematics and Combinatorics top 10%
- Co-authors
- Domenico CantoneAlberto PolicritiAlfredo FerroJacob T. SchwartzAgostino DovierGianfranco RossiEnrico PontelliAndrea Formisano
- Topics
- Logic, programming, and type systems (24 papers)Logic, Reasoning, and Knowledge (20 papers)Computability, Logic, AI Algorithms (17 papers)
- Cited by
- Computational Theory and MathematicsArtificial IntelligenceDiscrete Mathematics and Combinatorics
- Journals
- Cancer ResearchCommunications on Pure and Applied MathematicsComputers & Mathematics with Applications
- Partner nations
- ItalyUnited StatesFinland
In The Last Decade
Eugenio G. Omodeo
52 papers receiving 388 citations
Peers
Comparison fields: 5 of 28
- Computational Theory and Mathematics 311
- Artificial Intelligence 294
- Computer Networks and Communications 86
- Geometry and Topology 35
- Discrete Mathematics and Combinatorics 25
Countries citing papers authored by Eugenio G. Omodeo
This map shows the geographic impact of Eugenio G. Omodeo's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Eugenio G. Omodeo with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Eugenio G. Omodeo more than expected).
Fields of papers citing papers by Eugenio G. Omodeo
This network shows the impact of papers produced by Eugenio G. Omodeo. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Eugenio G. Omodeo. The network helps show where Eugenio G. Omodeo may publish in the future.
Co-authorship network of co-authors of Eugenio G. Omodeo
This figure shows the co-authorship network connecting the top 25 collaborators of Eugenio G. Omodeo. A scholar is included among the top collaborators of Eugenio G. Omodeo based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Eugenio G. Omodeo. Eugenio G. Omodeo is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory. | 1 |
| 2 | A Quadratic Reduction of Constraints over Nested Sets to Purely Boolean Formulae in CNF | 1 |
| 3 | Polynomial-Time Satisfiability Tests for Boolean Fragments of Set Theory. | 2 |
| 4 | 3 | |
| 5 | Hyper-Extensionality and One-Node Elimination on Membership Graphs | 0 |
| 6 | The Representation of Boolean Algebras in the Spotlight of a Proof Checker. | 1 |
| 7 | A Proof-checking Experiment on Representing Graphs as Membership Digraphs. | 2 |
| 8 | Solvable (and unsolvable) cases of the decision problem for fragments of analysis | 0 |
| 9 | Using aetnanova to formally prove that the Davis-Putnam satisfiability test is correct | 1 |
| 10 | Formative processes with applications to the decision problem in set theory: I. Powerset and singleton operators. | 1 |
| 11 | A Prolog tool for relational translation of modal logics: a front-end for relational proof systems | 9 |
| 12 | 6 | |
| 13 | 8 | |
| 14 | 8 | |
| 15 | 1 | |
| 16 | Extensional and Intensional Sets in CLP with Intensional Negation. | 1 |
| 17 | 23 | |
| 18 | Truth tables for a combinatorial kernel of set theories | 2 |
| 19 | Meta-interpreting SETL | 1 |
| 20 | On the decidability of formulae involving continuous and closed functions | 2 |
About Eugenio G. Omodeo
Eugenio G. Omodeo is a scholar working on Theoretical Computer Science, Computational Theory and Mathematics and Discrete Mathematics and Combinatorics, having authored 63 papers that have together received 423 indexed citations. Recurring topics across this work include Logic, programming, and type systems (24 papers), Logic, Reasoning, and Knowledge (20 papers) and Computability, Logic, AI Algorithms (17 papers). The work is most often cited by research in Computational Theory and Mathematics (311 citations), Artificial Intelligence (294 citations) and Discrete Mathematics and Combinatorics (25 citations). Eugenio G. Omodeo has collaborated with scholars based in Italy, United States and Finland. Frequent co-authors include Domenico Cantone, Alberto Policriti, Alfredo Ferro, Jacob T. Schwartz, Agostino Dovier, Gianfranco Rossi, Enrico Pontelli, Andrea Formisano, Alexandru I. Tomescu and Marco Temperini. Their work appears in journals such as Cancer Research, Communications on Pure and Applied Mathematics and Computers & Mathematics with Applications.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.