On the expressivity of feature logics with negation, functional uncertainty, and sort equations

Feature logics are the logical basis for so-called unification grammars studied in computational linguistics. We investigate the expressivity of feature terms with negation and the functional uncertainty construct needed for the description of long-distance dependencies and obtain the following results: satisfiability of feature terms is undecidable, sort equations can be internalized, consistency of sort equations is decidable if there is at least one atom, and consistency of sort equations is undecidable if there is no atom
Keywords feature logic  functional uncertainty  sort equations  undecidability
Categories (categorize this paper)
DOI 10.1007/BF01051766
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive

Upload a copy of this paper     Check publisher's policy     Papers currently archived: 44,474
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library

References found in this work BETA

The Word Problem.William W. Boone - 1962 - Journal of Symbolic Logic 27 (2):241-242.

Add more references

Citations of this work BETA

Is There a Genuine Modal Perspective on Feature Structures?Marcus Kracht - 1995 - Linguistics and Philosophy 18 (4):401 - 458.

Add more citations

Similar books and articles


Added to PP index

Total views
24 ( #367,671 of 2,273,208 )

Recent downloads (6 months)
2 ( #563,270 of 2,273,208 )

How can I increase my downloads?


My notes

Sign in to use this feature