ON THE RABIN’S SPEED-UP OF PROOFS FOR SOME SYSTEMS OF FIRST ORDER LOGIC

Author(s)

ON THE RABIN’S SPEED-UP OF PROOFS FOR SOME SYSTEMS OF FIRST ORDER LOGIC A.A. Chubaryan

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.

DOI: 10.46991/PYSUA.2010.44.1.061 Physical and Mathematical Sciences, 44(1 (221) 61-63

Download PDF

Keywords

speed-up, proof complexity, predicate calculus, ordinary theory

Check for updates

Share

Contact admin with any questions, comments or concerns

[email protected]