CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Members
Events
Projects
Software
Publications
Contact
Light
Dark
Automatic
Decision Procedures for Elementary Sublanguages of Set Theory. IX. Unsolvability of the decision problem for a restricted subclass of delta-0 formulas of set theory.
Parlamento F
,
Policriti A
1988-01-01
Cite
DOI
Type
Journal article
Cite
×