MODNET
Research Training Network in Model Theory
Publications > Preprint server > Preprint Number 2604

Preprint Number 2604

Previous Next Preprint server


2604. Satoru Kuroda
Formalizing Pfaffian in bounded arithmetic
E-mail:

Submission date: 2 April 2024

Abstract:

We formalize algorithms computing Pfaffian in the theory of bounded arithmetic for sharpL which is based on Berkowitz algorithm for the determinant. We also prove relations among Pfaffian properties. Furthermore, we give an algorithm for Pfaffian pairs as well.

Mathematics Subject Classification: 03B70, 15A15, 03D15

Keywords and phrases:

Full text arXiv 2404.01728: pdf, ps.


Last updated: April 22 2024 20:38 Please send your corrections to: