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:(Logic AND Foundations). Showing records 1 – 30 of 70 total matches.

[1] [2] [3]

Search Limiters

Last 2 Years | English Only

Country

▼ Search Limiters


University of Oxford

1. Kirby, P. J. The theory of exponential differential equations.

Degree: 2006, University of Oxford

 This thesis is a model-theoretic study of exponential differential equations in the context of differential algebra. I define the theory of a set of differential… (more)

Subjects/Keywords: 515.35; Mathematical logic and foundations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kirby, P. J. (2006). The theory of exponential differential equations. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:b3fdaff3-9253-4efe-a3ff-400c7b4c7db0 : http://eprints.maths.ox.ac.uk/275/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433471

Chicago Manual of Style (16th Edition):

Kirby, P J. “The theory of exponential differential equations.” 2006. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:b3fdaff3-9253-4efe-a3ff-400c7b4c7db0 : http://eprints.maths.ox.ac.uk/275/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433471.

MLA Handbook (7th Edition):

Kirby, P J. “The theory of exponential differential equations.” 2006. Web. 21 Jul 2019.

Vancouver:

Kirby PJ. The theory of exponential differential equations. [Internet] [Doctoral dissertation]. University of Oxford; 2006. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:b3fdaff3-9253-4efe-a3ff-400c7b4c7db0 : http://eprints.maths.ox.ac.uk/275/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433471.

Council of Science Editors:

Kirby PJ. The theory of exponential differential equations. [Doctoral Dissertation]. University of Oxford; 2006. Available from: http://ora.ox.ac.uk/objects/uuid:b3fdaff3-9253-4efe-a3ff-400c7b4c7db0 : http://eprints.maths.ox.ac.uk/275/ ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.433471


University of Oxford

2. Yim, Austin Vincent. On Galois correspondences in formal logic.

Degree: PhD, 2012, University of Oxford

 This thesis examines two approaches to Galois correspondences in formal logic. A standard result of classical first-order model theory is the observation that models of… (more)

Subjects/Keywords: 511.3; Mathematics; Mathematical logic and foundations; Logic; Number theory; Mathematical logic; model theory; substructural logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yim, A. V. (2012). On Galois correspondences in formal logic. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:b47d1dda-8186-4c81-876c-359409f45b97 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588404

Chicago Manual of Style (16th Edition):

Yim, Austin Vincent. “On Galois correspondences in formal logic.” 2012. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:b47d1dda-8186-4c81-876c-359409f45b97 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588404.

MLA Handbook (7th Edition):

Yim, Austin Vincent. “On Galois correspondences in formal logic.” 2012. Web. 21 Jul 2019.

Vancouver:

Yim AV. On Galois correspondences in formal logic. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:b47d1dda-8186-4c81-876c-359409f45b97 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588404.

Council of Science Editors:

Yim AV. On Galois correspondences in formal logic. [Doctoral Dissertation]. University of Oxford; 2012. Available from: http://ora.ox.ac.uk/objects/uuid:b47d1dda-8186-4c81-876c-359409f45b97 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.588404


University of Illinois – Chicago

3. Morris, Sean P. Investigating the Universe: Quine, New Foundations, and the Philosophy of Set Theory.

Degree: 2012, University of Illinois – Chicago

 Investigating the Universe Quine, New Foundations, and the Philosophy of Set Theory Sean P. Morris, Ph.D. Department of Philosophy University of Illinois at Chicago Chicago,… (more)

Subjects/Keywords: W.V. Quine; New Foundations; Set Theory; Logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Morris, S. P. (2012). Investigating the Universe: Quine, New Foundations, and the Philosophy of Set Theory. (Thesis). University of Illinois – Chicago. Retrieved from http://hdl.handle.net/10027/9545

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

Morris, Sean P. “Investigating the Universe: Quine, New Foundations, and the Philosophy of Set Theory.” 2012. Thesis, University of Illinois – Chicago. Accessed July 21, 2019. http://hdl.handle.net/10027/9545.

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

MLA Handbook (7th Edition):

Morris, Sean P. “Investigating the Universe: Quine, New Foundations, and the Philosophy of Set Theory.” 2012. Web. 21 Jul 2019.

Vancouver:

Morris SP. Investigating the Universe: Quine, New Foundations, and the Philosophy of Set Theory. [Internet] [Thesis]. University of Illinois – Chicago; 2012. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/10027/9545.

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

Council of Science Editors:

Morris SP. Investigating the Universe: Quine, New Foundations, and the Philosophy of Set Theory. [Thesis]. University of Illinois – Chicago; 2012. Available from: http://hdl.handle.net/10027/9545

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


University of Pennsylvania

4. Cho, Simon Seamoon. Continuity In Enriched Categories And Metric Model Theory.

Degree: 2017, University of Pennsylvania

 We explore aspects of continuity as they manifest in two separate settings - metric model theory (continuous logic) and enriched categories - and interpret the… (more)

Subjects/Keywords: Logic and Foundations of Mathematics; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cho, S. S. (2017). Continuity In Enriched Categories And Metric Model Theory. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/2227

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

Cho, Simon Seamoon. “Continuity In Enriched Categories And Metric Model Theory.” 2017. Thesis, University of Pennsylvania. Accessed July 21, 2019. https://repository.upenn.edu/edissertations/2227.

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

MLA Handbook (7th Edition):

Cho, Simon Seamoon. “Continuity In Enriched Categories And Metric Model Theory.” 2017. Web. 21 Jul 2019.

Vancouver:

Cho SS. Continuity In Enriched Categories And Metric Model Theory. [Internet] [Thesis]. University of Pennsylvania; 2017. [cited 2019 Jul 21]. Available from: https://repository.upenn.edu/edissertations/2227.

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

Council of Science Editors:

Cho SS. Continuity In Enriched Categories And Metric Model Theory. [Thesis]. University of Pennsylvania; 2017. Available from: https://repository.upenn.edu/edissertations/2227

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


University of Colorado

5. 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 http://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 July 21, 2019. http://scholar.colorado.edu/math_gradetds/34.

MLA Handbook (7th Edition):

Selker, Kevin. “On Some Min-Max Cardinals on Boolean Algebras.” 2015. Web. 21 Jul 2019.

Vancouver:

Selker K. On Some Min-Max Cardinals on Boolean Algebras. [Internet] [Doctoral dissertation]. University of Colorado; 2015. [cited 2019 Jul 21]. Available from: http://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: http://scholar.colorado.edu/math_gradetds/34


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 http://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 July 21, 2019. http://scholar.colorado.edu/math_gradetds/43.

MLA Handbook (7th Edition):

Scherer, Charles Frederich. “Maximal Comparable and Incomparable Sets in Boolean Algebras.” 2016. Web. 21 Jul 2019.

Vancouver:

Scherer CF. Maximal Comparable and Incomparable Sets in Boolean Algebras. [Internet] [Doctoral dissertation]. University of Colorado; 2016. [cited 2019 Jul 21]. Available from: http://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: http://scholar.colorado.edu/math_gradetds/43


University of Western Ontario

7. McDonald, Darren. Anti-Foundational Categorical Structuralism.

Degree: 2012, University of Western Ontario

 The aim of this dissertation is to outline and defend the view here dubbed “anti-foundational categorical structuralism” (henceforth AFCS). The program put forth is intended… (more)

Subjects/Keywords: category theory; philosophy; foundations of mathematics; structuralism; properties; mathematical truth; Logic and Foundations of Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

McDonald, D. (2012). Anti-Foundational Categorical Structuralism. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/533

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

McDonald, Darren. “Anti-Foundational Categorical Structuralism.” 2012. Thesis, University of Western Ontario. Accessed July 21, 2019. https://ir.lib.uwo.ca/etd/533.

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

MLA Handbook (7th Edition):

McDonald, Darren. “Anti-Foundational Categorical Structuralism.” 2012. Web. 21 Jul 2019.

Vancouver:

McDonald D. Anti-Foundational Categorical Structuralism. [Internet] [Thesis]. University of Western Ontario; 2012. [cited 2019 Jul 21]. Available from: https://ir.lib.uwo.ca/etd/533.

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

Council of Science Editors:

McDonald D. Anti-Foundational Categorical Structuralism. [Thesis]. University of Western Ontario; 2012. Available from: https://ir.lib.uwo.ca/etd/533

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


University of Oxford

8. D'Silva, Vijay Victor. Logical abstract interpretation.

Degree: PhD, 2013, University of Oxford

 Logical deduction and abstraction from detail are fundamental, yet distinct aspects of reasoning about programs. This dissertation shows that the combination of logic and abstract… (more)

Subjects/Keywords: 005.115; Computer science (mathematics); Mathematical logic and foundations; Logic; Lattice Theory; Abstract Interpretation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

D'Silva, V. V. (2013). Logical abstract interpretation. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:3648e579-01dc-4054-8290-31626d53b003 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581322

Chicago Manual of Style (16th Edition):

D'Silva, Vijay Victor. “Logical abstract interpretation.” 2013. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:3648e579-01dc-4054-8290-31626d53b003 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581322.

MLA Handbook (7th Edition):

D'Silva, Vijay Victor. “Logical abstract interpretation.” 2013. Web. 21 Jul 2019.

Vancouver:

D'Silva VV. Logical abstract interpretation. [Internet] [Doctoral dissertation]. University of Oxford; 2013. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:3648e579-01dc-4054-8290-31626d53b003 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581322.

Council of Science Editors:

D'Silva VV. Logical abstract interpretation. [Doctoral Dissertation]. University of Oxford; 2013. Available from: http://ora.ox.ac.uk/objects/uuid:3648e579-01dc-4054-8290-31626d53b003 ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581322


University of Oxford

9. Anscombe, William George. Definability in Henselian fields.

Degree: PhD, 2012, University of Oxford

 We investigate definability in henselian fields. Specifically, we are interested in those sets and substructures that are existentially definable or definable with `few' parameters. Our… (more)

Subjects/Keywords: 511.324; Mathematical logic and foundations; logic; 03C model theory; 12L field theory; polynomials

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anscombe, W. G. (2012). Definability in Henselian fields. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:65eec6d9-457d-4673-80de-6413865a6a46 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581039

Chicago Manual of Style (16th Edition):

Anscombe, William George. “Definability in Henselian fields.” 2012. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:65eec6d9-457d-4673-80de-6413865a6a46 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581039.

MLA Handbook (7th Edition):

Anscombe, William George. “Definability in Henselian fields.” 2012. Web. 21 Jul 2019.

Vancouver:

Anscombe WG. Definability in Henselian fields. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:65eec6d9-457d-4673-80de-6413865a6a46 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581039.

Council of Science Editors:

Anscombe WG. Definability in Henselian fields. [Doctoral Dissertation]. University of Oxford; 2012. Available from: http://ora.ox.ac.uk/objects/uuid:65eec6d9-457d-4673-80de-6413865a6a46 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581039


Boise State University

10. Sinclaire, Morgan. Formally Verifying Peano Arithmetic.

Degree: 2019, Boise State University

 This work is concerned with implementing Gentzen’s consistency proof in the Coq theorem prover. In Chapter 1, we summarize the basic philosophical, historical, and mathematical… (more)

Subjects/Keywords: logic; proof theory; Hilbert's program; cut-elimination; interactive theorem proving; Coq; Logic and Foundations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sinclaire, M. (2019). Formally Verifying Peano Arithmetic. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/1546

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

Sinclaire, Morgan. “Formally Verifying Peano Arithmetic.” 2019. Thesis, Boise State University. Accessed July 21, 2019. https://scholarworks.boisestate.edu/td/1546.

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

MLA Handbook (7th Edition):

Sinclaire, Morgan. “Formally Verifying Peano Arithmetic.” 2019. Web. 21 Jul 2019.

Vancouver:

Sinclaire M. Formally Verifying Peano Arithmetic. [Internet] [Thesis]. Boise State University; 2019. [cited 2019 Jul 21]. Available from: https://scholarworks.boisestate.edu/td/1546.

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

Council of Science Editors:

Sinclaire M. Formally Verifying Peano Arithmetic. [Thesis]. Boise State University; 2019. Available from: https://scholarworks.boisestate.edu/td/1546

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


University of Oxford

11. Solanki, Vinesh. Zariski structures in noncommutative algebraic geometry and representation theory.

Degree: PhD, 2011, University of Oxford

 A suitable subcategory of affine Azumaya algebras is defined and a functor from this category to the category of Zariski structures is constructed. The rudiments… (more)

Subjects/Keywords: 576.35; Mathematical logic and foundations; Algebraic geometry; Quantum theory (mathematics)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Solanki, V. (2011). Zariski structures in noncommutative algebraic geometry and representation theory. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:3fa23b75-9b85-4dc2-9ad6-bdb20d61fe45 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572659

Chicago Manual of Style (16th Edition):

Solanki, Vinesh. “Zariski structures in noncommutative algebraic geometry and representation theory.” 2011. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:3fa23b75-9b85-4dc2-9ad6-bdb20d61fe45 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572659.

MLA Handbook (7th Edition):

Solanki, Vinesh. “Zariski structures in noncommutative algebraic geometry and representation theory.” 2011. Web. 21 Jul 2019.

Vancouver:

Solanki V. Zariski structures in noncommutative algebraic geometry and representation theory. [Internet] [Doctoral dissertation]. University of Oxford; 2011. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:3fa23b75-9b85-4dc2-9ad6-bdb20d61fe45 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572659.

Council of Science Editors:

Solanki V. Zariski structures in noncommutative algebraic geometry and representation theory. [Doctoral Dissertation]. University of Oxford; 2011. Available from: http://ora.ox.ac.uk/objects/uuid:3fa23b75-9b85-4dc2-9ad6-bdb20d61fe45 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.572659


University of Michigan

12. Wellmuth, John James. Epistemological Foundations Of Formal Logic.

Degree: PhD, Philosophy, Religion and Theology, 1940, University of Michigan

Subjects/Keywords: Epistemological; Formal; Foundations; Logic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wellmuth, J. J. (1940). Epistemological Foundations Of Formal Logic. (Doctoral Dissertation). University of Michigan. Retrieved from http://hdl.handle.net/2027.42/128621

Chicago Manual of Style (16th Edition):

Wellmuth, John James. “Epistemological Foundations Of Formal Logic.” 1940. Doctoral Dissertation, University of Michigan. Accessed July 21, 2019. http://hdl.handle.net/2027.42/128621.

MLA Handbook (7th Edition):

Wellmuth, John James. “Epistemological Foundations Of Formal Logic.” 1940. Web. 21 Jul 2019.

Vancouver:

Wellmuth JJ. Epistemological Foundations Of Formal Logic. [Internet] [Doctoral dissertation]. University of Michigan; 1940. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/2027.42/128621.

Council of Science Editors:

Wellmuth JJ. Epistemological Foundations Of Formal Logic. [Doctoral Dissertation]. University of Michigan; 1940. Available from: http://hdl.handle.net/2027.42/128621

13. Fussner, Daniel Wesley. Categories of Residuated Lattices.

Degree: PhD, Mathematics, 2018, U of Denver

  We present dual variants of two algebraic constructions of certain classes of residuated lattices: The Galatos-Raftery construction of Sugihara monoids and their bounded expansions,… (more)

Subjects/Keywords: Algebraic logic; Categorical equivalences; Duality theory; Residuated lattices; Substructural logic; Topological dualities; Algebra; Logic and Foundations; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fussner, D. W. (2018). Categories of Residuated Lattices. (Doctoral Dissertation). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1527

Chicago Manual of Style (16th Edition):

Fussner, Daniel Wesley. “Categories of Residuated Lattices.” 2018. Doctoral Dissertation, U of Denver. Accessed July 21, 2019. https://digitalcommons.du.edu/etd/1527.

MLA Handbook (7th Edition):

Fussner, Daniel Wesley. “Categories of Residuated Lattices.” 2018. Web. 21 Jul 2019.

Vancouver:

Fussner DW. Categories of Residuated Lattices. [Internet] [Doctoral dissertation]. U of Denver; 2018. [cited 2019 Jul 21]. Available from: https://digitalcommons.du.edu/etd/1527.

Council of Science Editors:

Fussner DW. Categories of Residuated Lattices. [Doctoral Dissertation]. U of Denver; 2018. Available from: https://digitalcommons.du.edu/etd/1527


University of Pennsylvania

14. Dinesh, Nikhil. Regulatory Conformance Checking: Logic and Logical Form.

Degree: 2010, University of Pennsylvania

 We consider the problem of checking whether an organization conforms to a body of regulation. Conformance is studied in a runtime verification setting. The regulation… (more)

Subjects/Keywords: modal logic; access control; conformance; deontic logic; logical form; scope; Logic and Foundations of Mathematics; Other Computer Engineering; Semantics and Pragmatics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Dinesh, N. (2010). Regulatory Conformance Checking: Logic and Logical Form. (Thesis). University of Pennsylvania. Retrieved from https://repository.upenn.edu/edissertations/295

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

Dinesh, Nikhil. “Regulatory Conformance Checking: Logic and Logical Form.” 2010. Thesis, University of Pennsylvania. Accessed July 21, 2019. https://repository.upenn.edu/edissertations/295.

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

MLA Handbook (7th Edition):

Dinesh, Nikhil. “Regulatory Conformance Checking: Logic and Logical Form.” 2010. Web. 21 Jul 2019.

Vancouver:

Dinesh N. Regulatory Conformance Checking: Logic and Logical Form. [Internet] [Thesis]. University of Pennsylvania; 2010. [cited 2019 Jul 21]. Available from: https://repository.upenn.edu/edissertations/295.

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

Council of Science Editors:

Dinesh N. Regulatory Conformance Checking: Logic and Logical Form. [Thesis]. University of Pennsylvania; 2010. Available from: https://repository.upenn.edu/edissertations/295

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

15. Mulvihill, Corey Edward. Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.

Degree: 2015, University of Waterloo

 Hilbert’s choice operators τ and ε, when added to intuitionistic logic, strengthen it. In the presence of certain extensionality axioms they produce classical logic, while… (more)

Subjects/Keywords: Logic; Foundations of Mathematics; Hilbert's Epsilon operator; Intermediate Logics; Intuitionism; Anti-Realism; Philosophy of Logic; Metaphysics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Mulvihill, C. E. (2015). Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9643

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

Mulvihill, Corey Edward. “Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.” 2015. Thesis, University of Waterloo. Accessed July 21, 2019. http://hdl.handle.net/10012/9643.

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

MLA Handbook (7th Edition):

Mulvihill, Corey Edward. “Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic.” 2015. Web. 21 Jul 2019.

Vancouver:

Mulvihill CE. Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/10012/9643.

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

Council of Science Editors:

Mulvihill CE. Existence Assumptions and Logical Principles: Choice Operators in Intuitionistic Logic. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9643

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


University of Colorado

16. 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 http://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 July 21, 2019. http://scholar.colorado.edu/esbm_gradetds/2.

MLA Handbook (7th Edition):

Moore, Matthew Dale. “The Undecidability of the Definability of Principal Subcongruences.” 2013. Web. 21 Jul 2019.

Vancouver:

Moore MD. The Undecidability of the Definability of Principal Subcongruences. [Internet] [Doctoral dissertation]. University of Colorado; 2013. [cited 2019 Jul 21]. Available from: http://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: http://scholar.colorado.edu/esbm_gradetds/2


University of Oxford

17. Foster, T. D. Power functions and exponentials in o-minimal expansions of fields.

Degree: PhD, 2010, University of Oxford

 The principal focus of this thesis is the study of the real numbers regarded as a structure endowed with its usual addition and multiplication and… (more)

Subjects/Keywords: 510; Mathematical logic and foundations; o-minimal; exponentiation; power function; decidability; model completeness; real numbers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Foster, T. D. (2010). Power functions and exponentials in o-minimal expansions of fields. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:24b2d0d2-b0d7-42e5-aa80-e4e0bda56c9a ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526769

Chicago Manual of Style (16th Edition):

Foster, T D. “Power functions and exponentials in o-minimal expansions of fields.” 2010. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:24b2d0d2-b0d7-42e5-aa80-e4e0bda56c9a ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526769.

MLA Handbook (7th Edition):

Foster, T D. “Power functions and exponentials in o-minimal expansions of fields.” 2010. Web. 21 Jul 2019.

Vancouver:

Foster TD. Power functions and exponentials in o-minimal expansions of fields. [Internet] [Doctoral dissertation]. University of Oxford; 2010. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:24b2d0d2-b0d7-42e5-aa80-e4e0bda56c9a ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526769.

Council of Science Editors:

Foster TD. Power functions and exponentials in o-minimal expansions of fields. [Doctoral Dissertation]. University of Oxford; 2010. Available from: http://ora.ox.ac.uk/objects/uuid:24b2d0d2-b0d7-42e5-aa80-e4e0bda56c9a ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.526769


University of Oxford

18. Sustretov, Dmitry. Non-algebraic Zariski geometries.

Degree: PhD, 2012, University of Oxford

 The thesis deals with definability of certain Zariski geometries, introduced by Zilber, in the theory of algebraically closed fields. I axiomatise a class of structures,… (more)

Subjects/Keywords: 516.3; Mathematical logic and foundations; Zariski geometries; interpretability; algebraic geometry; model theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Sustretov, D. (2012). Non-algebraic Zariski geometries. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:b67f85d8-6fac-4820-913d-a064d3582412 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581011

Chicago Manual of Style (16th Edition):

Sustretov, Dmitry. “Non-algebraic Zariski geometries.” 2012. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:b67f85d8-6fac-4820-913d-a064d3582412 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581011.

MLA Handbook (7th Edition):

Sustretov, Dmitry. “Non-algebraic Zariski geometries.” 2012. Web. 21 Jul 2019.

Vancouver:

Sustretov D. Non-algebraic Zariski geometries. [Internet] [Doctoral dissertation]. University of Oxford; 2012. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:b67f85d8-6fac-4820-913d-a064d3582412 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581011.

Council of Science Editors:

Sustretov D. Non-algebraic Zariski geometries. [Doctoral Dissertation]. University of Oxford; 2012. Available from: http://ora.ox.ac.uk/objects/uuid:b67f85d8-6fac-4820-913d-a064d3582412 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.581011


University of Oxford

19. Jahnke, Franziska Maxie. Definable henselian valuations and absolute Galois groups.

Degree: PhD, 2014, University of Oxford

 This thesis investigates the connections between henselian valuations and absolute Galois groups. There are fundamental links between these: On one hand, the absolute Galois group… (more)

Subjects/Keywords: 515; Mathematical logic and foundations; Valuations; Henselian; Absolute Galois Theory; Model Theory of Fields; Definability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jahnke, F. M. (2014). Definable henselian valuations and absolute Galois groups. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:95b8f301-bb8b-42d9-9b63-46580424e515 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596025

Chicago Manual of Style (16th Edition):

Jahnke, Franziska Maxie. “Definable henselian valuations and absolute Galois groups.” 2014. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:95b8f301-bb8b-42d9-9b63-46580424e515 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596025.

MLA Handbook (7th Edition):

Jahnke, Franziska Maxie. “Definable henselian valuations and absolute Galois groups.” 2014. Web. 21 Jul 2019.

Vancouver:

Jahnke FM. Definable henselian valuations and absolute Galois groups. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:95b8f301-bb8b-42d9-9b63-46580424e515 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596025.

Council of Science Editors:

Jahnke FM. Definable henselian valuations and absolute Galois groups. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:95b8f301-bb8b-42d9-9b63-46580424e515 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.596025


Boise State University

20. Beserra, Kyle Douglas. On the Conjugacy Problem for Automorphisms of Trees.

Degree: 2016, Boise State University

 In this thesis we identify the complexity of the conjugacy problem of automorphisms of regular trees. We expand on the results of Kechris, Louveau, and… (more)

Subjects/Keywords: invariant descriptive set theory; borel reducibility; graph theory; regular trees; Logic and Foundations; Set Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Beserra, K. D. (2016). On the Conjugacy Problem for Automorphisms of Trees. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/1083

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

Beserra, Kyle Douglas. “On the Conjugacy Problem for Automorphisms of Trees.” 2016. Thesis, Boise State University. Accessed July 21, 2019. https://scholarworks.boisestate.edu/td/1083.

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

MLA Handbook (7th Edition):

Beserra, Kyle Douglas. “On the Conjugacy Problem for Automorphisms of Trees.” 2016. Web. 21 Jul 2019.

Vancouver:

Beserra KD. On the Conjugacy Problem for Automorphisms of Trees. [Internet] [Thesis]. Boise State University; 2016. [cited 2019 Jul 21]. Available from: https://scholarworks.boisestate.edu/td/1083.

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

Council of Science Editors:

Beserra KD. On the Conjugacy Problem for Automorphisms of Trees. [Thesis]. Boise State University; 2016. Available from: https://scholarworks.boisestate.edu/td/1083

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


McMaster University

21. Hu, Qian. REASONING ABOUT DEFINEDNESS - A DEFINEDNESS CHECKING SYSTEM FOR AN IMPLEMENTED LOGIC.

Degree: MSc, 2011, McMaster University

Effective definedness checking is crucial for an implementation of a logic with undefinedness. The objective of the MathScheme project is to develop a new… (more)

Subjects/Keywords: Undefinedness; AND/OR Tree; MathScheme; Chiron; Mechanized Mathematics; Computer Sciences; Logic and Foundations; Computer Sciences

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hu, Q. (2011). REASONING ABOUT DEFINEDNESS - A DEFINEDNESS CHECKING SYSTEM FOR AN IMPLEMENTED LOGIC. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/11471

Chicago Manual of Style (16th Edition):

Hu, Qian. “REASONING ABOUT DEFINEDNESS - A DEFINEDNESS CHECKING SYSTEM FOR AN IMPLEMENTED LOGIC.” 2011. Masters Thesis, McMaster University. Accessed July 21, 2019. http://hdl.handle.net/11375/11471.

MLA Handbook (7th Edition):

Hu, Qian. “REASONING ABOUT DEFINEDNESS - A DEFINEDNESS CHECKING SYSTEM FOR AN IMPLEMENTED LOGIC.” 2011. Web. 21 Jul 2019.

Vancouver:

Hu Q. REASONING ABOUT DEFINEDNESS - A DEFINEDNESS CHECKING SYSTEM FOR AN IMPLEMENTED LOGIC. [Internet] [Masters thesis]. McMaster University; 2011. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/11375/11471.

Council of Science Editors:

Hu Q. REASONING ABOUT DEFINEDNESS - A DEFINEDNESS CHECKING SYSTEM FOR AN IMPLEMENTED LOGIC. [Masters Thesis]. McMaster University; 2011. Available from: http://hdl.handle.net/11375/11471


Boise State University

22. Krakoff, Marcello Gianni. Computable Reducibility of Equivalence Relations.

Degree: 2019, Boise State University

 Computable reducibility of equivalence relations is a tool to compare the complexity of equivalence relations on natural numbers. Its use is important to those doing… (more)

Subjects/Keywords: computability theory; descriptive set theory; equivalence relations; Borel equivalence relations; Logic and Foundations; Set Theory

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Krakoff, M. G. (2019). Computable Reducibility of Equivalence Relations. (Thesis). Boise State University. Retrieved from https://scholarworks.boisestate.edu/td/1536

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

Krakoff, Marcello Gianni. “Computable Reducibility of Equivalence Relations.” 2019. Thesis, Boise State University. Accessed July 21, 2019. https://scholarworks.boisestate.edu/td/1536.

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

MLA Handbook (7th Edition):

Krakoff, Marcello Gianni. “Computable Reducibility of Equivalence Relations.” 2019. Web. 21 Jul 2019.

Vancouver:

Krakoff MG. Computable Reducibility of Equivalence Relations. [Internet] [Thesis]. Boise State University; 2019. [cited 2019 Jul 21]. Available from: https://scholarworks.boisestate.edu/td/1536.

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

Council of Science Editors:

Krakoff MG. Computable Reducibility of Equivalence Relations. [Thesis]. Boise State University; 2019. Available from: https://scholarworks.boisestate.edu/td/1536

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


Marshall University

23. Saadaoui, Alaeddine. On the Logic of Reverse Mathematics.

Degree: 2012, Marshall University

 The goal of reverse mathematics is to study the implication and non-implication relationships between theorems. These relationships have their own internal logic, allowing some implications… (more)

Subjects/Keywords: Logic; Reverse Mathematics; <; p>; Reverse mathematics.<; /p>; <; p>; Logic - Mathematics.<; /p>;

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saadaoui, A. (2012). On the Logic of Reverse Mathematics. (Thesis). Marshall University. Retrieved from http://mds.marshall.edu/etd/234

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

Saadaoui, Alaeddine. “On the Logic of Reverse Mathematics.” 2012. Thesis, Marshall University. Accessed July 21, 2019. http://mds.marshall.edu/etd/234.

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

MLA Handbook (7th Edition):

Saadaoui, Alaeddine. “On the Logic of Reverse Mathematics.” 2012. Web. 21 Jul 2019.

Vancouver:

Saadaoui A. On the Logic of Reverse Mathematics. [Internet] [Thesis]. Marshall University; 2012. [cited 2019 Jul 21]. Available from: http://mds.marshall.edu/etd/234.

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

Council of Science Editors:

Saadaoui A. On the Logic of Reverse Mathematics. [Thesis]. Marshall University; 2012. Available from: http://mds.marshall.edu/etd/234

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


University of Western Ontario

24. Papagiannopoulos, Filippos A. Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations.

Degree: 2018, University of Western Ontario

 This dissertation examines aspects of the interplay between computing and scientific practice. The appropriate foundational framework for such an endeavour is rather real computability than… (more)

Subjects/Keywords: Definitions of Algorithms; Real Computability; BSS model; Foundations of Scientific Computing; Analog Computing; Physical Models; Logic and Foundations of Mathematics; Philosophy of Science

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Papagiannopoulos, F. A. (2018). Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations. (Thesis). University of Western Ontario. Retrieved from https://ir.lib.uwo.ca/etd/5660

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

Papagiannopoulos, Filippos A. “Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations.” 2018. Thesis, University of Western Ontario. Accessed July 21, 2019. https://ir.lib.uwo.ca/etd/5660.

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

MLA Handbook (7th Edition):

Papagiannopoulos, Filippos A. “Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations.” 2018. Web. 21 Jul 2019.

Vancouver:

Papagiannopoulos FA. Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations. [Internet] [Thesis]. University of Western Ontario; 2018. [cited 2019 Jul 21]. Available from: https://ir.lib.uwo.ca/etd/5660.

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

Council of Science Editors:

Papagiannopoulos FA. Computing, Modelling, and Scientific Practice: Foundational Analyses and Limitations. [Thesis]. University of Western Ontario; 2018. Available from: https://ir.lib.uwo.ca/etd/5660

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

25. Cardona Fuentes, Riquelmi Salvador. The Finite Embeddability Property for Some Noncommutative Knotted Varieties of RL and DRL.

Degree: PhD, Mathematics, 2015, U of Denver

  Residuated lattices, although originally considered in the realm of algebra providing a general setting for studying ideals in ring theory, were later shown to… (more)

Subjects/Keywords: Distributive Lattices; Finite Embeddability Property; Knotted Axioms; Residuated Lattices; Strong Finite Model Property; Substructural Logics; Logic and Foundations; Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cardona Fuentes, R. S. (2015). The Finite Embeddability Property for Some Noncommutative Knotted Varieties of RL and DRL. (Doctoral Dissertation). U of Denver. Retrieved from https://digitalcommons.du.edu/etd/1016

Chicago Manual of Style (16th Edition):

Cardona Fuentes, Riquelmi Salvador. “The Finite Embeddability Property for Some Noncommutative Knotted Varieties of RL and DRL.” 2015. Doctoral Dissertation, U of Denver. Accessed July 21, 2019. https://digitalcommons.du.edu/etd/1016.

MLA Handbook (7th Edition):

Cardona Fuentes, Riquelmi Salvador. “The Finite Embeddability Property for Some Noncommutative Knotted Varieties of RL and DRL.” 2015. Web. 21 Jul 2019.

Vancouver:

Cardona Fuentes RS. The Finite Embeddability Property for Some Noncommutative Knotted Varieties of RL and DRL. [Internet] [Doctoral dissertation]. U of Denver; 2015. [cited 2019 Jul 21]. Available from: https://digitalcommons.du.edu/etd/1016.

Council of Science Editors:

Cardona Fuentes RS. The Finite Embeddability Property for Some Noncommutative Knotted Varieties of RL and DRL. [Doctoral Dissertation]. U of Denver; 2015. Available from: https://digitalcommons.du.edu/etd/1016


University of Gothenburg / Göteborgs Universitet

26. Kindvall Gorbow, Paul. Self-similarity in the foundations.

Degree: 2018, University of Gothenburg / Göteborgs Universitet

 This thesis concerns embeddings and self-embeddings of foundational structures in both set theory and category theory. The first part of the work on models of… (more)

Subjects/Keywords: Logic; Set theory; Category theory; Foundations of mathematics; Model theory; Categorical semantics; Algebraic set theory; Non-standard models

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kindvall Gorbow, P. (2018). Self-similarity in the foundations. (Thesis). University of Gothenburg / Göteborgs Universitet. Retrieved from http://hdl.handle.net/2077/56240

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

Kindvall Gorbow, Paul. “Self-similarity in the foundations.” 2018. Thesis, University of Gothenburg / Göteborgs Universitet. Accessed July 21, 2019. http://hdl.handle.net/2077/56240.

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

MLA Handbook (7th Edition):

Kindvall Gorbow, Paul. “Self-similarity in the foundations.” 2018. Web. 21 Jul 2019.

Vancouver:

Kindvall Gorbow P. Self-similarity in the foundations. [Internet] [Thesis]. University of Gothenburg / Göteborgs Universitet; 2018. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/2077/56240.

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

Council of Science Editors:

Kindvall Gorbow P. Self-similarity in the foundations. [Thesis]. University of Gothenburg / Göteborgs Universitet; 2018. Available from: http://hdl.handle.net/2077/56240

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


University of Oxford

27. Shearer, Robert D. C. Scalable reasoning for description logics.

Degree: 2011, University of Oxford

 Description logics (DLs) are knowledge representation formalisms with well-understood model-theoretic semantics and computational properties. The DL SROIQ provides the logical underpinning for the semantic web… (more)

Subjects/Keywords: 005.3; Computer science (mathematics) : Mathematical logic and foundations : Applications and algorithms : description logics : automated reasoning : classification

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Shearer, R. D. C. (2011). Scalable reasoning for description logics. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:d7c4fbf6-4258-4db4-a451-476dcebe68ca ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540275

Chicago Manual of Style (16th Edition):

Shearer, Robert D C. “Scalable reasoning for description logics.” 2011. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:d7c4fbf6-4258-4db4-a451-476dcebe68ca ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540275.

MLA Handbook (7th Edition):

Shearer, Robert D C. “Scalable reasoning for description logics.” 2011. Web. 21 Jul 2019.

Vancouver:

Shearer RDC. Scalable reasoning for description logics. [Internet] [Doctoral dissertation]. University of Oxford; 2011. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:d7c4fbf6-4258-4db4-a451-476dcebe68ca ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540275.

Council of Science Editors:

Shearer RDC. Scalable reasoning for description logics. [Doctoral Dissertation]. University of Oxford; 2011. Available from: http://ora.ox.ac.uk/objects/uuid:d7c4fbf6-4258-4db4-a451-476dcebe68ca ; http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.540275


Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

28. Rouvelas, Panagiotis. Το πρόβλημα της συνέπειας για το αξιωματικό σύστημα NF.

Degree: 2017, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ)

In this work, we present results concerning the consistency problem for the axiomatic system “New Foundations” (NF). More specifically, we study the decidability of various… (more)

Subjects/Keywords: Θεωρία συνόλων; Λογική; Απλή θεωρία τύπων; Set theory; Logic; Simple type theory; New Foundations; NF; Quine

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rouvelas, P. (2017). Το πρόβλημα της συνέπειας για το αξιωματικό σύστημα NF. (Thesis). Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Retrieved from http://hdl.handle.net/10442/hedi/41152

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

Rouvelas, Panagiotis. “Το πρόβλημα της συνέπειας για το αξιωματικό σύστημα NF.” 2017. Thesis, Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ). Accessed July 21, 2019. http://hdl.handle.net/10442/hedi/41152.

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

MLA Handbook (7th Edition):

Rouvelas, Panagiotis. “Το πρόβλημα της συνέπειας για το αξιωματικό σύστημα NF.” 2017. Web. 21 Jul 2019.

Vancouver:

Rouvelas P. Το πρόβλημα της συνέπειας για το αξιωματικό σύστημα NF. [Internet] [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2017. [cited 2019 Jul 21]. Available from: http://hdl.handle.net/10442/hedi/41152.

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

Council of Science Editors:

Rouvelas P. Το πρόβλημα της συνέπειας για το αξιωματικό σύστημα NF. [Thesis]. Aristotle University Of Thessaloniki (AUTH); Αριστοτέλειο Πανεπιστήμιο Θεσσαλονίκης (ΑΠΘ); 2017. Available from: http://hdl.handle.net/10442/hedi/41152

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

29. Pablo Mayckon Silva Farias. A study about the origins of Mathematical Logic and the limits of its applicability to the formalization of Mathematics.

Degree: Master, 2007, Universidade Federal do Ceará

Este trabalho à um estudo sobre as origens da LÃgica MatemÃtica e os limites da sua aplicabilidade ao desenvolvimento formal da MatemÃtica. Primeiramente, à apresentada… (more)

Subjects/Keywords: LOGICA MATEMATICA; LÃgica MatemÃtica; Fundamentos da MatemÃtica; Teoremas de incompletude de GÃdel; Mathematical Logic; Foundations of Mathematics

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Farias, P. M. S. (2007). A study about the origins of Mathematical Logic and the limits of its applicability to the formalization of Mathematics. (Masters Thesis). Universidade Federal do Ceará. Retrieved from http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1516 ;

Chicago Manual of Style (16th Edition):

Farias, Pablo Mayckon Silva. “A study about the origins of Mathematical Logic and the limits of its applicability to the formalization of Mathematics.” 2007. Masters Thesis, Universidade Federal do Ceará. Accessed July 21, 2019. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1516 ;.

MLA Handbook (7th Edition):

Farias, Pablo Mayckon Silva. “A study about the origins of Mathematical Logic and the limits of its applicability to the formalization of Mathematics.” 2007. Web. 21 Jul 2019.

Vancouver:

Farias PMS. A study about the origins of Mathematical Logic and the limits of its applicability to the formalization of Mathematics. [Internet] [Masters thesis]. Universidade Federal do Ceará 2007. [cited 2019 Jul 21]. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1516 ;.

Council of Science Editors:

Farias PMS. A study about the origins of Mathematical Logic and the limits of its applicability to the formalization of Mathematics. [Masters Thesis]. Universidade Federal do Ceará 2007. Available from: http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1516 ;


University of Oxford

30. Elsner, Bernhard August Maurice. Presmooth geometries.

Degree: PhD, 2014, University of Oxford

 This thesis explores the geometric principles underlying many of the known Trichotomy Theorems. The main aims are to unify the field construction in non-linear o-minimal… (more)

Subjects/Keywords: 516.3; Mathematical logic and foundations; Mathematics; Model Theory; Zariski Geometries; Presmooth Geometries; Trichotomy Theorem; Zilber's Trichotomy

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Elsner, B. A. M. (2014). Presmooth geometries. (Doctoral Dissertation). University of Oxford. Retrieved from http://ora.ox.ac.uk/objects/uuid:b5d9ccfd-8360-4a2c-ad89-0b4f136c5a96 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618508

Chicago Manual of Style (16th Edition):

Elsner, Bernhard August Maurice. “Presmooth geometries.” 2014. Doctoral Dissertation, University of Oxford. Accessed July 21, 2019. http://ora.ox.ac.uk/objects/uuid:b5d9ccfd-8360-4a2c-ad89-0b4f136c5a96 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618508.

MLA Handbook (7th Edition):

Elsner, Bernhard August Maurice. “Presmooth geometries.” 2014. Web. 21 Jul 2019.

Vancouver:

Elsner BAM. Presmooth geometries. [Internet] [Doctoral dissertation]. University of Oxford; 2014. [cited 2019 Jul 21]. Available from: http://ora.ox.ac.uk/objects/uuid:b5d9ccfd-8360-4a2c-ad89-0b4f136c5a96 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618508.

Council of Science Editors:

Elsner BAM. Presmooth geometries. [Doctoral Dissertation]. University of Oxford; 2014. Available from: http://ora.ox.ac.uk/objects/uuid:b5d9ccfd-8360-4a2c-ad89-0b4f136c5a96 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.618508

[1] [2] [3]

.