CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Open Positions
Highlights
Projects
Software
Publications
Members
Contact
Light
Dark
Automatic
E. Omodeo
Latest
Does every recursively enumerable set admit a finite-fold diophantine representation?
The axiom of elementary sets on the edge of Peircean expressibility
Three-variable statements of set-pairing
Solvable set/hyperset contexts: II. A goal driven unification algorithm for the blended case
Decidability of E*A-sentences in Membership Theories
Cite
×