A Logic for Trial and Error Classifiers
- 371 Downloads
Trial and error classifiers, corresponding to concepts which change their extensions over time, are introduced and briefly philosophically motivated. A fragment of the language of classical first-order logic is given a new semantics, using \(\omega \)-sequences of classical models, in order to interpret the basic predicates as classifiers of this kind. It turns out that we can use a natural deduction proof system which differs from classical logic only in the conditions for application of existential elimination. Soundness and completeness theorems are proved for this system.
KeywordsClassifiers Completeness Experimental logic Trial and error
As usual, I am deep in intellectual debt to my collegues in the logic group at my department at the University of Gothenburg, and special mention goes to Christian Bennet and Fredrik Engström for outstanding generosity with their time. Valuable comments from two anonymous reviewers have been most helpful in revising the paper. Most ideas which underlie, or eventually became part of, this paper have previously been presented in different contexts, and I would in particular like to thank the Logic and Language group at ILLC, Amsterdam, for inviting me to give a talk at their colloquium on this subject. The work on this paper was partly funded by the foundation Kungliga och Hvitfeldtska stiftelsen.