Please use this identifier to cite or link to this item: http://hdl.handle.net/1942/715
Full metadata record
DC FieldValueLanguage
dc.contributor.authorVAN DEN BUSSCHE, Jan-
dc.contributor.authorCabibbo, Luca-
dc.date.accessioned2005-04-12T08:16:55Z-
dc.date.available2005-04-12T08:16:55Z-
dc.date.issued1998-
dc.identifier.citationActa Informatica, 35(8). p. 637-643-
dc.identifier.issn0001-5903-
dc.identifier.urihttp://hdl.handle.net/1942/715-
dc.description.abstractWe 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.-
dc.format.extent167278 bytes-
dc.format.mimetypeapplication/pdf-
dc.language.isoen-
dc.publisherSpringer-
dc.titleConverting untyped formulas to typed ones-
dc.typeJournal Contribution-
dc.identifier.epage643-
dc.identifier.issue8-
dc.identifier.spage637-
dc.identifier.volume35-
local.type.refereedRefereed-
local.type.specifiedArticle-
dc.bibliographicCitation.oldjcatA1-
dc.identifier.doi10.1007/s002360050135-
dc.identifier.isi000075856800001-
item.contributorVAN DEN BUSSCHE, Jan-
item.contributorCabibbo, Luca-
item.accessRightsOpen Access-
item.fullcitationVAN DEN BUSSCHE, Jan & Cabibbo, Luca (1998) Converting untyped formulas to typed ones. In: Acta Informatica, 35(8). p. 637-643.-
item.fulltextWith Fulltext-
item.validationecoom 1999-
Appears in Collections:Research publications
Files in This Item:
File Description SizeFormat 
converting.pdf163.36 kBAdobe PDFView/Open
Show simple item record

WEB OF SCIENCETM
Citations

7
checked on Apr 22, 2024

Page view(s)

58
checked on Sep 7, 2022

Download(s)

184
checked on Sep 7, 2022

Google ScholarTM

Check

Altmetric


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