Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Semi-unification and generalizations of a particularly simple form

  • Conference paper
  • First Online:
Computer Science Logic (CSL 1994)

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

Included in the following conference series:

Abstract

This paper describes a criterion for the existence of generalizations of a particularly simple form given complex terms in short proofs within schematic theories: The soundness of replacing single quantifiers, which bind variables in schema instances, by blocks of quantifiers of the same type. The criterion is shown to be necessary in general and sufficient for languages consisting of monadic function symbols and constants. The proof is mainly based on the existence of most general solutions for solvable semi-unification problems.

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. Baaz, M. Note on the existence of most general semi-unifiers. In Arithmetic, Proof Theory and Computational Complexity, P. Clote and J. Krajíček, editors, pp. 20–29. Oxford University Press, 1993.

    Google Scholar 

  2. Baaz, M. and P. Pudlák. Kreisel's conjecture for L∃1. In Arithmetic, Proof Theory and Computational Complexity, P. Clote and J. Krajíček, editors, pp. 30–60. Oxford University Press, 1993.

    Google Scholar 

  3. Chang, C.-L. and Lee, R.C.-T. Symbolic Logic and Mechanical Theorem Proving. Academic Press, 1973.

    Google Scholar 

  4. Farmer, W. M. A unification algorithm for second-order monadic terms. In Ann. Pure Appl. Logic, 39 (1988), 131–174.

    Article  Google Scholar 

  5. Krajíček, J. and P. Pudlák. The number of proof lines and the size of proofs in first order logic. Arch. Math. Logic, 27 (1988), 69–84.

    Article  Google Scholar 

  6. Kreisel, G. Generalizing Proofs: Implications for Generalizing Theorems Proved in Relatively Few Lines, I. Unpublished manuscript.

    Google Scholar 

  7. Kfoury, A., J. Tiuryn, and P. Urzyczyn. The undecidability of the semiunification problem. Information and Computation, 102 (1993), 83–101.

    Article  Google Scholar 

  8. Makanin, G. S. The problem of solvability of equations in a free semigroup. Mat. Sb., 103(2), 147–236. English translation in Math. USSR Sb., 32 (1977).

    Google Scholar 

  9. Parikh, R. J. Some results on the length of proofs. Trans. Am. Math. Soc., 177 (1973), 29–36.

    Google Scholar 

  10. Richardson, D. Sets of theorems with short proofs. J. Symbolic Logic, 39(2), 235–242.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Wien, Öcterreich

    Matthias Baaz & Gernot Salzer

Authors
  1. Matthias Baaz
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gernot Salzer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Leszek Pacholski Jerzy Tiuryn

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Baaz, M., Salzer, G. (1995). Semi-unification and generalizations of a particularly simple form. In: Pacholski, L., Tiuryn, J. (eds) Computer Science Logic. CSL 1994. Lecture Notes in Computer Science, vol 933. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022250

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60017-6

  • Online ISBN: 978-3-540-49404-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation