scientific article; zbMATH DE number 4029504

MaRDI QIDQ3770495zbMATH OpenFDO

Authors Hans Kleine Büning, Theodor Lettmann

Publication date 1986

zbMATH Keywords

complexitydecidabilityundecidabilitylogic programmingrelational databasedomain closure assumptionunique name assumption

Mathematics Subject Classification ID

Information storage and retrieval of data (68P20) Decidability of theories and sets of sentences (03B25) Abstract data types; algebraic specification (68Q65)

Recommendations

• scientific article; zbMATH DE number 1099516
• scientific article; zbMATH DE number 4200184
• On first-order expressibility of satisfiability in submodels
• Testable and untestable classes of first-order formulae
• The complexity of definability by open first-order formulas
• A Finite First-Order Theory of Classes
• Publication:3204451
• First-order definability on finite structures
• Algorithmic problems concerning first-order definability of modal formulas on the class of all finite frames
• First-Order Formulas in Conjunctive Quantificational Form

Cited in

(3)

• First-Order Formulas in Conjunctive Quantificational Form
• Mechanizing Mathematical Reasoning
• Translation of first order formulas into ground formulas via a completion theory

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