Open Access. Powered by Scholars. Published by Universities.®
Logic and Foundations of Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
Articles 1 - 2 of 2
Full-Text Articles in Logic and Foundations of Mathematics
Primality Proving Based On Eisenstein Integers, Miaoqing Jia
Primality Proving Based On Eisenstein Integers, Miaoqing Jia
Honors Theses
According to the Berrizbeitia theorem, a highly efficient method for certifying the primality of an integer N ≡ 1 (mod 3) can be created based on pseudocubes in the ordinary integers Z. In 2010, Williams and Wooding moved this method into the Eisenstein integers Z[ω] and defined a new term, Eisenstein pseudocubes. By using a precomputed table of Eisenstein pseudocubes, they created a new algorithm in this context to prove primality of integers N ≡ 1 (mod 3) in a shorter period of time. We will look at the Eisenstein pseudocubes and analyze how this new algorithm works with the …
Reading Between The Lines: Verifying Mathematical Language, Tristan Johnson
Reading Between The Lines: Verifying Mathematical Language, Tristan Johnson
Honors Theses
A great deal of work has been done on automatically generating automated proofs of formal statements. However, these systems tend to focus on logic-oriented statements and tactics as well as generating proofs in formal language. This project examines proofs written in natural language under a more general scope of mathematics. Furthermore, rather than attempting to generate natural language proofs for the purpose of solving problems, we automatically verify human-written proofs in natural language. To accomplish this, elements of discourse parsing, semantic interpretation, and application of an automated theorem prover are implemented.