Skip to main content
SpringerLink
Log in

Converting untyped formulas to typed ones

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

Author information

Authors and Affiliations

  1. University of Limburg, Department WNI, Universitaire campus, B–3590 Diepenbeek, Belgium (e-mail: vdbuss@luc.ac.be) , , , , , , BE

    Jan Van den Bussche & Luca Cabibbo

Authors
  1. Jan Van den Bussche
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Luca Cabibbo
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 1 April 1998

Rights and permissions

Reprints and permissions

About this article

Cite this article

Van den Bussche, J., Cabibbo, L. Converting untyped formulas to typed ones. Acta Informatica 35, 637–643 (1998). https://doi.org/10.1007/s002360050135

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360050135

Keywords

Search

Navigation