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 +publisher:"University of Notre Dame" +contributor:("Peter Cholak, Committee Member"). Showing records 1 – 13 of 13 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Notre Dame

1. Sarah Cotter. Characterizing forking in VC-minimal theories</h1>.

Degree: Mathematics, 2012, University of Notre Dame

  We consider the class of VC-minimal theories, as introduced by Adler in [2]. After covering some basic results, including a notion of generic types,… (more)

Subjects/Keywords: model theory; Mathematical logic; VC-minimality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cotter, S. (2012). Characterizing forking in VC-minimal theories</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/7h149p3100m

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):

Cotter, Sarah. “Characterizing forking in VC-minimal theories</h1>.” 2012. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/7h149p3100m.

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

MLA Handbook (7th Edition):

Cotter, Sarah. “Characterizing forking in VC-minimal theories</h1>.” 2012. Web. 10 Jul 2020.

Vancouver:

Cotter S. Characterizing forking in VC-minimal theories</h1>. [Internet] [Thesis]. University of Notre Dame; 2012. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/7h149p3100m.

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

Council of Science Editors:

Cotter S. Characterizing forking in VC-minimal theories</h1>. [Thesis]. University of Notre Dame; 2012. Available from: https://curate.nd.edu/show/7h149p3100m

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


University of Notre Dame

2. Somayeh Vojdani. On Presburger Arithmetic, Nonstandard Finite Cyclic Groups, and Definable Compactifications</h1>.

Degree: Mathematics, 2016, University of Notre Dame

  It is known that any model of the theory of the group of integers can be decomposed into a direct sum of a torsion-free… (more)

Subjects/Keywords: Model theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Vojdani, S. (2016). On Presburger Arithmetic, Nonstandard Finite Cyclic Groups, and Definable Compactifications</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/k3569309463

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):

Vojdani, Somayeh. “On Presburger Arithmetic, Nonstandard Finite Cyclic Groups, and Definable Compactifications</h1>.” 2016. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/k3569309463.

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

MLA Handbook (7th Edition):

Vojdani, Somayeh. “On Presburger Arithmetic, Nonstandard Finite Cyclic Groups, and Definable Compactifications</h1>.” 2016. Web. 10 Jul 2020.

Vancouver:

Vojdani S. On Presburger Arithmetic, Nonstandard Finite Cyclic Groups, and Definable Compactifications</h1>. [Internet] [Thesis]. University of Notre Dame; 2016. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/k3569309463.

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

Council of Science Editors:

Vojdani S. On Presburger Arithmetic, Nonstandard Finite Cyclic Groups, and Definable Compactifications</h1>. [Thesis]. University of Notre Dame; 2016. Available from: https://curate.nd.edu/show/k3569309463

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


University of Notre Dame

3. Matteo Bianchetti. Infinite Time Computation: Strong and Weak Infinite Time Turing Machines</h1>.

Degree: Mathematics, 2017, University of Notre Dame

  Hamkins and Lewis have used infinite time Turing machines to extend the operations of Turing machines to infinite ordinal time. This project investigates some… (more)

Subjects/Keywords: Infinite time computability; Infinite time Turing machines; Transfinite computation; Supertask; Hamkins; Arithmetic hierarchy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bianchetti, M. (2017). Infinite Time Computation: Strong and Weak Infinite Time Turing Machines</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/sq87br88z66

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):

Bianchetti, Matteo. “Infinite Time Computation: Strong and Weak Infinite Time Turing Machines</h1>.” 2017. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/sq87br88z66.

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

MLA Handbook (7th Edition):

Bianchetti, Matteo. “Infinite Time Computation: Strong and Weak Infinite Time Turing Machines</h1>.” 2017. Web. 10 Jul 2020.

Vancouver:

Bianchetti M. Infinite Time Computation: Strong and Weak Infinite Time Turing Machines</h1>. [Internet] [Thesis]. University of Notre Dame; 2017. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/sq87br88z66.

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

Council of Science Editors:

Bianchetti M. Infinite Time Computation: Strong and Weak Infinite Time Turing Machines</h1>. [Thesis]. University of Notre Dame; 2017. Available from: https://curate.nd.edu/show/sq87br88z66

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


University of Notre Dame

4. Jacob Morley Carson. Computational Complexity of Automatic Structures</h1>.

Degree: Mathematics, 2011, University of Notre Dame

  This dissertation creates automatic structures with complex recursion-theoretic properties. A structure is said to be automatic if its universe and relations can be recognized… (more)

Subjects/Keywords: equivalence structure; linear ordering; automaton; categorical; nesting; computing; nested equivalence structure; math; recursion; ordering; back and forth relations; automata; isomorphism; arithmetical hierarchy; structure; ordinal; equivalence; logic; finite automata; categoricity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Carson, J. M. (2011). Computational Complexity of Automatic Structures</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/v405s754q02

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):

Carson, Jacob Morley. “Computational Complexity of Automatic Structures</h1>.” 2011. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/v405s754q02.

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

MLA Handbook (7th Edition):

Carson, Jacob Morley. “Computational Complexity of Automatic Structures</h1>.” 2011. Web. 10 Jul 2020.

Vancouver:

Carson JM. Computational Complexity of Automatic Structures</h1>. [Internet] [Thesis]. University of Notre Dame; 2011. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/v405s754q02.

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

Council of Science Editors:

Carson JM. Computational Complexity of Automatic Structures</h1>. [Thesis]. University of Notre Dame; 2011. Available from: https://curate.nd.edu/show/v405s754q02

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


University of Notre Dame

5. Gregory Cousins. Some Model Theory of Fields and Differential Fields</h1>.

Degree: Mathematics, 2019, University of Notre Dame

  <span>In this dissertation, we attempt to study connections between various properties of fields, namely boundedness, largeness, and strong form of model completeness called “almost… (more)

Subjects/Keywords: field theory; differential algebra; logic; model theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cousins, G. (2019). Some Model Theory of Fields and Differential Fields</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/k3569310027

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):

Cousins, Gregory. “Some Model Theory of Fields and Differential Fields</h1>.” 2019. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/k3569310027.

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

MLA Handbook (7th Edition):

Cousins, Gregory. “Some Model Theory of Fields and Differential Fields</h1>.” 2019. Web. 10 Jul 2020.

Vancouver:

Cousins G. Some Model Theory of Fields and Differential Fields</h1>. [Internet] [Thesis]. University of Notre Dame; 2019. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/k3569310027.

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

Council of Science Editors:

Cousins G. Some Model Theory of Fields and Differential Fields</h1>. [Thesis]. University of Notre Dame; 2019. Available from: https://curate.nd.edu/show/k3569310027

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


University of Notre Dame

6. Victor A Ocasio. Computability in the class of Real Closed Fields</h1>.

Degree: Mathematics, 2014, University of Notre Dame

  The class of Real Closed Fields (RCF) has nice model theoretic properties, among them O-minimality and quantifier elimination. We examine RCF and the non-elementary… (more)

Subjects/Keywords: Linear Orders; Turing computable embeddings; Logic; Computability; Computable structure theory; Real Closed Fields

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ocasio, V. A. (2014). Computability in the class of Real Closed Fields</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/v979v12176z

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):

Ocasio, Victor A. “Computability in the class of Real Closed Fields</h1>.” 2014. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/v979v12176z.

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

MLA Handbook (7th Edition):

Ocasio, Victor A. “Computability in the class of Real Closed Fields</h1>.” 2014. Web. 10 Jul 2020.

Vancouver:

Ocasio VA. Computability in the class of Real Closed Fields</h1>. [Internet] [Thesis]. University of Notre Dame; 2014. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/v979v12176z.

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

Council of Science Editors:

Ocasio VA. Computability in the class of Real Closed Fields</h1>. [Thesis]. University of Notre Dame; 2014. Available from: https://curate.nd.edu/show/v979v12176z

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


University of Notre Dame

7. Sara B. Quinn. Algorithmic Complexity of Algebraic Structures</h1>.

Degree: Mathematics, 2008, University of Notre Dame

  In mathematics, one often tries to classify some collection of objects up to isomorphism. In mathematical logic, we can explore the complexity of that… (more)

Subjects/Keywords: algebraic structures; computable structure theory; computability theory; mathematical logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Quinn, S. B. (2008). Algorithmic Complexity of Algebraic Structures</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/xd07gq7038v

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):

Quinn, Sara B.. “Algorithmic Complexity of Algebraic Structures</h1>.” 2008. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/xd07gq7038v.

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

MLA Handbook (7th Edition):

Quinn, Sara B.. “Algorithmic Complexity of Algebraic Structures</h1>.” 2008. Web. 10 Jul 2020.

Vancouver:

Quinn SB. Algorithmic Complexity of Algebraic Structures</h1>. [Internet] [Thesis]. University of Notre Dame; 2008. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/xd07gq7038v.

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

Council of Science Editors:

Quinn SB. Algorithmic Complexity of Algebraic Structures</h1>. [Thesis]. University of Notre Dame; 2008. Available from: https://curate.nd.edu/show/xd07gq7038v

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


University of Notre Dame

8. Logan M. Axon. Algorithmically random closed sets and probability</h1>.

Degree: Mathematics, 2010, University of Notre Dame

  Algorithmic randomness in Cantor space has recently become the subject of intense study. Originally defined in terms of the fair coin measure, algorithmic randomness… (more)

Subjects/Keywords: effective randomness; RACS; Martin-Lof randomness

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Axon, L. M. (2010). Algorithmically random closed sets and probability</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/kh04dn4257n

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):

Axon, Logan M.. “Algorithmically random closed sets and probability</h1>.” 2010. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/kh04dn4257n.

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

MLA Handbook (7th Edition):

Axon, Logan M.. “Algorithmically random closed sets and probability</h1>.” 2010. Web. 10 Jul 2020.

Vancouver:

Axon LM. Algorithmically random closed sets and probability</h1>. [Internet] [Thesis]. University of Notre Dame; 2010. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/kh04dn4257n.

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

Council of Science Editors:

Axon LM. Algorithmically random closed sets and probability</h1>. [Thesis]. University of Notre Dame; 2010. Available from: https://curate.nd.edu/show/kh04dn4257n

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


University of Notre Dame

9. Christina M. Maher. On Embeddings of Computable Structures, Classes of Structures and Computable Isomorphism</h1>.

Degree: Mathematics, 2009, University of Notre Dame

  Mathematicians of all sorts participate in the search to classify structures and characterize the structures which belong to a class. Logicians have worked on… (more)

Subjects/Keywords: pull-back theorem; complexity; propositional pull-back; 2-step nilpotent groups

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maher, C. M. (2009). On Embeddings of Computable Structures, Classes of Structures and Computable Isomorphism</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/c821gh95k40

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):

Maher, Christina M.. “On Embeddings of Computable Structures, Classes of Structures and Computable Isomorphism</h1>.” 2009. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/c821gh95k40.

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

MLA Handbook (7th Edition):

Maher, Christina M.. “On Embeddings of Computable Structures, Classes of Structures and Computable Isomorphism</h1>.” 2009. Web. 10 Jul 2020.

Vancouver:

Maher CM. On Embeddings of Computable Structures, Classes of Structures and Computable Isomorphism</h1>. [Internet] [Thesis]. University of Notre Dame; 2009. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/c821gh95k40.

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

Council of Science Editors:

Maher CM. On Embeddings of Computable Structures, Classes of Structures and Computable Isomorphism</h1>. [Thesis]. University of Notre Dame; 2009. Available from: https://curate.nd.edu/show/c821gh95k40

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


University of Notre Dame

10. John David Wallbaum. Computability of Algebraic Structures</h1>.

Degree: Mathematics, 2010, University of Notre Dame

  We investigate computability theoretic properties of algebraic structures. First we consider computable free groups. We give a characterization of the elements in a free… (more)

Subjects/Keywords: limitwise monotonic; free groups; computability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wallbaum, J. D. (2010). Computability of Algebraic Structures</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/zp38w952q84

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):

Wallbaum, John David. “Computability of Algebraic Structures</h1>.” 2010. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/zp38w952q84.

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

MLA Handbook (7th Edition):

Wallbaum, John David. “Computability of Algebraic Structures</h1>.” 2010. Web. 10 Jul 2020.

Vancouver:

Wallbaum JD. Computability of Algebraic Structures</h1>. [Internet] [Thesis]. University of Notre Dame; 2010. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/zp38w952q84.

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

Council of Science Editors:

Wallbaum JD. Computability of Algebraic Structures</h1>. [Thesis]. University of Notre Dame; 2010. Available from: https://curate.nd.edu/show/zp38w952q84

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


University of Notre Dame

11. Rebecca Weber. A definable relation between c.e. sets and ideals</h1>.

Degree: Mathematics, 2004, University of Notre Dame

  The Pi-0-1 classes have become important structures in computability theory. Related to the study of properties of individual classes is the study of the… (more)

Subjects/Keywords: computable enumerable sets; Pi-0-1 classes

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Weber, R. (2004). A definable relation between c.e. sets and ideals</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/3r074t66b55

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):

Weber, Rebecca. “A definable relation between c.e. sets and ideals</h1>.” 2004. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/3r074t66b55.

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

MLA Handbook (7th Edition):

Weber, Rebecca. “A definable relation between c.e. sets and ideals</h1>.” 2004. Web. 10 Jul 2020.

Vancouver:

Weber R. A definable relation between c.e. sets and ideals</h1>. [Internet] [Thesis]. University of Notre Dame; 2004. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/3r074t66b55.

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

Council of Science Editors:

Weber R. A definable relation between c.e. sets and ideals</h1>. [Thesis]. University of Notre Dame; 2004. Available from: https://curate.nd.edu/show/3r074t66b55

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


University of Notre Dame

12. Andrew Peter Arana. Arithmetical investigations: a study of models of arithmetic and purity of methods</h1>.

Degree: Mathematics, 2003, University of Notre Dame

  In the mathematical part, we focus on computability-theoretic issues concerning models of first-order Peano arithmetic (PA). In Chapter 2, we investigate the complexity of… (more)

Subjects/Keywords: epistemology; simplicity; incompleteness; rationalistic optimism; metamathematics; philosophy of mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Arana, A. P. (2003). Arithmetical investigations: a study of models of arithmetic and purity of methods</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/6969z031n0d

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):

Arana, Andrew Peter. “Arithmetical investigations: a study of models of arithmetic and purity of methods</h1>.” 2003. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/6969z031n0d.

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

MLA Handbook (7th Edition):

Arana, Andrew Peter. “Arithmetical investigations: a study of models of arithmetic and purity of methods</h1>.” 2003. Web. 10 Jul 2020.

Vancouver:

Arana AP. Arithmetical investigations: a study of models of arithmetic and purity of methods</h1>. [Internet] [Thesis]. University of Notre Dame; 2003. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/6969z031n0d.

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

Council of Science Editors:

Arana AP. Arithmetical investigations: a study of models of arithmetic and purity of methods</h1>. [Thesis]. University of Notre Dame; 2003. Available from: https://curate.nd.edu/show/6969z031n0d

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


University of Notre Dame

13. Jacob Robert Heidenreich. Stability Theory Modulo a Predicate</h1>.

Degree: Mathematics, 2005, University of Notre Dame

  In this thesis we develop the analysis of the structure of a model, modulo the structure induced by a part of the model interpreting… (more)

Subjects/Keywords: stability theory; real normed vector spaces; classification theory; descriptive set theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Heidenreich, J. R. (2005). Stability Theory Modulo a Predicate</h1>. (Thesis). University of Notre Dame. Retrieved from https://curate.nd.edu/show/zp38w952r6r

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):

Heidenreich, Jacob Robert. “Stability Theory Modulo a Predicate</h1>.” 2005. Thesis, University of Notre Dame. Accessed July 10, 2020. https://curate.nd.edu/show/zp38w952r6r.

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

MLA Handbook (7th Edition):

Heidenreich, Jacob Robert. “Stability Theory Modulo a Predicate</h1>.” 2005. Web. 10 Jul 2020.

Vancouver:

Heidenreich JR. Stability Theory Modulo a Predicate</h1>. [Internet] [Thesis]. University of Notre Dame; 2005. [cited 2020 Jul 10]. Available from: https://curate.nd.edu/show/zp38w952r6r.

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

Council of Science Editors:

Heidenreich JR. Stability Theory Modulo a Predicate</h1>. [Thesis]. University of Notre Dame; 2005. Available from: https://curate.nd.edu/show/zp38w952r6r

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

.