Abstract
This paper studies ‘Fool's models’ of combinatory logic, and relates them to Hindley's ‘D-completeness’ problem. A ‘fool's model’ is a family of sets of → formulas, closed under condensed detachment. Alternatively, it is a ‘model’ ofCL in naive set theory. We examine Resolution; and the P-W problem. A sequel shows T→ is D-complete; also, its extensions. We close with an implementation FMO of these ideas.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Anderson, A. R., and Belnap, Jr., N. D.,Entailment, Vol. I, Princeton (1975).
Barendregt H., Coppo M. and Dezani-Ciancaglini M., ‘A filter lambda model and the completeness of type assignment’,Journal of Symbolic Logic 48, 931–40 (1983).
Belnap N. D.Jr., ‘The 2 property’,Relevance Logic Newsletter 1 173–180 (1976).
Birkhoff, Garrett,Lattice Theory, 3rd ed., Providence (1967).
Bunder, M. W., ‘Corrections to “A result for combinators, BCK logics, and BCK algebras,”’Logique et Analyse, forthcoming.
Bunder M. W., and Meyer R. K., ‘A result for combinators, BCK logics, and BCK algebras’,Logique et Analyse 28, 33–40 (1985).
Church, A.,The Calculi of Lambda-Conversion, Ann. of Math. Studies 6, Princeton (1941) 2nd ed. (1951).
Coppo M., and Dezani-Ciancaglini M., ‘A new type assignment for lambda terms’,Archiv Math. Logik 19, 139–156 (1978).
Curry, H. B.,Foundations of Mathematical Logic, New York (1963).
Curry H. B., and Feys R.,Combinatory Logic, Vol. I, North-Holland, Amsterdam (1958).
Girard J. Y., ‘Linear logic’,Theoretical Computer Science 50, 1–102 (1987).
Hindley J. R., and Meredith David, ‘Principal type-schemes and condensed detachment’,The Journal of Symbolic Logic 55, 90–105 (1990).
Hindley, J. R., and Seldin, J. P.,Introduction to Combinators and λ-Calculus, Cambridge (1986).
Kalman J. A., ‘Condensed detachment as a rule of inference’,Studia Logica 42, 443–451 (1983).
Martin, E. P. ‘The P-W problem’, Doctoral dissertation, Australian National University (1979).
Meredith D., ‘In memoriam Carew Arthur Meredith’,Notre Dame Journal of Formal Logic 18 513–516 (1977).
Meyer R. K., ‘New axiomatics for relevant logics I’,Journal of Philosophical Logic 3, 53–68 (1974).
Meyer, R. K., and Bunder, M. W., ‘Condensed detachment and combinators’, to appear in M. A. McRobbie (ed.). A partial preprint is TRP-ARP-88, available from Automated Reasoning Project, ANU.
Meyer R. K., and Routley R., ‘Algebraic analysis of entailment I’,Logique et Analyse 15 407–428 (1972).
Meyer, R. K., and Slaney, J. K., ‘Abelian logic, in G. Priest, R. Routley, and J. Norman (eds.),Paraconsistent Logics, Philosophia Verlag (1988).
Ohlbach H. and Wrightson G., ‘Belnap's problem in relevance logic’,Association of Automated Reasoning Newsletter 2 3–5 (1983).
Powers L., ‘On P-W’,Relevance Logic Newsletter 1 131–142 (1976).
Prior, A. N.,Formal Logic, Oxford (1955).
Rasiowa, H., and Sikorski, R.,The Mathematics of Metamathematics, Warsaw (1963).
Robinson J. A., ‘A machine-oriented logic based on the resolution principle’,J. Assoc. Comput Machinery 12, 23–41 (1965).
Robinson, J. A.,Logic: Form and Function. The Mechanization of Deductive Reasoning, Edinburgh (1979).
Routley R., Meyer R. K., ‘The semantics of entailment III’,Journal of Philosophical Logic 1 192–208 (1972).
Sallé P., ‘Une extension de la théorie des types’,Springer Lecture Notes in Computer Science Vol. 62, pp. 398–419 (1978).
Siekmann, J. H., ‘Unification theory’, typescript, Kaiserslautern (1987).
Thistlewaite, P. B., McRobbie, M. A., and Meyer, R. K.,Automated Theorem-Proving in Non-Classical Logics, in Research Notes in Theoretical Computer Science series, London, N. Y., and Toronto (1988).
Urquhart A., ‘The undecidability of entailment and relevant implication’,Journal of Symbolic Logic 49, 1059–1073 (1984).
Whitehead, A. N., and Russell, B.,Principa Mathematica. 3 Vols. Cambridge (1910–1913). 2nd ed. (1925–1927).
Wos, L., and McCune, W., ‘Searching for fixed point combinators by using automated theorem proving: A preliminary report’, ANL-88-10, monograph, Argonne (1988).
Wos, L., Overbeek, R., Lusk, E., and Boyle, J.,Automated Reasoning. Introduction and Applications, Englewood Cliffs (1984).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Meyer, R.K., Bunder, M.W. & Powers, L. Implementing the ‘Fool's model’ of combinatory logic. J Autom Reasoning 7, 597–630 (1991). https://doi.org/10.1007/BF01880331
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01880331