Natural Science, Mathematics, 2025
ON THE RABIN’S SPEED-UP OF PROOFS FOR SOME SYSTEMS OF FIRST ORDER LOGIC
This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Submitted: 2025-02-27; Published: 2025-02-27
© 2025 by author(s) and The Gufo Inc.
This work is licensed under Creative Commons Attribution–NonCommercial International License
(CC BY-NC 4.0).
Abstract
In the paper a notion of ordinary theory is considered. It is proved that some systems of first order predicate calculus are ordinary. This property is used for a proof complexity comparison in the considered systems.