Converting untyped formulas to typed ones

DOI10.1007/S002360050135zbMATH Open0920.03011OpenAlexW1977757011MaRDI QIDQ1284693FDOQ1284693

Authors: Jan Van den Bussche, Luca Cabibbo 

Publication date: 26 April 1999

Published in: Acta Informatica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1942/715

Recommendations

• Sort it out with monotonicity. Translating between many-sorted and unsorted first-order logic
• Tuple calculus: formal definition and conversion from first-order calculus
• scientific article; zbMATH DE number 1330426
• scientific article; zbMATH DE number 975706
• Quine's conjecture on many-sorted logic

zbMATH Keywords

first-order logicmany-sorted logicexpressive power of active-domain quantification in the relational calculusmany-sorted formulasuntyped formula

Mathematics Subject Classification ID

Database theory (68P15) Classical first-order logic (03B10)

Cited In (1)

• Relational completeness of query languages for annotated databases

This page was built for publication: Converting untyped formulas to typed ones

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