Hostname: page-component-74656f9884-c52kr Total loading time: 0 Render date: 2026-11-07T03:27:04.473Z Has data issue: false hasContentIssue false

PRENEX NORMAL FORM THEOREMS IN SEMI-CLASSICAL ARITHMETIC

Published online by Cambridge University Press:  11 June 2021

MAKOTO FUJIWARA
Affiliation:
SCHOOL OF SCIENCE AND TECHNOLOGY MEIJI UNIVERSITY, 1-1-1 HIGASHI-MITA, TAMA-KU, KAWASAKI-SHI 214-8571 KANAGAWA, JAPAN E-mail: makotofujiwara@meiji.ac.jp
TAISHI KURAHASHI
Affiliation:
GRADUATE SCHOOL OF SYSTEM INFORMATICS KOBE UNIVERSITY, 1-1 ROKKODAI, NADA 657-8501 KOBE, JAPAN E-mail: kurahashi@people.kobe-u.ac.jp
Rights & Permissions [Opens in a new window]

Abstract

Akama et al. [1] systematically studied an arithmetical hierarchy of the law of excluded middle and related principles in the context of first-order arithmetic. In that paper, they first provide a prenex normal form theorem as a justification of their semi-classical principles restricted to prenex formulas. However, there are some errors in their proof. In this paper, we provide a simple counterexample of their prenex normal form theorem [1, Theorem 2.7], then modify it in an appropriate way which still serves to largely justify the arithmetical hierarchy. In addition, we characterize a variety of prenex normal form theorems by logical principles in the arithmetical hierarchy. The characterization results reveal that our prenex normal form theorems are optimal. For the characterization results, we establish a new conservation theorem on semi-classical arithmetic. The theorem generalizes a well-known fact that classical arithmetic is $\Pi _2$-conservative over intuitionistic arithmetic.

Information

Type
Article
Copyright
© Association for Symbolic Logic 2021
Figure 0

Table 1 Characterizations of the prenex normal form theorems