CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Open Positions
Highlights
Projects
Software
Publications
Members
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.
F Parlamento
,
Alberto Policriti
1988-01-01
Cite
DOI
Type
Journal article
Publication
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS
Related
Co-lexicographically Ordering Automata and Regular Languages - Part I
Ordering regular languages and automata: Complexity
Co-lexicographically Ordering Automata and Regular Languages - Part I
Continued Hereditarily Finite Set-Approximations
Solving String Problems on Graphs Using the Labeled Direct Product
Cite
×