CompBio & Bioinf @ UniUd
CompBio & Bioinf @ UniUd
Home
Open Positions
Highlights
Projects
Software
Publications
Members
Contact
Light
Dark
Automatic
Undecidability Results for Restricted Universally Quantified Formulae of Set Theory
Franco Parlamento
,
Alberto Policriti
1993-01-01
Cite
Type
Journal article
Publication
COMMUNICATIONS ON PURE AND APPLIED MATHEMATICS
Rstricted Formuale; Set Theory; Undecidability
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
Decision Procedures for Elementary Sublanguages of Set Theory XIII. Model Graphs, Reflection and Decidability.
Cite
×