Abelian groups and quadratic residues in weak arithmetic

Mathematical Logic Quarterly 56 (3):262-278 (2010)
  Copy   BIBTEX

Abstract

We investigate the provability of some properties of abelian groups and quadratic residues in variants of bounded arithmetic. Specifically, we show that the structure theorem for finite abelian groups is provable in S22 + iWPHP, and use it to derive Fermat's little theorem and Euler's criterion for the Legendre symbol in S22 + iWPHP extended by the pigeonhole principle PHP. We prove the quadratic reciprocity theorem in the arithmetic theories T20 + Count2 and I Δ0 + Count2 with modulo-2 counting principles

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 94,045

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Definable groups in models of Presburger Arithmetic.Alf Onshuus & Mariana Vicaría - 2020 - Annals of Pure and Applied Logic 171 (6):102795.
Arithmetic of Dedekind cuts of ordered Abelian groups.Antongiulio Fornasiero & Marcello Mamino - 2008 - Annals of Pure and Applied Logic 156 (2):210-244.
Structures interpretable in models of bounded arithmetic.Neil Thapen - 2005 - Annals of Pure and Applied Logic 136 (3):247-266.
Hyperdefinable groups in simple theories.Frank Wagner - 2001 - Journal of Mathematical Logic 1 (01):125-172.
The weak pigeonhole principle for function classes in S12.Norman Danner & Chris Pollett - 2006 - Mathematical Logic Quarterly 52 (6):575-584.
Approximate counting by hashing in bounded arithmetic.Emil Jeřábek - 2009 - Journal of Symbolic Logic 74 (3):829-860.

Analytics

Added to PP
2013-12-01

Downloads
22 (#700,182)

6 months
3 (#1,208,833)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Citations of this work

Iterated multiplication in $$ VTC ^0$$.Emil Jeřábek - forthcoming - Archive for Mathematical Logic.
Iterated multiplication in $$ VTC ^0$$ V T C 0. [REVIEW]Emil Jeřábek - 2022 - Archive for Mathematical Logic 61 (5-6):705-767.

Add more citations

References found in this work

Existence and feasibility in arithmetic.Rohit Parikh - 1971 - Journal of Symbolic Logic 36 (3):494-508.
Dual weak pigeonhole principle, Boolean complexity, and derandomization.Emil Jeřábek - 2004 - Annals of Pure and Applied Logic 129 (1-3):1-37.
The strength of sharply bounded induction.Emil Jeřábek - 2006 - Mathematical Logic Quarterly 52 (6):613-624.

View all 11 references / Add more references