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 Colorado" +contributor:("Keith Kearnes"). Showing records 1 – 8 of 8 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


University of Colorado

1. Shriner, Jeffrey Alan. Hardness Results for the Subpower Membership Problem.

Degree: PhD, 2018, University of Colorado

 We first provide an example of a finite algebra with a Taylor term whose subpower membership problem is NP-hard. We then prove that for any… (more)

Subjects/Keywords: computational complexity; cube term; maltsev condition; subpower membership problem; congruence; Computer Sciences; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shriner, J. A. (2018). Hardness Results for the Subpower Membership Problem. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/63

Chicago Manual of Style (16th Edition):

Shriner, Jeffrey Alan. “Hardness Results for the Subpower Membership Problem.” 2018. Doctoral Dissertation, University of Colorado. Accessed October 28, 2020. https://scholar.colorado.edu/math_gradetds/63.

MLA Handbook (7th Edition):

Shriner, Jeffrey Alan. “Hardness Results for the Subpower Membership Problem.” 2018. Web. 28 Oct 2020.

Vancouver:

Shriner JA. Hardness Results for the Subpower Membership Problem. [Internet] [Doctoral dissertation]. University of Colorado; 2018. [cited 2020 Oct 28]. Available from: https://scholar.colorado.edu/math_gradetds/63.

Council of Science Editors:

Shriner JA. Hardness Results for the Subpower Membership Problem. [Doctoral Dissertation]. University of Colorado; 2018. Available from: https://scholar.colorado.edu/math_gradetds/63


University of Colorado

2. Wiscons, Joshua. Moufang sets of finite Morley rank.

Degree: PhD, Mathematics, 2011, University of Colorado

  We study proper Moufang sets of finite Morley rank for which either the root groups are abelian or the roots groups have no involutions… (more)

Subjects/Keywords: BN-pair; group of finite Morley rank; Moufang set; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wiscons, J. (2011). Moufang sets of finite Morley rank. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/2

Chicago Manual of Style (16th Edition):

Wiscons, Joshua. “Moufang sets of finite Morley rank.” 2011. Doctoral Dissertation, University of Colorado. Accessed October 28, 2020. https://scholar.colorado.edu/math_gradetds/2.

MLA Handbook (7th Edition):

Wiscons, Joshua. “Moufang sets of finite Morley rank.” 2011. Web. 28 Oct 2020.

Vancouver:

Wiscons J. Moufang sets of finite Morley rank. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2020 Oct 28]. Available from: https://scholar.colorado.edu/math_gradetds/2.

Council of Science Editors:

Wiscons J. Moufang sets of finite Morley rank. [Doctoral Dissertation]. University of Colorado; 2011. Available from: https://scholar.colorado.edu/math_gradetds/2


University of Colorado

3. Dent, Topaz. Clones of Finite Idempotent Algebras with Strictly Simple Subalgebras.

Degree: PhD, Mathematics, 2011, University of Colorado

  Abstract: We determine the clone of a finite idempotent algebra A that is not simple and has a unique nontrivial subalgebra S with more… (more)

Subjects/Keywords: clones of idempotent algebras; strictly simple algebras; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dent, T. (2011). Clones of Finite Idempotent Algebras with Strictly Simple Subalgebras. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/3

Chicago Manual of Style (16th Edition):

Dent, Topaz. “Clones of Finite Idempotent Algebras with Strictly Simple Subalgebras.” 2011. Doctoral Dissertation, University of Colorado. Accessed October 28, 2020. https://scholar.colorado.edu/math_gradetds/3.

MLA Handbook (7th Edition):

Dent, Topaz. “Clones of Finite Idempotent Algebras with Strictly Simple Subalgebras.” 2011. Web. 28 Oct 2020.

Vancouver:

Dent T. Clones of Finite Idempotent Algebras with Strictly Simple Subalgebras. [Internet] [Doctoral dissertation]. University of Colorado; 2011. [cited 2020 Oct 28]. Available from: https://scholar.colorado.edu/math_gradetds/3.

Council of Science Editors:

Dent T. Clones of Finite Idempotent Algebras with Strictly Simple Subalgebras. [Doctoral Dissertation]. University of Colorado; 2011. Available from: https://scholar.colorado.edu/math_gradetds/3


University of Colorado

4. Moore, Matthew Dale. The Undecidability of the Definability of Principal Subcongruences.

Degree: PhD, Mathematics, 2013, University of Colorado

  For each Turing machine T, we construct an algebra A'(T) such that the variety generated by A'(T) has definable principal subcongruences if and only… (more)

Subjects/Keywords: definable principal subcongruences; Turing machine; undecidable; Computer Sciences; Logic and Foundations; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moore, M. D. (2013). The Undecidability of the Definability of Principal Subcongruences. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/esbm_gradetds/2

Chicago Manual of Style (16th Edition):

Moore, Matthew Dale. “The Undecidability of the Definability of Principal Subcongruences.” 2013. Doctoral Dissertation, University of Colorado. Accessed October 28, 2020. https://scholar.colorado.edu/esbm_gradetds/2.

MLA Handbook (7th Edition):

Moore, Matthew Dale. “The Undecidability of the Definability of Principal Subcongruences.” 2013. Web. 28 Oct 2020.

Vancouver:

Moore MD. The Undecidability of the Definability of Principal Subcongruences. [Internet] [Doctoral dissertation]. University of Colorado; 2013. [cited 2020 Oct 28]. Available from: https://scholar.colorado.edu/esbm_gradetds/2.

Council of Science Editors:

Moore MD. The Undecidability of the Definability of Principal Subcongruences. [Doctoral Dissertation]. University of Colorado; 2013. Available from: https://scholar.colorado.edu/esbm_gradetds/2


University of Colorado

5. Linman, Julie. Minimal functions on the random permutation.

Degree: PhD, Mathematics, 2016, University of Colorado

  The random permutation is the Fraïssé limit of the class of finite structures with two linear orders. Using a recent Ramsey-theoretic technique, we determine… (more)

Subjects/Keywords: Canonical functions; Unary minimal functions; Closed supergroups; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Linman, J. (2016). Minimal functions on the random permutation. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/40

Chicago Manual of Style (16th Edition):

Linman, Julie. “Minimal functions on the random permutation.” 2016. Doctoral Dissertation, University of Colorado. Accessed October 28, 2020. https://scholar.colorado.edu/math_gradetds/40.

MLA Handbook (7th Edition):

Linman, Julie. “Minimal functions on the random permutation.” 2016. Web. 28 Oct 2020.

Vancouver:

Linman J. Minimal functions on the random permutation. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2020 Oct 28]. Available from: https://scholar.colorado.edu/math_gradetds/40.

Council of Science Editors:

Linman J. Minimal functions on the random permutation. [Doctoral Dissertation]. University of Colorado; 2016. Available from: https://scholar.colorado.edu/math_gradetds/40


University of Colorado

6. Scherer, Charles Frederich. Maximal Comparable and Incomparable Sets in Boolean Algebras.

Degree: PhD, Mathematics, 2016, University of Colorado

  We consider the minimal possible sizes of both maximal comparable and maximal incomparable subsets of Boolean algebras. Comparability is given upper and lower bounds… (more)

Subjects/Keywords: Boolean Algebras; Cardinal Invariants; Logic; Set Theory; Logic and Foundations; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Scherer, C. F. (2016). Maximal Comparable and Incomparable Sets in Boolean Algebras. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/43

Chicago Manual of Style (16th Edition):

Scherer, Charles Frederich. “Maximal Comparable and Incomparable Sets in Boolean Algebras.” 2016. Doctoral Dissertation, University of Colorado. Accessed October 28, 2020. https://scholar.colorado.edu/math_gradetds/43.

MLA Handbook (7th Edition):

Scherer, Charles Frederich. “Maximal Comparable and Incomparable Sets in Boolean Algebras.” 2016. Web. 28 Oct 2020.

Vancouver:

Scherer CF. Maximal Comparable and Incomparable Sets in Boolean Algebras. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2020 Oct 28]. Available from: https://scholar.colorado.edu/math_gradetds/43.

Council of Science Editors:

Scherer CF. Maximal Comparable and Incomparable Sets in Boolean Algebras. [Doctoral Dissertation]. University of Colorado; 2016. Available from: https://scholar.colorado.edu/math_gradetds/43


University of Colorado

7. Selker, Kevin. On Some Min-Max Cardinals on Boolean Algebras.

Degree: PhD, Mathematics, 2015, University of Colorado

  This thesis is concerned with cardinal functions on Boolean Algebras (BAs) in general, and especially with min-max type functions on atomless BAs. The thesis… (more)

Subjects/Keywords: Boolean algebras; Logic; Set theory; Algebra; Logic and Foundations; Set Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Selker, K. (2015). On Some Min-Max Cardinals on Boolean Algebras. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/34

Chicago Manual of Style (16th Edition):

Selker, Kevin. “On Some Min-Max Cardinals on Boolean Algebras.” 2015. Doctoral Dissertation, University of Colorado. Accessed October 28, 2020. https://scholar.colorado.edu/math_gradetds/34.

MLA Handbook (7th Edition):

Selker, Kevin. “On Some Min-Max Cardinals on Boolean Algebras.” 2015. Web. 28 Oct 2020.

Vancouver:

Selker K. On Some Min-Max Cardinals on Boolean Algebras. [Internet] [Doctoral dissertation]. University of Colorado; 2015. [cited 2020 Oct 28]. Available from: https://scholar.colorado.edu/math_gradetds/34.

Council of Science Editors:

Selker K. On Some Min-Max Cardinals on Boolean Algebras. [Doctoral Dissertation]. University of Colorado; 2015. Available from: https://scholar.colorado.edu/math_gradetds/34


University of Colorado

8. Moorhead, Andrew Paul. Higher Commutator Theory for Congruence Modular Varieties.

Degree: PhD, Mathematics, 2016, University of Colorado

We develop the theory of the higher commutator for congruence modular varieties. Advisors/Committee Members: Keith Kearnes, Agnes Szendrei, Peter Mayr, Miklos Maroti, Jakub Bulin.

Subjects/Keywords: Commutator Theory; Congruence Modular; Universal Algebra; Variety; Logic and Foundations of Mathematics; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Moorhead, A. P. (2016). Higher Commutator Theory for Congruence Modular Varieties. (Doctoral Dissertation). University of Colorado. Retrieved from https://scholar.colorado.edu/math_gradetds/52

Chicago Manual of Style (16th Edition):

Moorhead, Andrew Paul. “Higher Commutator Theory for Congruence Modular Varieties.” 2016. Doctoral Dissertation, University of Colorado. Accessed October 28, 2020. https://scholar.colorado.edu/math_gradetds/52.

MLA Handbook (7th Edition):

Moorhead, Andrew Paul. “Higher Commutator Theory for Congruence Modular Varieties.” 2016. Web. 28 Oct 2020.

Vancouver:

Moorhead AP. Higher Commutator Theory for Congruence Modular Varieties. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2020 Oct 28]. Available from: https://scholar.colorado.edu/math_gradetds/52.

Council of Science Editors:

Moorhead AP. Higher Commutator Theory for Congruence Modular Varieties. [Doctoral Dissertation]. University of Colorado; 2016. Available from: https://scholar.colorado.edu/math_gradetds/52

.