scientific article; zbMATH DE number 1089735

MaRDI QIDQ4366289zbMATH OpenFDO

Authors Ludovico Pernazza

Publication date 19 November 1997

zbMATH Keywords

decidabilityseparating semialgebraic sets

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Semialgebraic sets and related spaces (14P10)

Recommendations

• scientific article; zbMATH DE number 3883607
• Hausdorff separations and decidability
• On reduction of the decision problem of recursively enumerable sets to the separability problem
• Decidability of affine solution problems
• On the complexity of polyhedral separability
• Approximate decidability in euclidean spaces
• scientific article; zbMATH DE number 4097336
• Decidability in elementary analysis. II
• Decidability results for the boundedness problem
• Decidability of the membership problem for \(2\times 2\) integer matrices

Cited in

(3)

• About the decidability of polyhedral separability in the lattice \(\mathbb {Z}^d\). Recognizing digital polyhedra with a prescribed number of faces
• Deciding separability with a fixed error
• Separation of semialgebraic sets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4366289)