[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Log in

Prenex normalization and the hierarchical classification of formulas

  • Published:
Archive for Mathematical Logic Aims and scope Submit manuscript

Abstract

Akama et al. [1] introduced a hierarchical classification of first-order formulas for a hierarchical prenex normal form theorem in semi-classical arithmetic. In this paper, we give a justification for the hierarchical classification in a general context of first-order theories. To this end, we first formalize the standard transformation procedure for prenex normalization. Then we show that the classes \(\textrm{E}_k\) and \(\textrm{U}_k\) introduced in [1] are exactly the classes induced by \(\Sigma _k\) and \(\Pi _k\) respectively via the transformation procedure in any first-order theory.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Fig. 1

Similar content being viewed by others

References

  1. Akama, Y., Berardi, S., Hayashi, S., Kohlenbach, U.: An arithmetical hierarchy of the law of excluded middle and related principles. In: Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS’04), pp. 192–201 (2004). https://doi.org/10.1109/LICS.2004.1319613

  2. Enderton, H.B.: A Mathematical Introduction to Logic. Elsevier Science, Amsterdam (2001)

    Google Scholar 

  3. Shoenfield, J.R.: Mathematical Logic. Taylor & Francis, Abingdon (2001)

    Google Scholar 

  4. Mints, G.E.: Solvability of the problem of deducibility in LJ for a class of formulas not containing negative occurrences of quantifiers. In: Steklov Inst, vol. 98, pp. 135–145 (1968)

  5. Schubert, A., Urzyczyn, P., Zdanowski, K.: On the Mints hierarchy in first-order intuitionistic logic. Log. Methods Comput. Sci. (2017). https://doi.org/10.2168/LMCS-12(4:11)2016

    Article  Google Scholar 

  6. Fleischmann, J.: Syntactic preservation theorems for intuitionistic predicate logic. Notre Dame J. Formal Log. 51(2), 225–245 (2010). https://doi.org/10.1215/00294527-2010-014

    Article  MathSciNet  Google Scholar 

  7. Burr, W.: Fragments of Heyting arithmetic. J. Symbol. Log. 65(3), 1223–1240 (2000). https://doi.org/10.2307/2586698

    Article  MathSciNet  Google Scholar 

  8. Leivant, D.: Implicational complexity in intuitionistic arithmetic. J. Symbol. Log. 46(2), 240–248 (1981). https://doi.org/10.2307/2273617

    Article  MathSciNet  Google Scholar 

  9. Brock-Nannestad, T., Ilik, D.: An intuitionistic formula hierarchy based on high-school identities. Math. Log. Q. 65(1), 57–79 (2019). https://doi.org/10.1002/malq.201700047

    Article  MathSciNet  Google Scholar 

  10. Fujiwara, M., Kurahashi, T.: Prenex normal form theorems in semi-classical arithmetic. J. Symbol. Log. 86(3), 1124–1153 (2021). https://doi.org/10.1017/jsl.2021.47

    Article  MathSciNet  Google Scholar 

  11. Fujiwara, M., Kurahashi, T.: Conservation theorems on semi-classical arithmetic. J. Symbol. Log. 88(4), 1469–1496 (2023). https://doi.org/10.1017/jsl.2022.25

  12. Chang, C.C., Keisler, H.J.: Model Theory. Dover Books on Mathematics, 3rd edn. Dover Publications, NewYork (2013)

    Google Scholar 

  13. Boolos, G.: The Logic of Provability. Cambridge University Press, Cambridge (1993)

    Google Scholar 

Download references

Acknowledgements

The authors thank Ulrich Kohlenbach for pointing them out that the definition of \(\textrm{P}_0\) in [1] is different from that in its preprint version, to which the authors referred in the previous version of this paper. They also thank Danko Ilik for providing some information about related works. The first author was supported by JSPS KAKENHI Grant Numbers JP19J01239, JP20K14354 and JP23K03205, and the second author by JP19K14586 and JP23K03200.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Makoto Fujiwara.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Fujiwara, M., Kurahashi, T. Prenex normalization and the hierarchical classification of formulas. Arch. Math. Logic 63, 391–403 (2024). https://doi.org/10.1007/s00153-023-00899-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00153-023-00899-x

Keywords

Mathematics Subject Classification

Navigation