Open Access. Powered by Scholars. Published by Universities.®
- Discipline
- Institution
- Keyword
-
- <p>Reverse mathematics.</p> <p>Logic - Mathematics.</p> (1)
- Application-specific integrated circuit (1)
- Applied sciences (1)
- Artificial intelligence (1)
- Asynchronous logic (1)
-
- Computable (1)
- Congruence (1)
- Critical Values (1)
- Evolution (1)
- Gates (1)
- Harder (1)
- Hecke Eigenvalues (1)
- Language (1)
- Large Primes (1)
- Linear (1)
- Logic (1)
- Modular Forms (1)
- Neural networks (1)
- Neurology (1)
- Order (1)
- Philosophy (1)
- Reduction (1)
- Religion and theology (1)
- Reverse Mathematics (1)
- Schmitt-trigger gate (1)
- Siegel Modular Forms (1)
- Silicon-on-insulator (1)
- Static noise margin (1)
- Turing (1)
Articles 1 - 5 of 5
Full-Text Articles in Logic and Foundations
Math, Minds, Machines, Christopher V. Carlile
Math, Minds, Machines, Christopher V. Carlile
Chancellor’s Honors Program Projects
No abstract provided.
Ultra-Low Voltage Digital Circuits And Extreme Temperature Electronics Design, Aaron J. Arthurs
Ultra-Low Voltage Digital Circuits And Extreme Temperature Electronics Design, Aaron J. Arthurs
Graduate Theses and Dissertations
Certain applications require digital electronics to operate under extreme conditions e.g., large swings in ambient temperature, very low supply voltage, high radiation. Such applications include sensor networks, wearable electronics, unmanned aerial vehicles, spacecraft, and energyharvesting systems. This dissertation splits into two projects that study digital electronics supplied by ultra-low voltages and build an electronic system for extreme temperatures. The first project introduces techniques that improve circuit reliability at deep subthreshold voltages as well as determine the minimum required supply voltage. These techniques address digital electronic design at several levels: the physical process, gate design, and system architecture. This dissertation analyzes …
Computable Linear Orders And Turing Reductions, Whitney P. Turner
Computable Linear Orders And Turing Reductions, Whitney P. Turner
Master's Theses
This thesis explores computable linear orders through Turing Reductions and codes zero jump and zero double jump into linear orders using discrete, dense, and block linear relations.
Verifying Harder's Conjecture For Classical And Siegel Modular Forms, David Sulon
Verifying Harder's Conjecture For Classical And Siegel Modular Forms, David Sulon
Honors Theses
A conjecture by Harder shows a surprising congruence between the coefficients of “classical” modular forms and the Hecke eigenvalues of corresponding Siegel modular forms, contigent upon “large primes” dividing the critical values of the given classical modular form.
Harder’s Conjecture has already been verified for one-dimensional spaces of classical and Siegel modular forms (along with some two-dimensional cases), and for primes p 37. We verify the conjecture for higher-dimensional spaces, and up to a comparable prime p.
On The Logic Of Reverse Mathematics, Alaeddine Saadaoui
On The Logic Of Reverse Mathematics, Alaeddine Saadaoui
Theses, Dissertations and Capstones
The goal of reverse mathematics is to study the implication and non-implication relationships between theorems. These relationships have their own internal logic, allowing some implications and non-implications to be derived directly from others. The goal of this thesis is to characterize this logic in order to capture the relationships between specific mathematical works. The results of our study are a finite set of rules for this logic and the corresponding soundness and completeness theorems. We also compare our logic with modal logic and strict implication logic. In addition, we explain two applications of S-logic in topology and second order arithmetic.