Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 6 of 6 for “"Constructivity"”.
-
Non-Constructivity in Security Proofs
In the field of cryptography, one generally obtains assurances for the security of a cryptographic protocol by giving a reductionist security proof, which is comprised of a reduction from breaking a mathematical problem (that is well-studied and widely believed to be intractable) to the breaking of …
-
Constructivity and Predicativity: Philosophical Foundations
The thesis examines two dimensions of constructivity that manifest themselves within foundational systems for Bishop constructive mathematics: intuitionistic logic and predicativity. The latter, in particular, is the main focus of the thesis. The use of intuitionistic logic affects the notion of …
-
A Classification Approach for Automated Reasoning Systems--A Case Study in Graph Theory
… based on an attribute called Linear Recursive Constructivity (LRC). LRC defines classes by an algebraic formula supported by background knowledge of graph types. We use subsumption checking on decomposed algebraic expressions of graph classes as a major proof method. The search is guided by …
-
Constructive and predicative locale theory in univalent foundations
… on the theory of spectral and Stone locales. The constructivity of our foundational setting means that we do not use any classical principles such as the axiom of choice (or any of its weaker forms), the law of excluded middle, or any form of the limited principle of omniscience. In the context of …
-
The (Im)mediate Animal: Interspecies Entanglements in Early Enlightenment Transactions
… of other-than-humans and the layers of co-constructivity present in any transspecies engagement. Relying solely upon intellectual histories of interspecies contact during the early Enlightenment period often disregards the rich semiotic worlds, interests, and active capabilities of …
-
On characterizing optimal Boolean circuits and their applications
Determining the complexity of circuit minimization is a longstanding challenge. To clarify the landscape of minimal circuits, we ask: for a Boolean function $f$ and a complexity measure $\mu$, can we characterize the $\mu$-optimal circuits that compute $f$? For some $(f, \mu)$ pairs---e.g., $f$ is …