Rozprawy doktorskie na temat „Mathematical Logic”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „Mathematical Logic”.
Przycisk „Dodaj do bibliografii” jest dostępny obok każdej pracy w bibliografii. Użyj go – a my automatycznie utworzymy odniesienie bibliograficzne do wybranej pracy w stylu cytowania, którego potrzebujesz: APA, MLA, Harvard, Chicago, Vancouver itp.
Możesz również pobrać pełny tekst publikacji naukowej w formacie „.pdf” i przeczytać adnotację do pracy online, jeśli odpowiednie parametry są dostępne w metadanych.
Przeglądaj rozprawy doktorskie z różnych dziedzin i twórz odpowiednie bibliografie.
Wedin, Hanna. "Mathematical Induction". Thesis, Uppsala universitet, Algebra och geometri, 2020. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-414099.
Pełny tekst źródłaMoreno, Dávila Julio Moreno Davila Julio. "Mathematical programming for logic inference /". [S.l.] : [s.n.], 1990. http://library.epfl.ch/theses/?nr=784.
Pełny tekst źródłaCerami, Marco. "Fuzzy Description Logics from a Mathematical Fuzzy Logic point of view". Doctoral thesis, Universitat de Barcelona, 2012. http://hdl.handle.net/10803/113374.
Pełny tekst źródłaEl trabajo desarrollado en esta tesis es una propuesta de sistematizar la formalización de las Lógicas de la Descripción Fuzzy a partir de la Lógica Difusa Matemática. Para ello se define un lenguaje para las Lógicas de la Descripción Fuzzy que extiende el lenguaje de la primera tradición de esta disciplina para adaptarlo al lenguaje más propio de la Lógica Difusa Matemática. Desde el punto de vista semántico, la teoría de conjuntos borrosos cede el paso a una semántica algebraica, que es la que se utiliza en la Lógica Difusa Matemática y que resuelve las consecuencias poco intuitivas que tenía la semántica tradicional. A partir de esta formalización, se tratan temas que eran tradicionales en las Lógicas de la Descripción clásicas como son las jerarquías de inclusiones entre lenguajes de la descripción y la relación de las Lógicas de la Descripción Fuzzy con la Lógica Difusa de primer orden por un lado y la Lógica Difusa Multi-modal por el otro. En relación a problemas de decidibilidad se demuestra que la satisfacción y la subsunción de conceptos en el lenguaje ALE bajo una semántica basada en la Lógica del Producto son problemas decidibles. También se demuestra que la consistencia de bases de conocimiento en el lenguaje ALC bajo una semántica basada en la Lógica de Lukasiewicz es un problema indecidible. En relación a problemas de complejidad computacional se demuestra que satisfacción y validez de fórmulas en la Lógica Modal minimal de Lukasiewicz con valores finitos son problemas PSPACE-completos. También se demuestra que la satisfacción y subsunción de conceptos en el lenguaje IALCED bajo una semántica basada en cualquier lógica difusa con valores finitos son problemas PSPACE-completos. Otra contribución de nuestro trabajo es el estudio sistemático de algoritmos de decisión para la satisfacción y subsunción de conceptos en el lenguaje IALCED, respecto a modelos “witnessed", basados en una reducción de es- tos problemas a los problemas de satisfacción y consecuencia en la lógica proposicional correspondiente.
Greer, Deirdre C. Silvern Steven B. "Logic-mathematical processes in beginning reading". Auburn, Ala., 2005. http://repo.lib.auburn.edu/2005%20Summer/doctoral/GREER_DEIRDRE_28.pdf.
Pełny tekst źródłaFriend, Michèle Indira. "Second-order logic is logic". Thesis, University of St Andrews, 1997. http://hdl.handle.net/10023/14753.
Pełny tekst źródłaCollazo, Antonio. "The Mathematical Landscape". Scholarship @ Claremont, 2011. http://scholarship.claremont.edu/cmc_theses/116.
Pełny tekst źródłaFors, Mikael. "Elementary Discrete Sets in Martin-Löf Type Theory". Thesis, Uppsala universitet, Algebra och geometri, 2012. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-175717.
Pełny tekst źródłaWiklund, Tilo. "Locally cartesian closed categories, coalgebras, and containers". Thesis, Uppsala universitet, Algebra och geometri, 2013. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-197556.
Pełny tekst źródłaYim, Austin Vincent. "On Galois correspondences in formal logic". Thesis, University of Oxford, 2012. http://ora.ox.ac.uk/objects/uuid:b47d1dda-8186-4c81-876c-359409f45b97.
Pełny tekst źródłaEliasson, Jonas. "Ultrasheaves". Doctoral thesis, Uppsala : Matematiska institutionen, Univ. [distributör], 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-3762.
Pełny tekst źródłaMay, Bruce Matthew. "Elementary Logic as a Tool in Proving Mathematical Statements". Thesis, University of the Western Cape, 2008. http://etd.uwc.ac.za/index.php?module=etd&action=viewtitle&id=gen8Srv25Nme4_1025_1263170321.
Pełny tekst źródłaThe findings of the study indicate that knowledge of logic does help to improve the ability of students to make logical connections (deductions) between and from
statements. The results of the study, however, do not indicate that knowledge and understanding of logic translates into improved proving ability of mathematical
statements by students.
Gorman, Judith A. "Aspects of coherent logic". Thesis, McGill University, 1987. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=63868.
Pełny tekst źródłaPurser, David Thurman. "A Leibnizian Approach to Mathematical Relationships: A New Look at Synthetic Judgments in Mathematics". University of Toledo / OhioLINK, 2010. http://rave.ohiolink.edu/etdc/view?acc_num=toledo1264612988.
Pełny tekst źródłaLevy, Bat-Sheva. "Fuzzy logic, a model to explain students' mathematical decision-making". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0026/MQ51391.pdf.
Pełny tekst źródłaMcDonald, Kevin. "Modelling multi-layered network and security architectures using mathematical logic". Thesis, University of Aberdeen, 2014. http://digitool.abdn.ac.uk:80/webclient/DeliveryManager?pid=214154.
Pełny tekst źródłaFarias, Pablo Mayckon Silva. "A study about the origins of Mathematical Logic and the limits of its applicability to the formalization of Mathematics". Universidade Federal do CearÃ, 2007. http://www.teses.ufc.br/tde_busca/arquivo.php?codArquivo=1516.
Pełny tekst źródłaEste 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 a teoria aritmÃtica de Dedekind, a primeira teoria a fornecer uma definiÃÃo precisa para os nÃmeros naturais e com base nela demonstrar todos os fatos comumente conhecidos a seu respeito. à tambÃm apresentada a axiomatizaÃÃo da AritmÃtica feita por Peano, que de certa forma simplificou a teoria de Dedekind. Em seguida, à apresentada a ome{german}{Begriffsschrift} de Frege, a linguagem formal que deu origem à LÃgica moderna, e nela sÃo representadas as definiÃÃes bÃsicas de Frege a respeito da noÃÃo de nÃmero. Posteriormente, à apresentado um resumo de questÃes importantes em fundamentos da MatemÃtica durante as primeiras trÃs dÃcadas do sÃculo XX, iniciando com os paradoxos na Teoria dos Conjuntos e terminando com a doutrina formalista de Hilbert. Por fim, sÃo apresentados, em linhas gerais, os teoremas de incompletude de GÃdel e o conceito de computabilidade de Turing, que apresentaram respostas precisas Ãs duas mais importantes questÃes do programa de Hilbert, a saber, uma prova direta de consistÃncia para a AritmÃtica e o problema da decisÃo, respectivamente.
This work is a study about the origins of Mathematical Logic and the limits of its applicability to the formal development of Mathematics. Firstly, Dedekindâs arithmetical theory is presented, which was the first theory to provide a precise definition for natural numbers and to demonstrate relying on it all facts commonly known about them. Peanoâs axiomatization for Arithmetic is also presented, which in a sense simplified Dedekindâs theory. Then, Fregeâs Begriffsschrift is presented, the formal language from which modern Logic originated, and in it are represented Fregeâs basic definitions concerning the notion of number. Afterwards, a summary of important topics on the foundations of Mathematics from the first three decades of the twentieth century is presented, beginning with the paradoxes in Set Theory and ending with Hilbertâs formalist doctrine. At last, are presented, in general terms, GÃdelâs incompleteness. theorems and Turingâs computability concept, which provided precise answers to the two most important points in Hilbertâs program, to wit, a direct proof of consistency for Arithmetic and the decision problem, respectively. Keywords: 1. Mathematical Logic 2. Foundations of Mathematics 3. GÃdelâs incompleteness theorems
Brierley, William. "Undecidability of intuitionistic theories". Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66016.
Pełny tekst źródłaBoskovitz, Agnes. "Data editing and logic : the covering set method from the perspective of logic /". View thesis entry in Australian Digital Theses, 2008. http://thesis.anu.edu.au/public/adt-ANU20080314.163155/index.html.
Pełny tekst źródłaLim, Jia Wei. "Parisian excursions of Brownian motion and their applications in mathematical finance". Thesis, London School of Economics and Political Science (University of London), 2013. http://etheses.lse.ac.uk/795/.
Pełny tekst źródłaFleury, Arnaud. "La règle d'échange : Logique linéaire multiplicative tressée". Paris 7, 1996. http://www.theses.fr/1996PA077055.
Pełny tekst źródłaBishop, Joyce Wolfer Otto Albert D. Lubinski Cheryl Ann. "Middle school students' understanding of mathematical patterns and their symbolic representations". Normal, Ill. Illinois State University, 1997. http://wwwlib.umi.com/cr/ilstu/fullcit?p9803721.
Pełny tekst źródłaTitle from title page screen, viewed June 1, 2006. Dissertation Committee: Albert D. Otto, Cheryl A. Lubinski (co-chairs), John A. Dossey, Cynthia W. Langrall, George Padavil. Includes bibliographical references (leaves 119-123) and abstract. Also available in print.
Trybus, Adam. "An axiom system for a spatial logic with convexity". Thesis, University of Manchester, 2012. https://www.research.manchester.ac.uk/portal/en/theses/an-axiom-system-for-a-spatial-logic-with-convexity(cd19b55f-b4e5-4782-90f2-d3c0ad79891b).html.
Pełny tekst źródłaYu, Chaoran. "A study on relational databases through mathematical theories of relations and logic". Virtual Press, 1988. http://liblink.bsu.edu/uhtbin/catkey/539627.
Pełny tekst źródłaDepartment of Computer Science
Revenko, Artem. "Automatic Construction of Implicative Theories for Mathematical Domains". Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-197794.
Pełny tekst źródłaQuine, W. V. "The logic of sequences a generalization of Principia mathematica /". New York : Garland Pub, 1990. http://catalog.hathitrust.org/api/volumes/oclc/20797392.html.
Pełny tekst źródłaPeron, Newton Marques 1982. "Logicas da inconsistencia deontica". [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/278895.
Pełny tekst źródłaDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas
Made available in DSpace on 2018-08-13T04:53:14Z (GMT). No. of bitstreams: 1 Peron_NewtonMarques_M.pdf: 601027 bytes, checksum: 5828adda31c6102b730941a14056d7d9 (MD5) Previous issue date: 2009
Resumo: Esse trabalho expõe brevemente o que são as Lógicas da Inconsistência Formal ¿Observação: O resumo, na íntegra poderá ser visualizado no texto completo da tese digital.
Abstract: This work expose briefly what are the Logics of Formal Inconsistency ...Note: The complete abstract is available with the full electronic digital thesis or dissertations.
Mestrado
Filosofia
Mestre em Filosofia
Baysal, Onur Alizde Rarail. "Lower-top and upper-bottom points for any formula in temporal logic/". [s.l.]: [s.n.], 2006. http://library.iyte.edu.tr/tezler/master/matematik/T000549.pdf.
Pełny tekst źródłaHorsfall, Benjamin Robert. "The logic of bunched implications : a memoir /". Connect to thesis, 2007. http://eprints.unimelb.edu.au/archive/00002633.
Pełny tekst źródłaRossberg, Marcus. "Second-order logic : ontological and epistemological problems". Thesis, University of St Andrews, 2006. http://hdl.handle.net/10023/6407.
Pełny tekst źródłaWeiss, Bernhard. "Intuitionistic semantics and the revision of logic". Thesis, University of St Andrews, 1992. http://hdl.handle.net/10023/14755.
Pełny tekst źródłaBlakely, Scott. "Probabilistic Analysis for Reliable Logic Circuits". PDXScholar, 2014. https://pdxscholar.library.pdx.edu/open_access_etds/1860.
Pełny tekst źródłaTabachnikova, Olga Markovna. "Fresh orderings of groups". Thesis, University of Bath, 1995. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.295448.
Pełny tekst źródłaDelaney, Aidan. "Defining star-free regular languages using diagrammatic logic". Thesis, University of Brighton, 2012. https://research.brighton.ac.uk/en/studentTheses/d1c53bda-f520-4807-9de9-8de12eda3d9e.
Pełny tekst źródłaLindroth, Olof. "A random formula lower bound for ordered DLL extended with local symmetry recognition /". Uppsala, 2004. http://www.math.uu.se/research/pub/Lindroth1.pdf.
Pełny tekst źródłaFarnsworth, Michael Arlington. "Improvements in the theory of confirmation as improvability by incorporating mathematical simplicity". Laramie, Wyo. : University of Wyoming, 2008. http://proquest.umi.com/pqdweb?did=1798480851&sid=1&Fmt=2&clientId=18949&RQT=309&VName=PQD.
Pełny tekst źródłaOliveira, Antonio Marmo da Cunha 1969. "Sistemas, pressuposições e implicaturas = uma investigação exploratória, lógica e filosófica". [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/279513.
Pełny tekst źródłaDissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas
Made available in DSpace on 2018-08-19T13:14:11Z (GMT). No. of bitstreams: 1 Oliveira_AntonioMarmodaCunha_M.pdf: 7643012 bytes, checksum: 1904b2b114fcf86253069cc0fe63eedb (MD5) Previous issue date: 2011
Resumo: Neste trabalho investigaremos, do ponto de vista da lógica e da filosofia, os fenômenos pragmáticos conhecidos como pressuposição e implicatura, relacionando-os a traços mais gerais da racionalidade humana, como economia e consistência, e ao pluralismo da lógica atual, incluindo alguns tópicos de contenda entre a tradição clássica e as propostas alternativas recentes. Grice articulou uma análise destes fenômenos assentes em princípios para a conversação ou interação entre entes racionais e cooperativos. Divergimos da tradição griceana, postulando que as implicaturas são processadas por "clivagem de informações", ou por verificação de outros critérios lógicos, ao invés da mera exploração de máximas. Partindo de conceitos precisamente definidos, como pressuposição e implicatura, é possível construir um arcabouço lógico, a denominar sistemas pressuposicionais, que estendem outros sistemas lógicos (como, por exemplo, o cálculo proposicional) e cujos resultados exporemos
Abstract: In this work we shall, from the logical and philosophical standpoint, investigate two pragmatic phenomena known as presupposition and implicature, associating them to more general features of human rationality, such as economy and consistency, and to the current logical pluralism, including some controversies between the classical tradition and more recent alternative approaches. Grice has articulated an analysis of such phenomena based on principles governing conversation or interaction between cooperative and rational beings. We dissent from the gricean tradition, and proposing that implicatures are processed by the 'sieving of information', rather than by the mere exploitation of maxims. By providing precise definitions to the concepts of presupposition and implicature, it is possible to build a logical framework, to be called presuppositional systems, which either extend or generalise other logical systems (such as the propositional calculus, for instance), the results of which we shall present hereinafter
Mestrado
Filosofia
Mestre em Filosofia
Kerber, Manfred. "On the representation of mathematical concepts and their translation into first-order logic /". Kaiserslautern : Univ., Fachbereich Informatik, 1992. http://kluedo.ub.uni-kl.de/volltexte/2000/336/.
Pełny tekst źródłaStrobach, Niko. "Alternativen in der Raumzeit eine Studie zur philosophischen Anwendung multimodaler Aussagenlogiken". Berlin Logos, 2007. http://deposit.d-nb.de/cgi-bin/dokserv?id=2907736&prov=M&dok_var=1&dok_ext=htm.
Pełny tekst źródłaCorfield, David Neil. "Research programmes, logic, and analogy : three aspects of mathematics and its development". Thesis, King's College London (University of London), 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.306938.
Pełny tekst źródłaLindman, Phillip A. (Phillip Anthony). "Intuition versus Formalization: Some Implications of Incompleteness on Mathematical Thought". Thesis, University of North Texas, 1994. https://digital.library.unt.edu/ark:/67531/metadc277970/.
Pełny tekst źródłaToninho, Bernardo Parente Coutinho Fernandes. "A Logic and tool for local reasoning about security protocols". Master's thesis, FCT - UNL, 2009. http://hdl.handle.net/10362/2307.
Pełny tekst źródłaThis thesis tackles the problem of developing a formal logic and associated model-checking techniques to verify security properties, and its integration in the Spatial Logic Model Checker(SLMC) tool. In the areas of distributed system design and analysis, there exists a substantial amount of work related to the verification of correctness properties of systems, in which the work aimed at the verification of security properties mostly relies on precise yet informal methods of reasoning. This work follows a line of research that applies formal methodologies to the verification of security properties in distributed systems, using formal tools originally developed for the study of concurrent and distributed systems in general. Over the years, several authors have proposed spatial logics for local and compositional reasoning about algebraic models of distributed systems known as process calculi. In this work, we present a simplification of a process calculus known as the Applied - calculus, introduced by Abadi and Fournet, designed for the study of security protocols. We then develop a spatial logic for this calculus, extended with knowledge modalities, aimed at reasoning about security protocols using the concept of local knowledge of processes. Furthermore, we conclude that the extensions are sound and complete regarding their intended semantics and that they preserve decidability, under reasonable assumptions. We also present a model-checking algorithm and the proof of its completeness for a large class of processes. Finally, we present an OCaml implementation of the algorithm, integrated in the Spatial Logic Model Checker tool, developed by Hugo Vieira and Luis Caires, thus producing the first tool for security protocol analysis that employs spatial logics.
趙炳權 i Ping-kuen Peter Chiu. "Primitive interval labelled net model for logic simulation". Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1991. http://hub.hku.hk/bib/B31232541.
Pełny tekst źródłaAkishev, Galym. "Monadic bounded algebras : a thesis submitted to the Victoria University of Wellington in fulfilment of the requirements for the degree of Doctor of Philosophy in Mathematics /". ResearchArchive@Victoria e-Thesis, 2009. http://hdl.handle.net/10063/915.
Pełny tekst źródłaFrench, Timothy Noel. "Bisimulation quantifiers for modal logics". University of Western Australia. School of Computer Science and Software Engineering, 2006. http://theses.library.uwa.edu.au/adt-WU2007.0013.
Pełny tekst źródłaAbraham, Tara Helen. "Microscopic cybernetics, mathematical logic, automata theory, and the formalization of biological phenomena, 1936-1970". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp02/NQ53763.pdf.
Pełny tekst źródłaHorng, Wen-Bing. "Using Extended Logic Programs to Formalize Commonsense Reasoning". Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc278054/.
Pełny tekst źródłaBrey, Amina. "Multiple representations and cognitive load: words, arrows, and colours when solving algebraic problems". Thesis, Nelson Mandela Metropolitan University, 2013. http://hdl.handle.net/10948/d1020392.
Pełny tekst źródłaD'Silva, Vijay Victor. "Logical abstract interpretation". Thesis, University of Oxford, 2013. http://ora.ox.ac.uk/objects/uuid:3648e579-01dc-4054-8290-31626d53b003.
Pełny tekst źródłaDavies, James Edgar. "Changes of Setting and the History of Mathematics: A New Study of Frege". Thesis, University of Canterbury. Mathematics & Statistics, 2010. http://hdl.handle.net/10092/4330.
Pełny tekst źródłaHamrin, Göran. "Effective Domains and Admissible Domain Representations". Doctoral thesis, Uppsala University, Department of Mathematics, 2005. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-5883.
Pełny tekst źródłaThis thesis consists of four papers in domain theory and a summary. The first two papers deal with the problem of defining effectivity for continuous cpos. The third and fourth paper present the new notion of an admissible domain representation, where a domain representation D of a space X is λ-admissible if, in principle, all other λ-based domain representations E of X can be reduced to X via a continuous function from E to D.
In Paper I we define a cartesian closed category of effective bifinite domains. We also investigate the method of inducing effectivity onto continuous cpos via projection pairs, resulting in a cartesian closed category of projections of effective bifinite domains.
In Paper II we introduce the notion of an almost algebraic basis for a continuous cpo, showing that there is a natural cartesian closed category of effective consistently complete continuous cpos with almost algebraic bases. We also generalise the notion of a complete set, used in Paper I to define the bifinite domains, and investigate what closure results that can be obtained.
In Paper III we consider admissible domain representations of topological spaces. We present a characterisation theorem of exactly when a topological space has a λ-admissible and κ-based domain representation. We also show that there is a natural cartesian closed category of countably based and countably admissible domain representations.
In Paper IV we consider admissible domain representations of convergence spaces, where a convergence space is a set X together with a convergence relation between nets on X and elements of X. We study in particular the new notion of weak κ-convergence spaces, which roughly means that the convergence relation satisfies a generalisation of the Kuratowski limit space axioms to cardinality κ. We show that the category of weak κ-convergence spaces is cartesian closed. We also show that the category of weak κ-convergence spaces that have a dense, λ-admissible, κ-continuous and α-based consistently complete domain representation is cartesian closed when α ≤ λ ≥ κ. As natural corollaries we obtain corresponding results for the associated category of weak convergence spaces.