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

Versione 1.2.0.0 (15,5 KB) da Jos Martin
Code to verify the claims made in the paper of the same name.
0.0
(0)
507 download
Aggiornato 8 gen 2010

Visualizza la licenza

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'.

Cita come

Jos Martin (2025). The complexity of positive first-order logic without equality: The four-element case (https://it.mathworks.com/matlabcentral/fileexchange/26264-the-complexity-of-positive-first-order-logic-without-equality-the-four-element-case), MATLAB Central File Exchange. Recuperato .

Compatibilità della release di MATLAB
Creato con R2009a
Compatibile con qualsiasi release
Compatibilità della piattaforma
Windows macOS Linux
Tag Aggiungi tag

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Versione Pubblicato Note della release
1.2.0.0

Added link to paper
1.1.0.0

Typo in Title
1.0.0.0