Cut-eliminability in second order logic calculi
Logic
2017-01-05 v1
Abstract
In this paper we propose a semantics in which the truth value of a formula is a pair of elements in a complete Boolean algebra. Through the semantics we can unify largely two proofs of cut-eliminability (Hauptsatz) in classical second order logic calculus, one is due to Takahashi-Prawitz and the other by Maehara.
Keywords
Cite
@article{arxiv.1701.00929,
title = {Cut-eliminability in second order logic calculi},
author = {Toshiyasu Arai},
journal= {arXiv preprint arXiv:1701.00929},
year = {2017}
}