Skip to main content
SpringerLink
Log in

Elimination of algorithmic quantifiers for ordered differential algebra

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract.

In [2], Singer proved that the theory of ordered differential fields has a model completion, i.e, the theory of closed ordered differential fields, CODF. As a result, CODF admits elimination of quantifiers. In this paper we give an algorithm to eliminate the quantifiers of CODF-formulas.

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. Department of Computer Science, Hunan Normal University, Changsha, Hunan, 410081, P.R. China (e-mail: imath@hunnu.edu.cn) , , , , , , CN

    Yunfu Shen

Authors
  1. Yunfu Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

Received: 29 May 1996

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shen, Y. Elimination of algorithmic quantifiers for ordered differential algebra. Arch Math Logic 38, 139–144 (1999). https://doi.org/10.1007/s001530050119

Download citation

  • Issue Date:

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

Search

Navigation