CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Open Positions
Highlights
Projects
Software
Publications
Members
Contact
Light
Dark
Automatic
The Logically Simplest Form of the Infinity Axiom
Franco Parlamento
,
Alberto Policriti
1988-01-01
Cite
DOI
Type
Journal article
Publication
PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY
Related
Finite families with few symmetric differences
Witnessing differences without redundancies
Decidability of E*A-sentences in Membership Theories
A derived algorithm for evaluating epsilon-expressions over abstract sets
Undecidability Results for Restricted Universally Quantified Formulae of Set Theory
Cite
×