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 20 of 3815 for “"proof"”.
-
Proof Processes of Novice Mathematics Proof Writers
… constructing, understanding, and validating proofs (Martin and Harel, 1989; Coe and Ruthven, 1994; Moore, 1994; Baker, 1996; Mingus and Grassl, 1999; Knuth, 2002; Weber, 2001, 2003). However, proofs are the foundation of mathematics; it is therefore essential that every university mathematics …
-
Proof Processes of Novice Mathematics Proof Writers
… constructing, understanding, and validating proofs (Martin and Harel, 1989; Coe and Ruthven, 1994; Moore, 1994; Baker, 1996; Mingus and Grassl, 1999; Knuth, 2002; Weber, 2001, 2003). However, proofs are the foundation of mathematics; it is therefore essential that every university mathematics …
-
Negative Proof
A collection of poems by Kathryn Puerini.
-
Negative Proof
A collection of poems by Kathryn Puerini.
-
A Proof-Theoretic Proof of Scott's General Interpolation Theorem
Made available in DSpace on 2014-12-09T22:17:58Z (GMT). No. of bitstreams: 1 7105021.pdf: 1318688 bytes, checksum: 57cea2ca67d226fd97797a80013274f2 (MD5) Previous issue date: 1970
-
Proof: A Collection
In my thesis, Proof, I have included a critical introduction exploring my development as a writer and the people and classes and life events that have shaped my writing thus far. Also, I have included three short stories, "The Lombard," "Proof' and "Persephone." In these stories, I have attempted …
-
Denotational proof languages
Thesis (Ph.D.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2000.
-
Proof-carrying data
… invariants. We propose a new approach, proof-carrying data (PCD), which sidesteps the threat of faults and leakage by reasoning about properties of a computation's output data, regardless of the process that produced it. In PCD, the system designer prescribes the desired properties of a …
-
Higher-order proof translation
… mathematical data between tools. Writing proof-translation tools is hard. The problem has both a theoretical side (to ensure that the translation is adequate) and a practical side (to ensure that the translation is feasible and usable). Moreover, the source and target proof formats might …
-
Undergraduate Mathematics Education Students' Understanding of Proof by Contradiction and Proof by Contraposition
Proof by contradiction (PBCd) and proof by contraposition (PBCp) are essential yet challenging for students, particularly undergraduate mathematics students, and are often perceived as less convincing and explanatory than direct proof (DP). While several factors have been identified as contributing …
-
Proof beyond a reasonable doubt
Proof beyond a reasonable doubt is the standard of proof that is applied in criminal cases. The burden of proving the guilt of the accused in this manner rests on the state, and does not shift to the accused. This is in contrast to the evidential burden which may shift to the accused to rebut a …
-
An Existential Proof of God
… objective thought, within which all traditional proofs of God lie. In other words, it will be argued that even if it is conceded that a conclusive proof of God is not possible, one can, nevertheless, be justified in one's belief in God without recourse to the traditional vein of logical-objective …
-
Prototyping a Scalable Proof Engine
… known as Rocq) or Lean is painfully slow. These proof assistants rely on proof engines to construct proofs of correctness for given properties, but to our knowledge, there is no widely available proof engine that offers strong performance guarantees. Even more frustrating is the lack of consensus …
-
Machine verification of mathematical proof
Thesis: Sc. D., Massachusetts Institute of Technology, Department of Mathematics, 1963
-
A Possible and Necessary Consistency Proof
… Gentzen continued the quest for consistency proofs of Peano arithmetic. He considered a finitistic or constructive proof still possible and necessary for the foundations of mathematics. For a proof to be meaningful, the principles relied on should be considered more reliable than the doubtful …
-
Quantum proof systems and entanglement theory
… In particular, quantum multi-prover interactive proof systems are defined based on complexity theory notions, while their characterization can be formulated using LOCC operations. On the other hand, the main resource in quantum information theory is entanglement, which can be considered as a …
-
Propositional proof systems : efficiency and automatizability
… two fundamental questions in propositional proof complexity: lower bounds on the size of the shortest proof and automatizability of propositional proof systems. With respect to the first part, we develop a new paradigm for proving lower bounds in propositional calculus. Our method is based …
-
Toward improved non-interactive proof systems
The study of non-interactive proof systems, such as Merlin-Arthur proof systems and probabilistically checkable proofs, can yield insights into problems for which we do not yet have efficient algorithms. This work compiles many recent results in improved non-interactive proof systems–primarily …
Page 1 of 191