The complexity of positive first-order logic without equality: The four-element case

Code to verify the claims made in the paper of the same name.

This submission contains the code used to verify the claims made about pSpace, NP and co-NP classes in the four element case. The original paper that references these claims can be found at http://drops.dagstuhl.de/opus/volltexte/2010/2367/pdf/09441.MartinBarnaby.Paper.2367.pdf.

To run the verification first ensure that you have built the mex files by typing 'buildAll' in MATLAB. Once the mex code is built you can verify the pSpace claims using the script 'pSpaceMonoid's, the NP claims with 'npMonoids' and the co-NP with 'co_npMonoids'.