A decision procedure for semantical equivalence of thin FM specifications
DOI10.1016/S0022-4049(99)00120-6zbMath0937.18008WikidataQ127740920 ScholiaQ127740920MaRDI QIDQ1818643
Eric Steegmans, Frank Piessens
Publication date: 30 May 2000
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
undecidabilityrelational databasespecification logicmetafinite structuressemantical equivalencesketch-based data specifications
Database theory (68P15) Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Specification and verification (program logics, model checking, etc.) (68Q60) Epimorphisms, monomorphisms, special classes of morphisms, null morphisms (18A20) Categorical semantics of formal languages (18C50) Functor categories, comma categories (18A25) Foundations, relations to logic and deductive systems (18A15)
This page was built for publication: A decision procedure for semantical equivalence of thin FM specifications