论文信息 - The undecidability of entailment and relevant implication - 字舞流文

The undecidability of entailment and relevant implication

Alasdair Urquhart | A. Urquhart

[1] Kit Fine,et al. Models for entailment , 1974, J. Philos. Log..

[2] Robert K. Meyer,et al. Career induction stops here (and here = 2) , 1979, J. Philos. Log..

[3] R. Meyer,et al. The semantics of entailment — III , 1973 .

[4] Leonard Lipshitz. The undecidability of the word problems for projective geometries and modular lattices , 1974 .

[5] Nuel D. Belnap,et al. A Decision Procedure For the System EĪ of Entailment with Negation , 1965 .

[6] George Hutchinson,et al. Recursively unsolvable word problems of modular lattices and diagram-chasing , 1973 .

[7] Richard Routley,et al. An undecidable relevant logic , 1973 .

[8] Ralph Freese,et al. Free modular lattices , 1980 .