Document Server@UHasselt >
Research >
Research publications >

Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/715

Title: Converting untyped formulas to typed ones
Cabibbo, Luca
Issue Date: 1998
Publisher: Springer
Citation: Acta Informatica, 35(8). p. 637-643
Abstract: We observe that every first-order logic formula over the untyped version of some many-sorted vocabulary is equivalent to a union of many-sorted formulas over that vocabulary. This result has as direct corollary a theorem by Hull and Su on the expressive power of active-domain quantification in the relational calculus.
URI: http://hdl.handle.net/1942/715
DOI: 10.1007/s002360050135
ISI #: 000075856800001
ISSN: 0001-5903
Type: Journal Contribution
Validation: ecoom, 1999
Appears in Collections: Research publications

Files in This Item:

Description SizeFormat
N/A163.36 kBAdobe PDF

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.