Abstract
The Ackermann constant problem for a logicL is to determine how many sentential constants generated by closing {t} under the connectives ofL are non-equivalent according toL. This problem was solved for the logicR by the author in 1979–1980. First a constraint satisfaction program was used to generate appropriate finite algebras. Then the constant fragment of their direct product was generated and studied. This paper is a history of the work, explaining the problems, the solution method and the algorithms used.
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, N. D.,Entailment: The Logic of Relevance and Necessity, Vol. I, Princeton University Press (1975).
Belnap, N. D. and Inser, D., ‘TESTER: a program which interactively tests either formula sets or formulas against matrix sets’, Pittsburg (1986).
Dunn J. M., ‘Relevance logic and entailment’, In Gabbay D., and Günthner F. (eds.),Handbook of Philosophical Logic, Vol. 3, Reidel, Dordrecht (1986).
Lusk E. et al,Portable Programs for Parallel Processors, Holt, Rinehart & Winston, New York (1987).
Martin, E. P. and Meyer, R. K., ‘Solution to the P — W Problem’,J. Symbolic Logic 47 (1982).
Meyer, R. K., ‘Sentential constants in R and R¬’,Studia Logica 45 (1986).
Meyer, R. K. and Slaney, J. K., ‘Abelian logic (from A to Z)’, Australian National University Logic Group Research Paper # 7, Canberra, 160 pp. (1979).
Meyer, R. K. and Slaney, J. K., ‘Computing DeMorgan monoids’, Technical report TR-ARP-1/87, Canberra (1987).
Slaney, J. K., ‘Computers and relevant logic: A project in computing matrix model structures for propositional logics’, doctoral dissertation (unpulished), Australian National University, Canberra (1980).
Slaney J. K., ‘3088 varieties: A solution to the Ackermann constant problem’,J. Symbolic Logic 50, 487–501 (1984).
Slaney, J. K., ‘On the structure of DeMorgan monoids, with corollaries on relevant logic and theories’,Notre Dame J. Formal Logic, forthcoming.
Thistlewaite P. B., McRobbie M. A., and Meyer R. K.,Automated Theorem Proving in Non-Classical Logics, Pitman, London (1988).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Slaney, J.K. The Ackermann constant theorem: A computer-assisted investigation. J Autom Reasoning 7, 453–474 (1991). https://doi.org/10.1007/BF01880324
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF01880324