CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Members
Events
Projects
Software
Publications
Contact
Light
Dark
Automatic
Omodeo E
Latest
The Bernays-Schoenfinkel-Ramsey Class in Set Theory: Decidability
The Bernays Schoenfinkel Ramsey class for set theory: semidecidability
Views on Time in Systems Biology
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
Decidability of exists*forall sentences in membership theories
A derived algorithm for evaluating epsilon-expressions over abstract sets
A contribution to the Automated Treatment of Membership Theories
The Automation of Syllogistic II. Optimization and Complexity Issues
Truth Table for a Combinatorial Kernel of Set Theories
Cite
×