Finite models for some substructural logics

J K Slaney

Abstract


This paper is a report of computer-driven research into the modelling of propositional systems related both to linear logic and to relevant logic. One result is an exponential lower bound on the number of models of given size validating such systems. Another theorem explores dualities within models for such systems in order to explain striking regularities in the distribution of models of the system C. In these researches the computer figures not as a prover of theorems, nor even as a proof assistant, but as a source of quasi-empirical data.

Full Text:

PDF

Refbacks

  • There are currently no refbacks.