ISSN:
1573-0670
Keywords:
Relevant logic
;
sentential constants
;
constraint satisfaction
Source:
Springer Online Journal Archives 1860-2000
Topics:
Computer Science
Notes:
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.
Type of Medium:
Electronic Resource
URL:
http://dx.doi.org/10.1007/BF01880324
Permalink