On completeness theorems for feature logics

DOI10.1007/BF02451553MaRDI QIDQ1353907zbMATH OpenFDO

Authors M. Andrew Moshier

Publication date 12 May 1997

Published in Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

zbMATH Keywords

semanticscompletenesscut eliminationinformation systemssequent calculusKripke structuresdomain of descriptionsfeature structures

Mathematics Subject Classification ID

Logic of natural languages (03B65) Proof theory in general (including proof-theoretic semantics) (03F03) Cut-elimination and normal-form theorems (03F05) Logic in artificial intelligence (68T27)

Recommendations

• scientific article; zbMATH DE number 65754
• A complete and recursive feature theory
• scientific article; zbMATH DE number 1330429
• Completeness Results for Lambek Syntactic Calculus

Cites work

• scientific article; zbMATH DE number 4055576 (Why is no real title available?)
• scientific article; zbMATH DE number 3780545 (Why is no real title available?)
• scientific article; zbMATH DE number 65754 (Why is no real title available?)
• scientific article; zbMATH DE number 3497860 (Why is no real title available?)
• An algebraic approach to non-classical logics
• Semantical investigations in Heyting's intuitionistic logic
• The logic of unification in grammar

Cited in

(5)

• On the expressivity of feature logics with negation, functional uncertainty, and sort equations
• scientific article; zbMATH DE number 1341541 (Why is no real title available?)
• A complete axiomatization of a theory with feature and arity constraints
• scientific article; zbMATH DE number 65754 (Why is no real title available?)
• A complete and recursive feature theory

This page was built for publication: On completeness theorems for feature logics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1353907)