{'fraction_non_alphanumeric': 0.01267605633802817, 'fraction_numerical': 0.004225352112676056, 'mean_word_length': 5.292035398230088, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
Reverse Mathematics of 
Divisibility in Integral 
Domains

This thesis establishes new results concerning the proof-theoretic strength of two classic theorems of Ring Theory relating to factorization in integral domains. The first theorem asserts that if every irreducible is a prime, then every element has at most one decomposition into irreducibles; the second states that well-foundedness of divisibility implies the existence of an irreducible factorization for each element. After introductions to the Algebra framework used and Reverse Mathematics, we show that the first theorem is provable in the base system of Second Order Arithmetic RCA0, while the other is equivalent over RCA0 to the system ACA0.