Ticket Entailment is decidable
暂无分享,去创建一个
[1] Martin W. Bunder,et al. Combinatory abstraction using B, 6' and friends* , 1994 .
[2] Jean-Louis Krivine,et al. Lambda-calculus, types and models , 1993, Ellis Horwood series in computers and their applications.
[3] H. Keisler,et al. Handbook of mathematical logic , 1977 .
[4] Wilhelm Ackermann,et al. Begründung einer strengen Implikation , 1956, Journal of Symbolic Logic.
[5] Katalin Bimbó,et al. Types of $\mathsf{I}$ -Free Hereditary Right Maximal Terms , 2005, J. Philos. Log..
[6] Richard Sylvan,et al. The semantics of entailment — III , 1972, J. Philos. Log..
[7] Martin W. Bunder,et al. Lambda Terms Definable as Combinators , 1996, Theor. Comput. Sci..
[8] Joseph B. Kruskal,et al. The Theory of Well-Quasi-Ordering: A Frequently Discovered Concept , 1972, J. Comb. Theory A.
[9] Vito F. Sinisi,et al. Entailment: The Logic of Relevance and Necessity , 1996 .
[10] Alasdair Urquhart,et al. The undecidability of entailment and relevant implication , 1984, Journal of Symbolic Logic.
[11] Jan Willem Klop,et al. Term Rewriting Systems: From Church-Rosser to Knuth-Bendix and Beyond , 1990, ICALP.
[12] Paulo J. S. Silva,et al. The decidability of a fragment of BB'IW-logic , 2004, Theor. Comput. Sci..
[13] Richard Sylvan,et al. The semantics of entailment—II , 1972, Journal of Philosophical Logic.
[14] Graham Higman,et al. Ordering by Divisibility in Abstract Algebras , 1952 .
[15] Paul-André Melliès,et al. On a Duality Between Kruskal and Dershowitz Theorems , 1998, ICALP.
[16] Enno Ohlebusch,et al. Term Rewriting Systems , 2002 .