Eugenio G. Omodeo

Generating author description...

All published works

Action	Title	Year	Authors
+	In Memory of Martin Davis	2024	Wesley Calvert Valentina Harizanov Eugenio G. Omodeo Alberto Policriti Alexandra Shlapentokh
+	Six equations in search of a finite-fold-ness proof	2023	Domenico Cantone Luca Cuzziol Eugenio G. Omodeo
+ PDF Chat	Complexity assessments for decidable fragments of Set Theory. III: A quadratic reduction of constraints over nested sets to Boolean formulae	2021	Domenico Cantone Andrea De Domenico Pietro Maugeri Eugenio G. Omodeo
+	Complexity assessments for decidable fragments of Set Theory. IV: A quadratic reduction of constraints over nested sets to Boolean formulae	2021	Domenico Cantone Andrea De Domenico Pietro Maugeri Eugenio G. Omodeo
+	A Decidable Theory of Differentiable Functions with Convexities and Concavities on Real Intervals.	2020	Gabriele Buriola Domenico Cantone Gianluca Cincotti Eugenio G. Omodeo Gaetano T. Spartà
+	From Hilbert's 10th Problem to slim, Undecidable Fragments of Set Theory.	2020	Domenico Cantone Eugenio G. Omodeo Mattia Panettiere
+	Does every recursively enumerable set admit a finite-fold Diophantine representation?	2019	Domenico Cantone Alberto Casagrande Francesco Fabris Eugenio G. Omodeo
+	On Sets and Graphs: Perspectives on Logic and Combinatorics	2017	Eugenio G. Omodeo Alberto Policriti Alexandru I. Tomescu
+	Membership and Edge Relations	2017	Eugenio G. Omodeo Alberto Policriti Alexandru I. Tomescu
+	Infinite Sets and Finite Combinatorics	2017	Eugenio G. Omodeo Alberto Policriti Alexandru I. Tomescu
+	Random Generation of Sets	2017	Eugenio G. Omodeo Alberto Policriti Alexandru I. Tomescu
+ PDF Chat	Banishing Ultrafilters from Our Consciousness	2016	Domenico Cantone Eugenio G. Omodeo Alberto Policriti
+ PDF Chat	Set-syllogistics meet combinatorics	2015	Eugenio G. Omodeo Alberto Policriti Alexandru I. Tomescu
+	A Diophantine representation of Wolstenholme's pseudoprimality	2015	Luca Vallata Eugenio G. Omodeo
+	A Proof-checking Experiment on Representing Graphs as Membership Digraphs.	2013	Pierpaolo Calligaris Eugenio G. Omodeo Alexandru I. Tomescu
+	The Bernays-Schönfinkel-Ramsey class for set theory: decidability	2012	Alberto Policriti Eugenio G. Omodeo
+	Infinity, in short	2011	Eugenio G. Omodeo Alberto Policriti Alexandru I. Tomescu
+	Introduction	2011	Jacob T. Schwartz Domenico Cantone Eugenio G. Omodeo
+	The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability	2010	Eugenio G. Omodeo Alberto Policriti
+	Stating Infinity in Set/Hyperset Theory	2010	Eugenio G. Omodeo Alberto Policriti Alexandru I. Tomescu
+	Three-variable statements of set-pairing	2004	Andrea Formisano Eugenio G. Omodeo Alberto Policriti
+	Topological syllogistic with continuous and closed functions	1989	Domenico Cantone Eugenio G. Omodeo
+	Decision procedures for elementary sublanguages of set theory VIII. A semidecision procedure for finite satisfiability of unqualified set‐theoretic formulae	1988	Domenico Cantone Alfredo Ferro Eugenio G. Omodeo

Common Coauthors

Coauthor	Papers Together
Alberto Policriti	12
Domenico Cantone	10
Alexandru I. Tomescu	8
Andrea De Domenico	2
Pietro Maugeri	2
Gaetano T. Spartà	1
Wesley Calvert	1
Andrea Formisano	1
Alfredo Ferro	1
Francesco Fabris	1
Gabriele Buriola	1
Valentina Harizanov	1
Mattia Panettiere	1
Luca Vallata	1
Jacob T. Schwartz	1
Alberto Casagrande	1
Gianluca Cincotti	1
Alexandra Shlapentokh	1
Luca Cuzziol	1
Pierpaolo Calligaris	1

Commonly Cited References

Action	Title	Year	Authors	# of times referenced
+ PDF Chat	The logically simplest form of the infinity axiom	1988	Franco Parlamento Alberto Policriti	8
+ PDF Chat	Expressing infinity without foundation	1991	Franco Parlamento Alberto Policriti	7
+	On a Problem of Formal Logic	1930	Frank Plumpton Ramsey	7
+	The Bernays-Schönfinkel-Ramsey class for set theory: semidecidability	2010	Eugenio G. Omodeo Alberto Policriti	6
+ PDF Chat	Sur les ensembles finis	1924	Alfred Tarski	5
+	Infinity, in short	2011	Eugenio G. Omodeo Alberto Policriti Alexandru I. Tomescu	4
+	Applied Nonstandard Analysis	1977	Martin Davis	4
+	The Bernays-Schönfinkel-Ramsey class for set theory: decidability	2012	Alberto Policriti Eugenio G. Omodeo	4
+ PDF Chat	Untersuchungen �ber die Grundlagen der Mengenlehre. I	1908	Ernst Zermelo	4
+	Matching Theory (North-Holland mathematics studies)	1986	László Lovász	3
+	The Classical Decision Problem	1997	Egon Börger Erich Grädel Yuri Gurevich	3
+	Über eine Widerspruchfreiheitsfrage in der axiomatischen Mengenlehre.	1929	J. v. Neumann	3
+	Set theory with free construction principles	1983	Marco Forti Furio Honsell	3
+ PDF Chat	Markov chain algorithms for generating sets uniformly at random	2012	Alberto Policriti Alexandru I. Tomescu	3
+	Generating connected acyclic digraphs uniformly at random	2004	Guy Mélançon Fabrice Philippe	3
+	On maximal independent sets of vertices in claw-free graphs	1980	George J. Minty	3
+	A simpler proof for vertex-pancyclicity of squares of connected claw-free graphs	2012	Alexandru I. Tomescu	3
+	An optimal path cover algorithm for cographs	1995	R. Lin Stephan Olariu Gara Pruesse	3
+	Asymptotic Enumeration of Extensional Acyclic Digraphs	2012	Stephan Wagner	3
+ PDF Chat	The strong perfect graph theorem	2006	Maria Chudnovsky Neil Robertson Paul Seymour Robin Thomas	3
+ PDF Chat	The number of full sets with 𝑛 elements	1962	Richard K. Peddicord	3
+	Set graphs. II. Complexity of set graph recognition and similar problems	2014	Martin Milanič Roméo Rizzi Alexandru I. Tomescu	3
+ PDF Chat	Note on: ‘‘The logically simplest form of the infinity axiom” [Proc.\ Amer.\ Math.\ Soc.\ {\bf 103} (1988), no.\ 1, 274–276; MR0938682 (89h:03086)]	1990	Franco Parlamento Alberto Policriti	3
+	Algorithme de recherche d'un stable de cardinalite maximum dans un graphe sans etoile	1980	Najiba Sbihi	3
+	Die Widerspruchsfreiheit der allgemeinen Mengenlehre	1937	Wilhelm Ackermann	3
+	Approximately Counting Hamilton Paths and Cycles in Dense Graphs	1998	Martin Dyer Alan Frieze Mark Jerrum	3
+ PDF Chat	Graphs with 1-factors	1974	David P. Sumner	3
+ PDF Chat	Ackermann encoding, bisimulations and OBDDs	2004	Carla Piazza Alberto Policriti	3
+	Hamiltonian results in <i>K</i><sub>1,3</sub>‐free graphs	1984	Manton M. Matthews David P. Sumner	3
+ PDF Chat	The Strong Perfect Graph Conjecture for pan-free graphs	1989	S. Olariu	3
+	Three Partition Refinement Algorithms	1987	Robert Paige Robert E. Tarjan	3
+	Note on "The Logically Simplest Form of the Infinity Axiom"	1990	Franco Parlamento Alberto Policriti	3
+	On metric properties of certain clique graphs	1979	Edward Howorka	3
+	Linear ordering on graphs, anti-founded sets and polynomial time computability	1999	Alexei Lisitsa Vladimir Sazonov	3
+	Counting extensional acyclic digraphs	2011	Alberto Policriti Alexandru I. Tomescu	3
+ PDF Chat	A characterization of Markov equivalence classes for acyclic digraphs	1997	Steen A. Andersson David Madigan Michael D. Perlman	3
+	The square of a connected S(K<sub>1,3</sub>)‐free graph is vertex pancyclic	1985	George R. T. Hendry Walter Vogler	3
+ PDF Chat	Enumeration of the adjunctive hierarchy of hereditarily finite sets	2014	Giorgio Audrito Alexandru I. Tomescu Stephan Wagner	3
+	Is Hyper-extensionality Preservable Under Deletions of Graph Elements?	2016	Alberto Casagrande Carla Piazza Alberto Policriti	3
+	A Proof-checking Experiment on Representing Graphs as Membership Digraphs.	2013	Pierpaolo Calligaris Eugenio G. Omodeo Alexandru I. Tomescu	3
+ PDF Chat	Set-syllogistics meet combinatorics	2015	Eugenio G. Omodeo Alberto Policriti Alexandru I. Tomescu	3
+	Graphical Enumeration	1973		3
+	Asymptotic enumeration of extensional acyclic digraphs	2012	Stephan Wagner	3
+	Set Theory An Introduction to Independence Proofs	1980	Kenneth Kunen	2
+	Set-theoretic reductions of Hilbert's tenth problem	1990	Domenico Cantone Vincenzo Cutello Alberto Policriti	1
+	Martin Davis and Hilbert’s Tenth Problem	2016	Yuri Matiyasevich	1
+	Decision algorithms for fragments of real analysis. I. Continuous functions with strict convexity and concavity predicates	2006	Domenico Cantone Gianluca Cincotti Giovanni Gallo	1
+	Integer solutions of systems of quadratic equations	1979	Jess Britton	1
+	The Decision Problem	1957	R. L. Goodstein	1
+	Small Ramsey Numbers	2011	Stanisław Radziszowski	1