Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

You searched for subject:( Proofs). Showing records 1 – 30 of 121 total matches.

[1] [2] [3] [4] [5]

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters

1. Rice, Jennifer. Predicting students' approach to knowledge by analyzing misconceptions and errors students make writing proofs.

Degree: MS, Mathematics and Computer Science, 2016, Texas Woman's University

 For this quantitative research study, an existing proof rubric (Selden & Selden, 1987; Wheeler & Champion, 2011) for students’ errors and misconceptions was used to… (more)

Subjects/Keywords: Education; Algorithms; Discrete mathematics; Proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rice, J. (2016). Predicting students' approach to knowledge by analyzing misconceptions and errors students make writing proofs. (Masters Thesis). Texas Woman's University. Retrieved from http://hdl.handle.net/11274/9626

Chicago Manual of Style (16th Edition):

Rice, Jennifer. “Predicting students' approach to knowledge by analyzing misconceptions and errors students make writing proofs.” 2016. Masters Thesis, Texas Woman's University. Accessed September 22, 2020. http://hdl.handle.net/11274/9626.

MLA Handbook (7th Edition):

Rice, Jennifer. “Predicting students' approach to knowledge by analyzing misconceptions and errors students make writing proofs.” 2016. Web. 22 Sep 2020.

Vancouver:

Rice J. Predicting students' approach to knowledge by analyzing misconceptions and errors students make writing proofs. [Internet] [Masters thesis]. Texas Woman's University; 2016. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/11274/9626.

Council of Science Editors:

Rice J. Predicting students' approach to knowledge by analyzing misconceptions and errors students make writing proofs. [Masters Thesis]. Texas Woman's University; 2016. Available from: http://hdl.handle.net/11274/9626

2. Scott, Phil. Ordered geometry in Hilbert's Grundlagen der Geometrie.

Degree: PhD, 2015, University of Edinburgh

 The Grundlagen der Geometrie brought Euclid’s ancient axioms up to the standards of modern logic, anticipating a completely mechanical verification of their theorems. There are… (more)

Subjects/Keywords: 516.2; geometry; theorem proving; proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Scott, P. (2015). Ordered geometry in Hilbert's Grundlagen der Geometrie. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/15948

Chicago Manual of Style (16th Edition):

Scott, Phil. “Ordered geometry in Hilbert's Grundlagen der Geometrie.” 2015. Doctoral Dissertation, University of Edinburgh. Accessed September 22, 2020. http://hdl.handle.net/1842/15948.

MLA Handbook (7th Edition):

Scott, Phil. “Ordered geometry in Hilbert's Grundlagen der Geometrie.” 2015. Web. 22 Sep 2020.

Vancouver:

Scott P. Ordered geometry in Hilbert's Grundlagen der Geometrie. [Internet] [Doctoral dissertation]. University of Edinburgh; 2015. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/1842/15948.

Council of Science Editors:

Scott P. Ordered geometry in Hilbert's Grundlagen der Geometrie. [Doctoral Dissertation]. University of Edinburgh; 2015. Available from: http://hdl.handle.net/1842/15948


University of Ottawa

3. Sistany, Bahman. A Certified Core Policy Language .

Degree: 2016, University of Ottawa

 We present the design and implementation of a Certified Core Policy Language (ACCPL) that can be used to express access-control rules and policies. Although full-blown… (more)

Subjects/Keywords: access-control; formal verification; proofs; policy language

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sistany, B. (2016). A Certified Core Policy Language . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/34865

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sistany, Bahman. “A Certified Core Policy Language .” 2016. Thesis, University of Ottawa. Accessed September 22, 2020. http://hdl.handle.net/10393/34865.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sistany, Bahman. “A Certified Core Policy Language .” 2016. Web. 22 Sep 2020.

Vancouver:

Sistany B. A Certified Core Policy Language . [Internet] [Thesis]. University of Ottawa; 2016. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/10393/34865.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sistany B. A Certified Core Policy Language . [Thesis]. University of Ottawa; 2016. Available from: http://hdl.handle.net/10393/34865

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Glasgow

4. Matthews, Brian Martin. Dynamic order-sorted term-rewriting systems.

Degree: PhD, 1996, University of Glasgow

This thesis considers the problems of order-sorted equational logic and its operational interpretation, order-sorted term rewriting.

Subjects/Keywords: 510; Rewriting proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Matthews, B. M. (1996). Dynamic order-sorted term-rewriting systems. (Doctoral Dissertation). University of Glasgow. Retrieved from http://theses.gla.ac.uk/74495/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337505

Chicago Manual of Style (16th Edition):

Matthews, Brian Martin. “Dynamic order-sorted term-rewriting systems.” 1996. Doctoral Dissertation, University of Glasgow. Accessed September 22, 2020. http://theses.gla.ac.uk/74495/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337505.

MLA Handbook (7th Edition):

Matthews, Brian Martin. “Dynamic order-sorted term-rewriting systems.” 1996. Web. 22 Sep 2020.

Vancouver:

Matthews BM. Dynamic order-sorted term-rewriting systems. [Internet] [Doctoral dissertation]. University of Glasgow; 1996. [cited 2020 Sep 22]. Available from: http://theses.gla.ac.uk/74495/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337505.

Council of Science Editors:

Matthews BM. Dynamic order-sorted term-rewriting systems. [Doctoral Dissertation]. University of Glasgow; 1996. Available from: http://theses.gla.ac.uk/74495/ ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.337505


University of California – Berkeley

5. Vidick, Thomas. The Complexity of Entangled Games.

Degree: Computer Science, 2011, University of California – Berkeley

 Entanglement is at the heart of quantum mechanics. The nonlocal correlations that can be obtained from space-time separated measurements on an entangled state are a… (more)

Subjects/Keywords: Computer science; Quantum physics; Cryptography; Entanglement; Interactive Proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vidick, T. (2011). The Complexity of Entangled Games. (Thesis). University of California – Berkeley. Retrieved from http://www.escholarship.org/uc/item/5v49k1z2

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Vidick, Thomas. “The Complexity of Entangled Games.” 2011. Thesis, University of California – Berkeley. Accessed September 22, 2020. http://www.escholarship.org/uc/item/5v49k1z2.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Vidick, Thomas. “The Complexity of Entangled Games.” 2011. Web. 22 Sep 2020.

Vancouver:

Vidick T. The Complexity of Entangled Games. [Internet] [Thesis]. University of California – Berkeley; 2011. [cited 2020 Sep 22]. Available from: http://www.escholarship.org/uc/item/5v49k1z2.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Vidick T. The Complexity of Entangled Games. [Thesis]. University of California – Berkeley; 2011. Available from: http://www.escholarship.org/uc/item/5v49k1z2

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

6. Rajasekaran, Aayush. Using Automata Theory to Solve Problems in Additive Number Theory.

Degree: 2018, University of Waterloo

 Additive number theory is the study of the additive properties of integers. Perhaps the best-known theorem is Lagrange’s result that every natural number is the… (more)

Subjects/Keywords: Automata Theory; Number Theory; Formal languages; Automated proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rajasekaran, A. (2018). Using Automata Theory to Solve Problems in Additive Number Theory. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13202

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Rajasekaran, Aayush. “Using Automata Theory to Solve Problems in Additive Number Theory.” 2018. Thesis, University of Waterloo. Accessed September 22, 2020. http://hdl.handle.net/10012/13202.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Rajasekaran, Aayush. “Using Automata Theory to Solve Problems in Additive Number Theory.” 2018. Web. 22 Sep 2020.

Vancouver:

Rajasekaran A. Using Automata Theory to Solve Problems in Additive Number Theory. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/10012/13202.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Rajasekaran A. Using Automata Theory to Solve Problems in Additive Number Theory. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13202

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Brigham Young University

7. Vankamamidi, Pavan Kumar. Proofs of Correctness for Three Decentralized Authentication Protocols Using Strand Spaces.

Degree: MS, 2011, Brigham Young University

 Security is a major concern is today's online world. As online activities become increasingly sensitive, service providers rely on security protocols to ensure confidentiality, integrity… (more)

Subjects/Keywords: Formal proofs; pwdArmor; Kiwi; Luau; Strand Spaces; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Vankamamidi, P. K. (2011). Proofs of Correctness for Three Decentralized Authentication Protocols Using Strand Spaces. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4019&context=etd

Chicago Manual of Style (16th Edition):

Vankamamidi, Pavan Kumar. “Proofs of Correctness for Three Decentralized Authentication Protocols Using Strand Spaces.” 2011. Masters Thesis, Brigham Young University. Accessed September 22, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4019&context=etd.

MLA Handbook (7th Edition):

Vankamamidi, Pavan Kumar. “Proofs of Correctness for Three Decentralized Authentication Protocols Using Strand Spaces.” 2011. Web. 22 Sep 2020.

Vancouver:

Vankamamidi PK. Proofs of Correctness for Three Decentralized Authentication Protocols Using Strand Spaces. [Internet] [Masters thesis]. Brigham Young University; 2011. [cited 2020 Sep 22]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4019&context=etd.

Council of Science Editors:

Vankamamidi PK. Proofs of Correctness for Three Decentralized Authentication Protocols Using Strand Spaces. [Masters Thesis]. Brigham Young University; 2011. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=4019&context=etd


Princeton University

8. Cuellar, Santiago. Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency.

Degree: PhD, 2020, Princeton University

 Optimizing compilers change a program based on a formal analysis of its code, and modern processors further rearrange the program order. It is hard to… (more)

Subjects/Keywords: Compilers; Concurrency; Formal methods; Machine-checked proofs; Programming Languages; Software safety

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cuellar, S. (2020). Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp01qr46r378d

Chicago Manual of Style (16th Edition):

Cuellar, Santiago. “Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. ” 2020. Doctoral Dissertation, Princeton University. Accessed September 22, 2020. http://arks.princeton.edu/ark:/88435/dsp01qr46r378d.

MLA Handbook (7th Edition):

Cuellar, Santiago. “Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. ” 2020. Web. 22 Sep 2020.

Vancouver:

Cuellar S. Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. [Internet] [Doctoral dissertation]. Princeton University; 2020. [cited 2020 Sep 22]. Available from: http://arks.princeton.edu/ark:/88435/dsp01qr46r378d.

Council of Science Editors:

Cuellar S. Concurrent Permission Machine for modular proofs of optimizing compilers with shared memory concurrency. [Doctoral Dissertation]. Princeton University; 2020. Available from: http://arks.princeton.edu/ark:/88435/dsp01qr46r378d


Universidade Nova

9. Toninho, Bernardo Parente Coutinho Fernandes. A logical foundation for session-based concurrent computation.

Degree: 2015, Universidade Nova

 Linear logic has long been heralded for its potential of providing a logical basis for concurrency. While over the years many research attempts were made… (more)

Subjects/Keywords: Linear logic; Session types; Curry-Howard; Concurrency; Proofs-as-programs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Toninho, B. P. C. F. (2015). A logical foundation for session-based concurrent computation. (Thesis). Universidade Nova. Retrieved from http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/15296

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Toninho, Bernardo Parente Coutinho Fernandes. “A logical foundation for session-based concurrent computation.” 2015. Thesis, Universidade Nova. Accessed September 22, 2020. http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/15296.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Toninho, Bernardo Parente Coutinho Fernandes. “A logical foundation for session-based concurrent computation.” 2015. Web. 22 Sep 2020.

Vancouver:

Toninho BPCF. A logical foundation for session-based concurrent computation. [Internet] [Thesis]. Universidade Nova; 2015. [cited 2020 Sep 22]. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/15296.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Toninho BPCF. A logical foundation for session-based concurrent computation. [Thesis]. Universidade Nova; 2015. Available from: http://www.rcaap.pt/detail.jsp?id=oai:run.unl.pt:10362/15296

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Durham University

10. Yu, Shen-Wei. Formal verification of concurrent programs in type theory.

Degree: PhD, 1999, Durham University

 Interactive theorem proving provides a general approach to modeling and verification of both finite-state and infinite-state systems but requires significant human efforts to deal with… (more)

Subjects/Keywords: 005; Proofs; Verification; Theorem provers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Yu, S. (1999). Formal verification of concurrent programs in type theory. (Doctoral Dissertation). Durham University. Retrieved from http://etheses.dur.ac.uk/4366/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.341413

Chicago Manual of Style (16th Edition):

Yu, Shen-Wei. “Formal verification of concurrent programs in type theory.” 1999. Doctoral Dissertation, Durham University. Accessed September 22, 2020. http://etheses.dur.ac.uk/4366/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.341413.

MLA Handbook (7th Edition):

Yu, Shen-Wei. “Formal verification of concurrent programs in type theory.” 1999. Web. 22 Sep 2020.

Vancouver:

Yu S. Formal verification of concurrent programs in type theory. [Internet] [Doctoral dissertation]. Durham University; 1999. [cited 2020 Sep 22]. Available from: http://etheses.dur.ac.uk/4366/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.341413.

Council of Science Editors:

Yu S. Formal verification of concurrent programs in type theory. [Doctoral Dissertation]. Durham University; 1999. Available from: http://etheses.dur.ac.uk/4366/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.341413

11. O'Rourke, Ciaran. The prime number theorem: Analytic and elementary proofs.

Degree: 2013, RIAN

 Three proofs of the prime number theorem are presented. The rst is a heavily analytic proof based on early accounts. Cauchy's residue theorem and various… (more)

Subjects/Keywords: Mathematics & Statistics; prime number theorem; analytic and elementary proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

O'Rourke, C. (2013). The prime number theorem: Analytic and elementary proofs. (Thesis). RIAN. Retrieved from http://eprints.maynoothuniversity.ie/4470/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

O'Rourke, Ciaran. “The prime number theorem: Analytic and elementary proofs.” 2013. Thesis, RIAN. Accessed September 22, 2020. http://eprints.maynoothuniversity.ie/4470/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

O'Rourke, Ciaran. “The prime number theorem: Analytic and elementary proofs.” 2013. Web. 22 Sep 2020.

Vancouver:

O'Rourke C. The prime number theorem: Analytic and elementary proofs. [Internet] [Thesis]. RIAN; 2013. [cited 2020 Sep 22]. Available from: http://eprints.maynoothuniversity.ie/4470/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

O'Rourke C. The prime number theorem: Analytic and elementary proofs. [Thesis]. RIAN; 2013. Available from: http://eprints.maynoothuniversity.ie/4470/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Ottawa

12. Wang, Chih yoa. Secondary School Teachers’ Conceptions of Mathematical Proofs and Their Role in the Learning of Mathematics .

Degree: 2020, University of Ottawa

 Mathematical proofs are a part of mathematics that involves thinking and reasoning, rather than computation. The conceptions of Ontario high school mathematics teachers, of what… (more)

Subjects/Keywords: Teaching; Mathematics; Proofs; Beliefs; Ontario Curriculum; Secondary School; Teacher

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wang, C. y. (2020). Secondary School Teachers’ Conceptions of Mathematical Proofs and Their Role in the Learning of Mathematics . (Thesis). University of Ottawa. Retrieved from http://hdl.handle.net/10393/40462

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Wang, Chih yoa. “Secondary School Teachers’ Conceptions of Mathematical Proofs and Their Role in the Learning of Mathematics .” 2020. Thesis, University of Ottawa. Accessed September 22, 2020. http://hdl.handle.net/10393/40462.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Wang, Chih yoa. “Secondary School Teachers’ Conceptions of Mathematical Proofs and Their Role in the Learning of Mathematics .” 2020. Web. 22 Sep 2020.

Vancouver:

Wang Cy. Secondary School Teachers’ Conceptions of Mathematical Proofs and Their Role in the Learning of Mathematics . [Internet] [Thesis]. University of Ottawa; 2020. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/10393/40462.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Wang Cy. Secondary School Teachers’ Conceptions of Mathematical Proofs and Their Role in the Learning of Mathematics . [Thesis]. University of Ottawa; 2020. Available from: http://hdl.handle.net/10393/40462

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Illinois – Urbana-Champaign

13. Kim, Sun. Bijective proofs of partition identities and covering systems.

Degree: PhD, 0439, 2010, University of Illinois – Urbana-Champaign

 This dissertation involves two topics. The first is on the theory of partitions, which is discussed in Chapters 2 ??? 5. The second is on… (more)

Subjects/Keywords: partitions; bijective proofs; covering systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Kim, S. (2010). Bijective proofs of partition identities and covering systems. (Doctoral Dissertation). University of Illinois – Urbana-Champaign. Retrieved from http://hdl.handle.net/2142/15597

Chicago Manual of Style (16th Edition):

Kim, Sun. “Bijective proofs of partition identities and covering systems.” 2010. Doctoral Dissertation, University of Illinois – Urbana-Champaign. Accessed September 22, 2020. http://hdl.handle.net/2142/15597.

MLA Handbook (7th Edition):

Kim, Sun. “Bijective proofs of partition identities and covering systems.” 2010. Web. 22 Sep 2020.

Vancouver:

Kim S. Bijective proofs of partition identities and covering systems. [Internet] [Doctoral dissertation]. University of Illinois – Urbana-Champaign; 2010. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/2142/15597.

Council of Science Editors:

Kim S. Bijective proofs of partition identities and covering systems. [Doctoral Dissertation]. University of Illinois – Urbana-Champaign; 2010. Available from: http://hdl.handle.net/2142/15597


University of Toronto

14. Wehr, R Dustin. Rigorous Deductive Argumentation for Socially Relevant Issues.

Degree: PhD, 2015, University of Toronto

 The most important problems for society are describable only in vague terms, dependent on subjective positions, and missing highly relevant data. This thesis is intended… (more)

Subjects/Keywords: argumentation; dialogue systems; formal logic; interpreted formal proofs; policy; 0984

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Wehr, R. D. (2015). Rigorous Deductive Argumentation for Socially Relevant Issues. (Doctoral Dissertation). University of Toronto. Retrieved from http://hdl.handle.net/1807/69513

Chicago Manual of Style (16th Edition):

Wehr, R Dustin. “Rigorous Deductive Argumentation for Socially Relevant Issues.” 2015. Doctoral Dissertation, University of Toronto. Accessed September 22, 2020. http://hdl.handle.net/1807/69513.

MLA Handbook (7th Edition):

Wehr, R Dustin. “Rigorous Deductive Argumentation for Socially Relevant Issues.” 2015. Web. 22 Sep 2020.

Vancouver:

Wehr RD. Rigorous Deductive Argumentation for Socially Relevant Issues. [Internet] [Doctoral dissertation]. University of Toronto; 2015. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/1807/69513.

Council of Science Editors:

Wehr RD. Rigorous Deductive Argumentation for Socially Relevant Issues. [Doctoral Dissertation]. University of Toronto; 2015. Available from: http://hdl.handle.net/1807/69513

15. O'Rourke, Ciaran. The prime number theorem: Analytic and elementary proofs.

Degree: 2013, RIAN

 Three proofs of the prime number theorem are presented. The rst is a heavily analytic proof based on early accounts. Cauchy's residue theorem and various… (more)

Subjects/Keywords: Mathematics & Statistics; prime number theorem; analytic and elementary proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

O'Rourke, C. (2013). The prime number theorem: Analytic and elementary proofs. (Thesis). RIAN. Retrieved from http://mural.maynoothuniversity.ie/4470/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

O'Rourke, Ciaran. “The prime number theorem: Analytic and elementary proofs.” 2013. Thesis, RIAN. Accessed September 22, 2020. http://mural.maynoothuniversity.ie/4470/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

O'Rourke, Ciaran. “The prime number theorem: Analytic and elementary proofs.” 2013. Web. 22 Sep 2020.

Vancouver:

O'Rourke C. The prime number theorem: Analytic and elementary proofs. [Internet] [Thesis]. RIAN; 2013. [cited 2020 Sep 22]. Available from: http://mural.maynoothuniversity.ie/4470/.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

O'Rourke C. The prime number theorem: Analytic and elementary proofs. [Thesis]. RIAN; 2013. Available from: http://mural.maynoothuniversity.ie/4470/

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Edinburgh

16. Jamnik, Mateja. Automating diagrammatic proofs of arithmetic arguments.

Degree: PhD, 1999, University of Edinburgh

 This thesis is on the automation of diagrammatic proofs, a novel approach to mechanised mathematical reasoning. Theorems in automated theorem proving are usually proved by… (more)

Subjects/Keywords: 510; diagrammatic proofs; mathematical reasoning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jamnik, M. (1999). Automating diagrammatic proofs of arithmetic arguments. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/529

Chicago Manual of Style (16th Edition):

Jamnik, Mateja. “Automating diagrammatic proofs of arithmetic arguments.” 1999. Doctoral Dissertation, University of Edinburgh. Accessed September 22, 2020. http://hdl.handle.net/1842/529.

MLA Handbook (7th Edition):

Jamnik, Mateja. “Automating diagrammatic proofs of arithmetic arguments.” 1999. Web. 22 Sep 2020.

Vancouver:

Jamnik M. Automating diagrammatic proofs of arithmetic arguments. [Internet] [Doctoral dissertation]. University of Edinburgh; 1999. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/1842/529.

Council of Science Editors:

Jamnik M. Automating diagrammatic proofs of arithmetic arguments. [Doctoral Dissertation]. University of Edinburgh; 1999. Available from: http://hdl.handle.net/1842/529


University of Waterloo

17. Hornby, Taylor. Concentration Bounds from Parallel Repetition Theorems.

Degree: 2018, University of Waterloo

 This thesis contributes to the study of parallel repetition theorems and concentration bounds for nonlocal games and quantum interactive proofs. We make the following contributions:… (more)

Subjects/Keywords: quantum information; parallel repetition; nonlocal games; interactive proofs; concentration bounds

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Hornby, T. (2018). Concentration Bounds from Parallel Repetition Theorems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13638

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Hornby, Taylor. “Concentration Bounds from Parallel Repetition Theorems.” 2018. Thesis, University of Waterloo. Accessed September 22, 2020. http://hdl.handle.net/10012/13638.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Hornby, Taylor. “Concentration Bounds from Parallel Repetition Theorems.” 2018. Web. 22 Sep 2020.

Vancouver:

Hornby T. Concentration Bounds from Parallel Repetition Theorems. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/10012/13638.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Hornby T. Concentration Bounds from Parallel Repetition Theorems. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13638

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Louisiana State University

18. Cherneva, Vanya D. Distributed Wireless Algorithms for RFID Systems: Grouping Proofs and Cardinality Estimation.

Degree: PhD, Other Computer Engineering, Louisiana State University

  The breadth and depth of the use of Radio Frequency Identification (RFID) are becoming more substantial. RFID is a technology useful for identifying unique… (more)

Subjects/Keywords: RFID; protocols; grouping proofs; cardinality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Cherneva, V. D. (n.d.). Distributed Wireless Algorithms for RFID Systems: Grouping Proofs and Cardinality Estimation. (Doctoral Dissertation). Louisiana State University. Retrieved from https://digitalcommons.lsu.edu/gradschool_dissertations/4873

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Chicago Manual of Style (16th Edition):

Cherneva, Vanya D. “Distributed Wireless Algorithms for RFID Systems: Grouping Proofs and Cardinality Estimation.” Doctoral Dissertation, Louisiana State University. Accessed September 22, 2020. https://digitalcommons.lsu.edu/gradschool_dissertations/4873.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

MLA Handbook (7th Edition):

Cherneva, Vanya D. “Distributed Wireless Algorithms for RFID Systems: Grouping Proofs and Cardinality Estimation.” Web. 22 Sep 2020.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Vancouver:

Cherneva VD. Distributed Wireless Algorithms for RFID Systems: Grouping Proofs and Cardinality Estimation. [Internet] [Doctoral dissertation]. Louisiana State University; [cited 2020 Sep 22]. Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4873.

Note: this citation may be lacking information needed for this citation format:
No year of publication.

Council of Science Editors:

Cherneva VD. Distributed Wireless Algorithms for RFID Systems: Grouping Proofs and Cardinality Estimation. [Doctoral Dissertation]. Louisiana State University; Available from: https://digitalcommons.lsu.edu/gradschool_dissertations/4873

Note: this citation may be lacking information needed for this citation format:
No year of publication.


University of Missouri – Columbia

19. Sears, Ruthmae. An examination of how teachers use curriculum materials for the teaching of proof in high school geometry.

Degree: 2012, University of Missouri – Columbia

 This case study examined how three high school geometry teachers used their geometry textbooks (Prentice Hall Geometry and McDougal Littell Geometry) to teach proof. More… (more)

Subjects/Keywords: secondary education; cognitive demands; curriculum materials; geometry proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Sears, R. (2012). An examination of how teachers use curriculum materials for the teaching of proof in high school geometry. (Thesis). University of Missouri – Columbia. Retrieved from https://doi.org/10.32469/10355/15120

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Sears, Ruthmae. “An examination of how teachers use curriculum materials for the teaching of proof in high school geometry.” 2012. Thesis, University of Missouri – Columbia. Accessed September 22, 2020. https://doi.org/10.32469/10355/15120.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Sears, Ruthmae. “An examination of how teachers use curriculum materials for the teaching of proof in high school geometry.” 2012. Web. 22 Sep 2020.

Vancouver:

Sears R. An examination of how teachers use curriculum materials for the teaching of proof in high school geometry. [Internet] [Thesis]. University of Missouri – Columbia; 2012. [cited 2020 Sep 22]. Available from: https://doi.org/10.32469/10355/15120.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Sears R. An examination of how teachers use curriculum materials for the teaching of proof in high school geometry. [Thesis]. University of Missouri – Columbia; 2012. Available from: https://doi.org/10.32469/10355/15120

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

20. Mariano, Marcia Regina Curado Pereira. As figuras de argumentação como estratégias discursivas. Um estudo de avaliações no ensino superior.

Degree: PhD, Filologia e Língua Portuguesa, 2007, University of São Paulo

Este trabalho pretende levantar questões relativas ao uso e aos efeitos provocados pela utilização de estratégias argumentativas no discurso. Para exemplificar a importância de tais… (more)

Subjects/Keywords: Análise do discurso; Argument; Argumentação; Avaliação; Discourse analysis; Figuras; Figures; Proofs; Retórica; Rhetoric

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mariano, M. R. C. P. (2007). As figuras de argumentação como estratégias discursivas. Um estudo de avaliações no ensino superior. (Doctoral Dissertation). University of São Paulo. Retrieved from http://www.teses.usp.br/teses/disponiveis/8/8142/tde-20122007-135250/ ;

Chicago Manual of Style (16th Edition):

Mariano, Marcia Regina Curado Pereira. “As figuras de argumentação como estratégias discursivas. Um estudo de avaliações no ensino superior.” 2007. Doctoral Dissertation, University of São Paulo. Accessed September 22, 2020. http://www.teses.usp.br/teses/disponiveis/8/8142/tde-20122007-135250/ ;.

MLA Handbook (7th Edition):

Mariano, Marcia Regina Curado Pereira. “As figuras de argumentação como estratégias discursivas. Um estudo de avaliações no ensino superior.” 2007. Web. 22 Sep 2020.

Vancouver:

Mariano MRCP. As figuras de argumentação como estratégias discursivas. Um estudo de avaliações no ensino superior. [Internet] [Doctoral dissertation]. University of São Paulo; 2007. [cited 2020 Sep 22]. Available from: http://www.teses.usp.br/teses/disponiveis/8/8142/tde-20122007-135250/ ;.

Council of Science Editors:

Mariano MRCP. As figuras de argumentação como estratégias discursivas. Um estudo de avaliações no ensino superior. [Doctoral Dissertation]. University of São Paulo; 2007. Available from: http://www.teses.usp.br/teses/disponiveis/8/8142/tde-20122007-135250/ ;


University of Alberta

21. Rodger, Charles P. The Proofs of God in Hegel's System.

Degree: PhD, Department of Philosophy, 2014, University of Alberta

 In 1831, on the same day that Hegel at last committed himself to providing a revised edition of the Phenomenology of Spirit, he signed a… (more)

Subjects/Keywords: Teleological Proof; Hegel; Cosmological Proof; Ontological Proof; Proofs of God; German Idealism

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Rodger, C. P. (2014). The Proofs of God in Hegel's System. (Doctoral Dissertation). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/5d86p313s

Chicago Manual of Style (16th Edition):

Rodger, Charles P. “The Proofs of God in Hegel's System.” 2014. Doctoral Dissertation, University of Alberta. Accessed September 22, 2020. https://era.library.ualberta.ca/files/5d86p313s.

MLA Handbook (7th Edition):

Rodger, Charles P. “The Proofs of God in Hegel's System.” 2014. Web. 22 Sep 2020.

Vancouver:

Rodger CP. The Proofs of God in Hegel's System. [Internet] [Doctoral dissertation]. University of Alberta; 2014. [cited 2020 Sep 22]. Available from: https://era.library.ualberta.ca/files/5d86p313s.

Council of Science Editors:

Rodger CP. The Proofs of God in Hegel's System. [Doctoral Dissertation]. University of Alberta; 2014. Available from: https://era.library.ualberta.ca/files/5d86p313s


Universidade do Rio Grande do Sul

22. Silva, Patrícia Fernanda da. O uso das tecnologias digitais com crianças de 7 meses a 7 anos : como as crianças estão se apropriando das tecnologias digitais na primeira infância?.

Degree: 2017, Universidade do Rio Grande do Sul

O avanço das tecnologias vem sendo impulsionado por ferramentas como internet móvel, touchscreen, wirelles, dentre outras, possibilitando que o manuseio com auxílio destes dispositivos seja… (more)

Subjects/Keywords: Cognitive Development; Tecnologia digital; Early Childhood; Educação infantil; Digital Technologies; Piagetian proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Silva, P. F. d. (2017). O uso das tecnologias digitais com crianças de 7 meses a 7 anos : como as crianças estão se apropriando das tecnologias digitais na primeira infância?. (Thesis). Universidade do Rio Grande do Sul. Retrieved from http://hdl.handle.net/10183/168851

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Silva, Patrícia Fernanda da. “O uso das tecnologias digitais com crianças de 7 meses a 7 anos : como as crianças estão se apropriando das tecnologias digitais na primeira infância?.” 2017. Thesis, Universidade do Rio Grande do Sul. Accessed September 22, 2020. http://hdl.handle.net/10183/168851.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Silva, Patrícia Fernanda da. “O uso das tecnologias digitais com crianças de 7 meses a 7 anos : como as crianças estão se apropriando das tecnologias digitais na primeira infância?.” 2017. Web. 22 Sep 2020.

Vancouver:

Silva PFd. O uso das tecnologias digitais com crianças de 7 meses a 7 anos : como as crianças estão se apropriando das tecnologias digitais na primeira infância?. [Internet] [Thesis]. Universidade do Rio Grande do Sul; 2017. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/10183/168851.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Silva PFd. O uso das tecnologias digitais com crianças de 7 meses a 7 anos : como as crianças estão se apropriando das tecnologias digitais na primeira infância?. [Thesis]. Universidade do Rio Grande do Sul; 2017. Available from: http://hdl.handle.net/10183/168851

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


Pontifícia Universidade Católica de São Paulo

23. Ednaldo José Leandro. Saberes mobilizados por professores quando o foco são as provas matemáticas: um estudo de caso.

Degree: 2012, Pontifícia Universidade Católica de São Paulo

Por meio de um levantamento realizado junto a cinco professores da rede municipal de ensino de São Paulo, realizou-se um estudo sobre saberes mobilizados por… (more)

Subjects/Keywords: MATEMATICA; Estudo de caso; Saberes docentes; Provas matemáticas; Case study; Teaching knowledge; Mathematical proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Leandro, E. J. (2012). Saberes mobilizados por professores quando o foco são as provas matemáticas: um estudo de caso. (Thesis). Pontifícia Universidade Católica de São Paulo. Retrieved from http://www.sapientia.pucsp.br//tde_busca/arquivo.php?codArquivo=15507

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Leandro, Ednaldo José. “Saberes mobilizados por professores quando o foco são as provas matemáticas: um estudo de caso.” 2012. Thesis, Pontifícia Universidade Católica de São Paulo. Accessed September 22, 2020. http://www.sapientia.pucsp.br//tde_busca/arquivo.php?codArquivo=15507.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Leandro, Ednaldo José. “Saberes mobilizados por professores quando o foco são as provas matemáticas: um estudo de caso.” 2012. Web. 22 Sep 2020.

Vancouver:

Leandro EJ. Saberes mobilizados por professores quando o foco são as provas matemáticas: um estudo de caso. [Internet] [Thesis]. Pontifícia Universidade Católica de São Paulo; 2012. [cited 2020 Sep 22]. Available from: http://www.sapientia.pucsp.br//tde_busca/arquivo.php?codArquivo=15507.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Leandro EJ. Saberes mobilizados por professores quando o foco são as provas matemáticas: um estudo de caso. [Thesis]. Pontifícia Universidade Católica de São Paulo; 2012. Available from: http://www.sapientia.pucsp.br//tde_busca/arquivo.php?codArquivo=15507

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

24. Henry, Ryan. Efficient Zero-Knowledge Proofs and Applications.

Degree: 2014, University of Waterloo

 Zero-knowledge proofs provide a means for a prover to convince a verifier that some claim is true and nothing more. The ability to prove statements… (more)

Subjects/Keywords: Batch zero-knowledge proofs; efficiency; privacy enhancing technologies; applied cryptography; lattice attacks; cryptanalysis; anonymous blacklisting

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Henry, R. (2014). Efficient Zero-Knowledge Proofs and Applications. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8621

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Henry, Ryan. “Efficient Zero-Knowledge Proofs and Applications.” 2014. Thesis, University of Waterloo. Accessed September 22, 2020. http://hdl.handle.net/10012/8621.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Henry, Ryan. “Efficient Zero-Knowledge Proofs and Applications.” 2014. Web. 22 Sep 2020.

Vancouver:

Henry R. Efficient Zero-Knowledge Proofs and Applications. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/10012/8621.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Henry R. Efficient Zero-Knowledge Proofs and Applications. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8621

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Koutsos, Adrien. Preuves symboliques de propriétés d’indistinguabilité calculatoire : Symbolic Proofs of Computational Indistinguishability.

Degree: Docteur es, Informatique, 2019, Université Paris-Saclay (ComUE)

Notre société utilise de nombreux systèmes de communications. Parce que ces systèmes sont omniprésents et sont utilisés pour échanger des informations sensibles, ils doivent être… (more)

Subjects/Keywords: Protocole de sécurité; Sécurité calculatoire; Preuves automatiques; Indistinguabilité; Security protocols; Computational security; Automatic proofs; Indistinguishability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Koutsos, A. (2019). Preuves symboliques de propriétés d’indistinguabilité calculatoire : Symbolic Proofs of Computational Indistinguishability. (Doctoral Dissertation). Université Paris-Saclay (ComUE). Retrieved from http://www.theses.fr/2019SACLN029

Chicago Manual of Style (16th Edition):

Koutsos, Adrien. “Preuves symboliques de propriétés d’indistinguabilité calculatoire : Symbolic Proofs of Computational Indistinguishability.” 2019. Doctoral Dissertation, Université Paris-Saclay (ComUE). Accessed September 22, 2020. http://www.theses.fr/2019SACLN029.

MLA Handbook (7th Edition):

Koutsos, Adrien. “Preuves symboliques de propriétés d’indistinguabilité calculatoire : Symbolic Proofs of Computational Indistinguishability.” 2019. Web. 22 Sep 2020.

Vancouver:

Koutsos A. Preuves symboliques de propriétés d’indistinguabilité calculatoire : Symbolic Proofs of Computational Indistinguishability. [Internet] [Doctoral dissertation]. Université Paris-Saclay (ComUE); 2019. [cited 2020 Sep 22]. Available from: http://www.theses.fr/2019SACLN029.

Council of Science Editors:

Koutsos A. Preuves symboliques de propriétés d’indistinguabilité calculatoire : Symbolic Proofs of Computational Indistinguishability. [Doctoral Dissertation]. Université Paris-Saclay (ComUE); 2019. Available from: http://www.theses.fr/2019SACLN029


Brigham Young University

26. Swift, Jeffrey C. Twitter Rhetoric: From Kinetic to Potential.

Degree: MA, 2010, Brigham Young University

  Everyone can agree that microblogging service Twitter makes a terrible first impression. Many will agree that this impression is an accurate assessment of many… (more)

Subjects/Keywords: digital rhetoric; Aristotelian proofs; Twitter; persuasion; new media; English Language and Literature

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Swift, J. C. (2010). Twitter Rhetoric: From Kinetic to Potential. (Masters Thesis). Brigham Young University. Retrieved from https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3532&context=etd

Chicago Manual of Style (16th Edition):

Swift, Jeffrey C. “Twitter Rhetoric: From Kinetic to Potential.” 2010. Masters Thesis, Brigham Young University. Accessed September 22, 2020. https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3532&context=etd.

MLA Handbook (7th Edition):

Swift, Jeffrey C. “Twitter Rhetoric: From Kinetic to Potential.” 2010. Web. 22 Sep 2020.

Vancouver:

Swift JC. Twitter Rhetoric: From Kinetic to Potential. [Internet] [Masters thesis]. Brigham Young University; 2010. [cited 2020 Sep 22]. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3532&context=etd.

Council of Science Editors:

Swift JC. Twitter Rhetoric: From Kinetic to Potential. [Masters Thesis]. Brigham Young University; 2010. Available from: https://scholarsarchive.byu.edu/cgi/viewcontent.cgi?article=3532&context=etd

27. Philippe, Sébastien. A Physical Zero-Knowledge Proof and Unclonable Sensors for Nuclear Warhead Verification .

Degree: PhD, 2018, Princeton University

 Future nuclear arms-control agreements may call for reductions of the total number of nuclear weapons and warheads in the world arsenals. Such agreements would require… (more)

Subjects/Keywords: Neutron detectors; Neutron radiography; Nuclear weapons; Physical unclonable functions; Verification; Zero-knowledge proofs

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Philippe, S. (2018). A Physical Zero-Knowledge Proof and Unclonable Sensors for Nuclear Warhead Verification . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp011c18dj47c

Chicago Manual of Style (16th Edition):

Philippe, Sébastien. “A Physical Zero-Knowledge Proof and Unclonable Sensors for Nuclear Warhead Verification .” 2018. Doctoral Dissertation, Princeton University. Accessed September 22, 2020. http://arks.princeton.edu/ark:/88435/dsp011c18dj47c.

MLA Handbook (7th Edition):

Philippe, Sébastien. “A Physical Zero-Knowledge Proof and Unclonable Sensors for Nuclear Warhead Verification .” 2018. Web. 22 Sep 2020.

Vancouver:

Philippe S. A Physical Zero-Knowledge Proof and Unclonable Sensors for Nuclear Warhead Verification . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2020 Sep 22]. Available from: http://arks.princeton.edu/ark:/88435/dsp011c18dj47c.

Council of Science Editors:

Philippe S. A Physical Zero-Knowledge Proof and Unclonable Sensors for Nuclear Warhead Verification . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp011c18dj47c

28. Pellissier, Luc. Réductions et approximations linéaires : Reductions and linear approximations.

Degree: Docteur es, Informatique, 2017, Sorbonne Paris Cité

De nombreux outils syntaxiques et sémantiques ont été développés pour l'étude de la dynamique des preuves et des programmes au cours des cinquante dernières années.… (more)

Subjects/Keywords: Types intersections; Réseaux de preuve; Sémantique catégorique; Intersection types; Proofs and programs dynamics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Pellissier, L. (2017). Réductions et approximations linéaires : Reductions and linear approximations. (Doctoral Dissertation). Sorbonne Paris Cité. Retrieved from http://www.theses.fr/2017USPCD088

Chicago Manual of Style (16th Edition):

Pellissier, Luc. “Réductions et approximations linéaires : Reductions and linear approximations.” 2017. Doctoral Dissertation, Sorbonne Paris Cité. Accessed September 22, 2020. http://www.theses.fr/2017USPCD088.

MLA Handbook (7th Edition):

Pellissier, Luc. “Réductions et approximations linéaires : Reductions and linear approximations.” 2017. Web. 22 Sep 2020.

Vancouver:

Pellissier L. Réductions et approximations linéaires : Reductions and linear approximations. [Internet] [Doctoral dissertation]. Sorbonne Paris Cité; 2017. [cited 2020 Sep 22]. Available from: http://www.theses.fr/2017USPCD088.

Council of Science Editors:

Pellissier L. Réductions et approximations linéaires : Reductions and linear approximations. [Doctoral Dissertation]. Sorbonne Paris Cité; 2017. Available from: http://www.theses.fr/2017USPCD088

29. Beimesch, James. An exploration of mathematical proofs.

Degree: 2016, Texas Woman's University

 The purpose of this thesis is to teach methods of proving statements in mathematics. We will be dissecting proven statements and examining the individual steps… (more)

Subjects/Keywords: Geometry; Matrix algebra; Number theory; Proofs; Proof-writing; Symbolic logic; Pure sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Beimesch, J. (2016). An exploration of mathematical proofs. (Thesis). Texas Woman's University. Retrieved from http://hdl.handle.net/11274/8745

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Beimesch, James. “An exploration of mathematical proofs.” 2016. Thesis, Texas Woman's University. Accessed September 22, 2020. http://hdl.handle.net/11274/8745.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Beimesch, James. “An exploration of mathematical proofs.” 2016. Web. 22 Sep 2020.

Vancouver:

Beimesch J. An exploration of mathematical proofs. [Internet] [Thesis]. Texas Woman's University; 2016. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/11274/8745.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Beimesch J. An exploration of mathematical proofs. [Thesis]. Texas Woman's University; 2016. Available from: http://hdl.handle.net/11274/8745

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Minnesota

30. Ghassabani, Elaheh. Inductive Validity Cores.

Degree: PhD, Computer Science, 2018, University of Minnesota

 Symbolic model checkers can construct proofs of properties over very complex models. However, the results reported by the tool when a proof succeeds do not… (more)

Subjects/Keywords: Inductive proofs; Proof-cores; SMAT solving; Symbolic model checking; Traceability; Unsat-cores

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ghassabani, E. (2018). Inductive Validity Cores. (Doctoral Dissertation). University of Minnesota. Retrieved from http://hdl.handle.net/11299/201700

Chicago Manual of Style (16th Edition):

Ghassabani, Elaheh. “Inductive Validity Cores.” 2018. Doctoral Dissertation, University of Minnesota. Accessed September 22, 2020. http://hdl.handle.net/11299/201700.

MLA Handbook (7th Edition):

Ghassabani, Elaheh. “Inductive Validity Cores.” 2018. Web. 22 Sep 2020.

Vancouver:

Ghassabani E. Inductive Validity Cores. [Internet] [Doctoral dissertation]. University of Minnesota; 2018. [cited 2020 Sep 22]. Available from: http://hdl.handle.net/11299/201700.

Council of Science Editors:

Ghassabani E. Inductive Validity Cores. [Doctoral Dissertation]. University of Minnesota; 2018. Available from: http://hdl.handle.net/11299/201700

[1] [2] [3] [4] [5]

.