Skip to main content
SpringerLink
Log in

Connected sets of types and categorial consequence

  • Selected Papers
  • Conference paper
  • First Online:
Book cover Logical Aspects of Computational Linguistics (LACL 1996)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1328))

  • 120 Accesses

Abstract

Being a complement to [9], which concerns mainly general properties of infinite, unifiable sets of arbitrary terms, this paper provides an analysis of some specific features of sets of types and their behaviour under the influence of substitutions, especially unifiers.

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. W. Buszkowski, Solvable Problems for Classical Categorial Grammars, Bull. Pol. Acad. Scie. Math. 35 (1987), pp. 373–382.

    MATH  MathSciNet  Google Scholar 

  2. W. Buszkowski, Discovery Procedures for Categorial Grammars, in [6].

    Google Scholar 

  3. W. Buszkowski and G. Penn, Categorial Grammars Determined from Linguistic Data by Unification, Studia Logica XLIX, 4 (1990), pp. 431–454.

    Article  MathSciNet  Google Scholar 

  4. M. Kanazawa, Identification in the Limit of Categorial Grammars, Journal of Logic, Language and Information, Vol. 5 No. 2, (1996), pp. 115–155.

    Article  MATH  MathSciNet  Google Scholar 

  5. M. Kanazawa, Learnable Classes of Categorial Grammars, Dissertation, Stanford University, 1994.

    Google Scholar 

  6. E. Klein and J. van Benthem (eds), Categories, Polymorphism an Unification, Universiteit van Amsterdam, Amsterdam, 1987.

    Google Scholar 

  7. J. W. Lloyd, Foundations of Logic Programming, Springer-Verlag, Berlin, 1987.

    MATH  Google Scholar 

  8. J. Marciniec, Learning Categorial Grammars by Uniffcation with Negative Constraints, Journal of Applied Non-Classical Logics, 4 (1994), pp. 181–200.

    MATH  MathSciNet  Google Scholar 

  9. J. Marciniec, Infinite Set Unification with Application to Categorial Grammar, Studia Logica LVIII, 3 (1997), to appear.

    Google Scholar 

  10. J. van Benthem, Categorial Equations, in [6].

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Adam Mickiewicz University, Poznan, Poland

    Jacek Marciniec

Authors
  1. Jacek Marciniec
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Retoré

Rights and permissions

Reprints and permissions

Copyright information

© 1997 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Marciniec, J. (1997). Connected sets of types and categorial consequence. In: Retoré, C. (eds) Logical Aspects of Computational Linguistics. LACL 1996. Lecture Notes in Computer Science, vol 1328. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052163

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-63700-4

  • Online ISBN: 978-3-540-69631-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation