Abstract

In the present paper, we would like to show a theorem concerning with reducibility of provability in the primitive logic. This theorem seems to suggest a procedure to find the proof-note of a given proposition which is provable in the primitive logic.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call