Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/715
Title: Converting untyped formulas to typed ones
Authors: VAN DEN BUSSCHE, Jan 
Cabibbo, Luca
Issue Date: 1998
Publisher: Springer
Source: 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.
Document URI: http://hdl.handle.net/1942/715
DOI: 10.1007/s002360050135
ISI #: 000075856800001
Type: Journal Contribution
Validations: ecoom 1999
Appears in Collections:Research publications

Files in This Item:
File Description SizeFormat 
converting.pdf163.36 kBAdobe PDFView/Open
Show full item record

WEB OF SCIENCETM
Citations

7
checked on May 21, 2022

Page view(s)

50
checked on May 20, 2022

Download(s)

158
checked on May 20, 2022

Google ScholarTM

Check

Altmetric


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