scientific article; zbMATH DE number 4008363

MaRDI QIDQ3758805zbMATH OpenFDO

Authors Volker Weispfenning

Publication date 1986

zbMATH Keywords

complexityalgebraic theoriesamalgamation propertyApplicationsefficient decision and quantifier elimination proceduresexistentially closed models of a locally finite universal theory

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Quantifier elimination, model completeness, and related topics (03C10)

Recommendations

• scientific article; zbMATH DE number 125210
• Locally finite theories
• Decidability of the restricted theories of a class of partial orders
• scientific article; zbMATH DE number 638616
• Some decidable theories with finitely many covers which are decidable and algorithmically found

Cited in

(8)

• Polynomial-time computation via local inference relations
• Constructive decision via redundancy-free proof-search
• Logical theories and compatible operations
• New proof of the solvability of the elementary theory of linearly ordered sets
• Efficient Approximation of Well-Founded Justification and Well-Founded Domination
• Locally finite properties of data structures and their computation
• Decidability of the restricted theories of a class of partial orders
• Existentially closed semilattices

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 Q3758805)