Skip to main content
SpringerLink
Log in

Satisfiability of systems of ordinal notations with the subterm property is decidable

  • Logic In Computer Science (BRA Session) (Session 11)
  • Conference paper
  • First Online:
Book cover Automata, Languages and Programming (ICALP 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 510))

Included in the following conference series:

This work was parly supported by the “Greco de programmation du CNRS” and the ESPRIT working group COMPASS. It was partly accomplished while each author was visiting the other's institution.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Hubert Comon. Disunification: a survey. In Jean-Louis Lassez and Gordon Plötkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT Press, 1990. to appear.

    Google Scholar 

  2. Hubert Comon. Solving symbolic ordering constraints. In Proc. 5th IEEE Symp. Logic in Computer Science, Philadelphia, June 1990.

    Google Scholar 

  3. Nachum Dershowitz. Orderings for term-rewriting systems. Theoretical Computer Science, 17:123–131, 1982.

    Google Scholar 

  4. Nachum Dershowitz and Jean-Pierre Jouannaud. Handbook of Theoretical Computer Science, volume B, chapter Rewrite Systems. North-Holland, 1990. J. van Leeuwen ed.

    Google Scholar 

  5. Nachum Dershowitz and Mitsuhiro Okada. Proof-theoretic techniques for term rewriting. In Proc. 3rd IEEE Symp. Logic in Computer Science, Edinburgh, June 1988.

    Google Scholar 

  6. J. Hsiang and M. Rusinowitch. Proving refutational completeness of theorem proving strategies, Part I: The transfinite semantic tree method. Submitted to jacm, 1987.

    Google Scholar 

  7. Jean-Pierre Jouannaud and Claude Kirchner. Solving equations in abstract algebras: A rule-based survey of unification. In Jean-Louis Lassez and Gordon Plötkin, editors, Computational Logic: Essays in Honor of Alan Robinson. MIT-Press, 1990. to appear.

    Google Scholar 

  8. S. Kamin and Levy J.-J. Two generalizations of the recursive path ordering. Available as a report of the department of computer science, University of Illinois at Urbana-Champaign, 1980.

    Google Scholar 

  9. M. Okada. A simple relationship between buchholz's system of ordinal notation and takeuti's system of ordinal diagram. J. Symbolic Computation, 1988.

    Google Scholar 

  10. K. Schütte. Proof Theory. Springer-Verlag, 1978.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. CNRS / Université de Paris Sud, LRI, Bat. 490, 91405, Orsay, France

    Jean-Pierre Jouannaud

  2. Department of Computer Science, Concordia University, H3G1M8, Montreal, Quebec

    Mitsuhiro Okada

Authors
  1. Jean-Pierre Jouannaud
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mitsuhiro Okada
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Jouannaud, JP., Okada, M. (1991). Satisfiability of systems of ordinal notations with the subterm property is decidable. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_155

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_155

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-54233-9

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation