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

Anahit Chubaryan

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.

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.

Author(s)

Table of Contents

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

Abstract

Author(s)

Table of Contents

Related Articles

ON UNIQUENESS OF HOLOMORPHIC AND BOUNDED OUTSIDE THE CLOSED LOGARITHMIC SECTOR FUNCTIONS REPRESENTABLE BY LACUNARY POWER SERIES

COMPUTER DETECTING AND PROCESSING OF THE SIGNALS OF A FLAT-COIL ABSOLUTE-POSITION SENSOR BASED SEISMIC DETECTOR

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

Abstract

Subscribe to TheGufo Newsletter​

Subscribe to TheGufo Newsletter