CONVERTING UNTYPED FORMULAS TO TYPED ONES

Authors
VANDENBUSSCHE J CABIBBO L
Citation
J. Vandenbussche et L. Cabibbo, CONVERTING UNTYPED FORMULAS TO TYPED ONES, Acta informatica, 35(8), 1998, pp. 637-643
Citations number
NO
Categorie Soggetti
Computer Science Information Systems","Computer Science Information Systems
Journal title
Acta informatica → ACNP
ISSN journal
00015903
Volume
35
Issue
8
Year of publication
1998
Pages
637 - 643
Database
ISI
SICI code
0001-5903(1998)35:8<637:CUFTTO>2.0.ZU;2-W
Abstract
We observe that every first-order logic formula over the untyped versi on of some many-sorted vocabulary is equivalent to a union of many-sor ted formulas over that vocabulary. This result has as direct corollary a theorem by Hull and Su on the expressive power of active-domain qua ntification in the relational calculus.