Hierarchical formula classes with respect to semi-classical prenex normalization
Makoto Fujiwara, Taishi Kurahashi

TL;DR
This paper introduces new classes of first-order formulas, refining existing classes, to better understand semi-classical prenex normalization and its limitations in constructive theories.
Contribution
It defines the classes E_k^n and U_k^n, showing they precisely correspond to ext{Sigma}_k and ext{Pi}_k classes under n-th level semi-classical prenex normalization, refining previous classes.
Findings
Introduced classes E_k^n and U_k^n for semi-classical prenex normalization.
Established the correspondence of these classes with ext{Sigma}_k and ext{Pi}_k.
Connected the classes to intuitionistic arithmetic with restricted law-of-excluded-middle.
Abstract
In [10], the authors formalized the standard transformation procedure for prenex normalization of first-order formulas and showed that the classes and introduced in Akama et al. [1] are exactly the classes induced by and respectively via the transformation procedure. In that sense, the classes and correspond to and based on classical logic respectively. On the other hand, some transformations of the prenex normalization are not possible in constructive theories. In this paper, we introduce new classes and of first-order formulas with two parameters and , and show that they are exactly the classes induced by and respectively according to the -th level semi-classical prenex normalization, which is obtained by the prenex…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLogic, programming, and type systems · semigroups and automata theory · Advanced Algebra and Logic
