Acceder

Bibliografías temáticas / Logic (symbolic and mathematical) / Tesis

Siga este enlace para ver otros tipos de publicaciones sobre el tema: Logic (symbolic and mathematical).

Tesis sobre el tema "Logic (symbolic and mathematical)"

Autor: Grafiati

Publicado: 4 de junio de 2021

Última modificación: 29 de julio de 2024

Crea una cita precisa en los estilos APA, MLA, Chicago, Harvard y otros

Elija tipo de fuente:

Consulte los 50 mejores tesis para su investigación sobre el tema "Logic (symbolic and mathematical)".

Junto a cada fuente en la lista de referencias hay un botón "Agregar a la bibliografía". Pulsa este botón, y generaremos automáticamente la referencia bibliográfica para la obra elegida en el estilo de cita que necesites: APA, MLA, Harvard, Vancouver, Chicago, etc.

También puede descargar el texto completo de la publicación académica en formato pdf y leer en línea su resumen siempre que esté disponible en los metadatos.

Explore tesis sobre una amplia variedad de disciplinas y organice su bibliografía correctamente.

1

Friend, Michèle Indira. "Second-order logic is logic." Thesis, University of St Andrews, 1997. http://hdl.handle.net/10023/14753.

Texto completo

Resumen

"Second-order logic" is the name given to a formal system. Some claim that the formal system is a logical system. Others claim that it is a mathematical system. In the thesis, I examine these claims in the light of some philosophical criteria which first motivated Frege in his logicist project. The criteria are that a logic should be universal, it should reflect our intuitive notion of logical validity, and it should be analytic. The analysis is interesting in two respects. One is conceptual: it gives us a purchase on where and how to draw a distinction between logic and other sciences. The ot

Los estilos APA, Harvard, Vancouver, ISO, etc.

2

Lindroth, 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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

3

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

4

Bishop, 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.

Texto completo

Resumen

Thesis (Ph. D.)--Illinois State University, 1997.<br>Title 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.

Los estilos APA, Harvard, Vancouver, ISO, etc.

5

Boskovitz, 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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

6

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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

7

Horsfall, Benjamin Robert. "The logic of bunched implications : a memoir /." Connect to thesis, 2007. http://eprints.unimelb.edu.au/archive/00002633.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

8

Rossberg, Marcus. "Second-order logic : ontological and epistemological problems." Thesis, University of St Andrews, 2006. http://hdl.handle.net/10023/6407.

Texto completo

Resumen

In this thesis I provide a survey over different approaches to second-order logic and its interpretation, and introduce a novel approach. Of special interest are the questions whether (a particular form of) second-order logic can count as logic in some (further to be specified) proper sense of logic, and what epistemic status it occupies. More specifically, second-order logic is sometimes taken to be mathematical, a mere notational variant of some fragment of set theory. If this is the case, it might be argued that it does not have the "epistemic innocence" which would be needed for,

Los estilos APA, Harvard, Vancouver, ISO, etc.

9

Weiss, Bernhard. "Intuitionistic semantics and the revision of logic." Thesis, University of St Andrews, 1992. http://hdl.handle.net/10023/14755.

Texto completo

Resumen

In this thesis I investigate the implications, for one's account of mathematics, of holding an anti-realist view. The primary aim is to appraise the scope of revision imposed by anti-realism on classical inferential practice in mathematics. That appraisal has consequences both for our understanding of the nature of mathematics and for our attitude towards anti-realism itself. If an anti-realist position seems inevitably to be absurdly revisionary then we have grounds for suspecting the coherence of arguments canvassed in favour of anti-realism. I attempt to defend the anti-realist position by

Los estilos APA, Harvard, Vancouver, ISO, etc.

10

Brierley, William. "Undecidability of intuitionistic theories." Thesis, McGill University, 1985. http://digitool.Library.McGill.CA:80/R/?func=dbin-jump-full&object_id=66016.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

11

Eliasson, Jonas. "Ultrasheaves." Doctoral thesis, Uppsala : Matematiska institutionen, Univ. [distributör], 2003. http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-3762.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

12

Lindman, 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/.

Texto completo

Resumen

This paper describes the tension between intuition about number theory and attempts to formalize it. I will first examine the root of the dilemma, Godel's First Incompleteness Theorem, which demonstrates that in any reasonable formalization of number theory, there will be independent statements. After proving the theorem, I consider some of its consequences on intuition, focusing on Freiling's "Dart Experiment" which is based on our usual notion of the real numbers as a line. This experiment gives an apparent refutation of the Axiom of Choice and the Continuum Hypothesis; however, it also lead

Los estilos APA, Harvard, Vancouver, ISO, etc.

13

French, 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.

Texto completo

Resumen

Modal logics have found applications in many diferent contexts. For example, epistemic modal logics can be used to reason about security protocols, temporal modal logics can be used to reason about the correctness of distributed systems and propositional dynamic logic can reason about the correctness of programs. However, pure modal logic is expressively weak and cannot represent many interesting secondorder properties that are expressible, for example, in the μ-calculus. Here we investigate the extension of modal logics with propositional quantification modulo bisimulation (bisimulation quant

Los estilos APA, Harvard, Vancouver, ISO, etc.

14

Yu, Chaoran. "A study on relational databases through mathematical theories of relations and logic." Virtual Press, 1988. http://liblink.bsu.edu/uhtbin/catkey/539627.

Texto completo

Resumen

The purpose of this study is to explore that mathematics provides a convenient formalism for studying classical database management system problems. There are two main parts in this study, devoted respectively to using mathematical theory of relations and using logical theory to study database management systems. In the first part we focus on relational model and relational algebra. The second part deals with the application of mathematical logic to database management systems, where logic may be used both as a inference system and as a representation language. The features and logical mechani

Los estilos APA, Harvard, Vancouver, ISO, etc.

15

Weydert, Emil. "How to approximate the naive comprehension scheme inside of classical logic." Bonn : [s.n.], 1989. http://catalog.hathitrust.org/api/volumes/oclc/19990751.html.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

16

Lavers, Peter Stanley. "Generating intensional logics : the application of paraconsistent logics to investigate certain areas of the boundaries of mathematics /." Title page, table of contents and summary only, 1985. http://web4.library.adelaide.edu.au/theses/09ARM/09arml399.pdf.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

17

Akishev, 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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

18

Wagner, Gerd. "Vivid logic : knowledge-based reasoning with two kinds of negation /." Berlin [u.a.] : Springer, 1994. http://www.loc.gov/catdir/enhancements/fy0815/93046747-d.html.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

19

Quine, 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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

20

湯志輝 and Chi-fai Tong. "On checking the temporal consistency of data." Thesis, The University of Hong Kong (Pokfulam, Hong Kong), 1993. http://hub.hku.hk/bib/B31211914.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

21

Tong, Chi-fai. "On checking the temporal consistency of data /." [Hong Kong : University of Hong Kong], 1993. http://sunzi.lib.hku.hk/hkuto/record.jsp?B13570353.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

22

Sharma, Richa. "Semi-automated approach to support logical formalism for requirements analysis and validation." Thesis, IIT Delhi, 2016. http://localhost:8080/xmlui/handle/12345678/7227.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

23

Hassani, Sarah Dossey John A. "Calculus students' knowledge of the composition of functions and the chain rule." Normal, Ill. Illinois State University, 1998. http://wwwlib.umi.com/cr/ilstu/fullcit?p9835906.

Texto completo

Resumen

Thesis (D.A.)--Illinois State University, 1998.<br>Title from title page screen, viewed July 3, 2006. Dissertation Committee: John A. Dossey (chair), Roger Day, Michael Marsali, Michael Plantholt. Includes bibliographical references (leaves 196-202) and abstract. Also available in print.

Los estilos APA, Harvard, Vancouver, ISO, etc.

24

Strobach, 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.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

25

Horng, Wen-Bing. "Using Extended Logic Programs to Formalize Commonsense Reasoning." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc278054/.

Texto completo

Resumen

In this dissertation, we investigate how commonsense reasoning can be formalized by using extended logic programs. In this investigation, we first use extended logic programs to formalize inheritance hierarchies with exceptions by adopting McCarthy's simple abnormality formalism to express uncertain knowledge. In our representation, not only credulous reasoning can be performed but also the ambiguity-blocking inheritance and the ambiguity-propagating inheritance in skeptical reasoning are simulated. In response to the anomalous extension problem, we explore and discover that the intuition unde

Los estilos APA, Harvard, Vancouver, ISO, etc.

26

Pemmaraju, Sriram V. "Modal logics of provability." Thesis, Virginia Tech, 1989. http://hdl.handle.net/10919/44652.

Texto completo

Resumen

<p>Gödel proved his Incompleteness theorems for any theory 'strong' enough to represent recursive functions. In the process he showed that the provability predicate can be represented in such theories. Modal logics of provability are modal logics which attempt to express the concept of 'provability' and 'consistency' using the modal operators '[]' and '<>' respectively. This is achieved by forcing '[]' to behave like the provability predicate. GL is a modal logic which has been shown to be complete and sound with respect to arithmetic theories (theories which can represent all recursive

Los estilos APA, Harvard, Vancouver, ISO, etc.

27

Loomis, Eric John. "Meaning, generality, and rules : language and logic in the later Wittgenstein /." Digital version accessible at:, 1999. http://wwwlib.umi.com/cr/utexas/main.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

28

Gat, Erann. "Reasoning about knowledge using extensional logics." Thesis, Virginia Polytechnic Institute and State University, 1987. http://hdl.handle.net/10919/90971.

Texto completo

Resumen

When representing statements about knowledge in an extensional logic, it occasionally happens that undesired conclusions arise. Such extraneous conclusions are often the result of substitution of equals for equals or existential instantiation within intensional operators such as Know. In the past, efforts at solving this problem have centered on modifications to the logic. In this thesis, I propose a solution that leaves the logic intact and changes the representation of the statements instead. The solution presented here has four main points: 1) Only propositions can be known. 2) Relations

Los estilos APA, Harvard, Vancouver, ISO, etc.

29

Munoz, Ricardo A. (Ricardo Alberto). "Using Normal Deduction Graphs in Common Sense Reasoning." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc277922/.

Texto completo

Resumen

This investigation proposes a powerful formalization of common sense knowledge based on function-free normal deduction graphs (NDGs) which form a powerful tool for deriving Horn and non-Horn clauses without functions. Such formalization allows common sense reasoning since it has the ability to handle not only negative but also incomplete information.

Los estilos APA, Harvard, Vancouver, ISO, etc.

30

Almeida, Edgar Luis Bezerra de 1976. "Lógicas abstratas e o primeiro teorema de Lindström." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/282036.

Texto completo

Resumen

Orientador: Itala Maria Loffredo D'Ottaviano<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas<br>Made available in DSpace on 2018-08-22T15:04:13Z (GMT). No. of bitstreams: 1 Almeida_EdgarLuisBezerrade_M.pdf: 946200 bytes, checksum: e8e316a3ee7420c8d7f45a751651a436 (MD5) Previous issue date: 2013<br>Resumo: Esta Dissertação apresenta uma definição de lógica abstrata e caracteriza alguns sistemas lógicos bastante conhecidos na literatura como casos particulares desta. Em especial, mostramos que a lógica de primeira ordem, lógica de segund

Los estilos APA, Harvard, Vancouver, ISO, etc.

31

Legge, Gaynor W. "A Mechanism for Facilitating Temporal Reasoning in Discrete Event Simulation." Thesis, University of North Texas, 1992. https://digital.library.unt.edu/ark:/67531/metadc278352/.

Texto completo

Resumen

This research establishes the feasibility and potential utility of a software mechanism which employs artificial intelligence techniques to enhance the capabilities of standard discrete event simulators. As background, current methods of integrating artificial intelligence with simulation and relevant research are briefly reviewed.

Los estilos APA, Harvard, Vancouver, ISO, etc.

32

Hamrin, 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.

Texto completo

Resumen

<p>This 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. </p><p>In Paper I we define a cartesian closed category of effective bifinite domains. We also investigate the method of inducing effectivity onto continuous cpos vi

Los estilos APA, Harvard, Vancouver, ISO, etc.

33

Schwartzkopff, Robert. "The numbers of the marketplace : commitment to numbers in natural language." Thesis, University of Oxford, 2015. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.711821.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

34

Secco, Érica Fernanda Aparecida [UNESP]. "Teoria de conjuntos fuzzy e aplicações." Universidade Estadual Paulista (UNESP), 2013. http://hdl.handle.net/11449/94362.

Texto completo

Resumen

Made available in DSpace on 2014-06-11T19:27:10Z (GMT). No. of bitstreams: 0 Previous issue date: 2013-12-16Bitstream added on 2014-06-13T20:08:10Z : No. of bitstreams: 1 000734174.pdf: 1301603 bytes, checksum: c022c2b4e049a701b1abb5a9e04fe8e9 (MD5)<br>Neste traboalho são apresentados alguns conceitos básicos da Teoria de Conjuntos Fuzzy como: operações comu conjunto fuzzy, Princípio de Extensão de Zadeh, números fuzzy e noçoes de lógica fuzzy. As relações são apresentadas com o objetivo de tratarmos de sistemas baseados em regras fuzzy e algumas aplicações<br>In this paper are presented som

Los estilos APA, Harvard, Vancouver, ISO, etc.

35

Lannin, John K. Langrall Cynthia Willey. "Developing middle school students' understanding of recursive and explicit reasoning." Normal, Ill. Illinois State University, 2001. http://wwwlib.umi.com/cr/ilstu/fullcit?p3006621.

Texto completo

Resumen

Thesis (Ph. D.)--Illinois State University, 2001.<br>Title from title page screen, viewed April 25, 2006. Dissertation Committee: Cynthia W. Langrall (Chair), Graham A. Jones, Tami S. Martin, Patricia H. Klass. Includes bibliographical references (leaves 138-146) and abstract. Also available in print.

Los estilos APA, Harvard, Vancouver, ISO, etc.

36

Batista, Neto Alberto Leopoldo. "Representação e combinação de logicas : questões conceituais." [s.n.], 2007. http://repositorio.unicamp.br/jspui/handle/REPOSIP/278894.

Texto completo

Resumen

Orientador: Marcelo Esteban Coniglio<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas<br>Made available in DSpace on 2018-08-10T04:02:35Z (GMT). No. of bitstreams: 1 BatistaNeto_AlbertoLeopoldo_M.pdf: 764702 bytes, checksum: 38e943aef1a6e4a5f892916208eca7a5 (MD5) Previous issue date: 2007<br>Resumo: Visando a atingir um esclarecimento sobre os conceitos fundamentais envolvidos no estudo das combinações entre lógicas, empreendemos uma alise do problema da representação geral de sistemas lógicos (com ênfase no conceito central de conseqüê

Los estilos APA, Harvard, Vancouver, ISO, etc.

37

Tabada, Winston M. "An analysis and implementation of linear derivation strategies." Thesis, Edith Cowan University, Research Online, Perth, Western Australia, 1991. https://ro.ecu.edu.au/theses/1125.

Texto completo

Resumen

This study examines the efficacy of six linear derivation strategies: (i) s-linear resolution, (ii) the ME procedure; (iii) t-linear resolution, (iv) SL -resolution, (v) the GC procedure, and (vi) SLM. The analysis is focused on the different restrictions and operations employed in each derivation strategy. The selection function, restrictive ancestor resolution, compulsory ancestor resolution on literals having atoms which are or become identical, compulsory merging operations, reuse of truncated literals, spreading of FALSE literals, no-tautologies resection, no two non-B-literals having ide

Los estilos APA, Harvard, Vancouver, ISO, etc.

38

Konecny, Jan. "Isotone fuzzy Galois connections and their applications in formal concept analysis." Diss., Online access via UMI:, 2009.

Buscar texto completo

Resumen

Thesis (Ph. D.)--State University of New York at Binghamton, Thomas J. Watson School of Engineering and Applied Science, Department of Systems Science and Industrial Engineering, 2009.<br>Includes bibliographical references.

Los estilos APA, Harvard, Vancouver, ISO, etc.

39

Bueno-Soler, Juliana 1976. "Multimodalidades anodicas e catodicas : a negação controlada em logicas multimodais e seu poder expressivo." [s.n.], 2009. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280387.

Texto completo

Resumen

Orientador: Itala Maria Loffredo D'Ottaviano<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas<br>Made available in DSpace on 2018-09-11T21:14:41Z (GMT). No. of bitstreams: 1 Bueno-Soler_Juliana_D.pdf: 1230879 bytes, checksum: c04ce9e8061c154854f6283749f9c12b (MD5) Previous issue date: 2009<br>Resumo: O presente trabalho tem por objetivo investigar o papel da negação no âmbito das modalidades, de forma a poder esclarecer até que ponto a negação pode ser atenuada, controlada ou mesmo totalmente eliminada em favor da melhor expressabilidade lógi

Los estilos APA, Harvard, Vancouver, ISO, etc.

40

Lawley, Michael John, and n/a. "Program Transformation for Proving Database Transaction Safety." Griffith University. School of Computing and Information Technology, 2000. http://www4.gu.edu.au:8080/adt-root/public/adt-QGU20070228.150125.

Texto completo

Resumen

In this thesis we propose the use of Dijkstra's concept of a predicate transformer [Dij75] for the determination of database transaction safety [SS89] and the generation of simple conditions to check that a transaction will not violate the integrity constraints in the case that it is not safe. The generation of this simple condition is something that can be done statically, thus providing a mechanism for generating safe transactions. Our approach treats a database as state, a database transaction as a program, and the database's integrity constraints as a postcondition in order to use a predic

Los estilos APA, Harvard, Vancouver, ISO, etc.

41

Paddock, Jeff. "Informed by silence." Thesis, National Library of Canada = Bibliothèque nationale du Canada, 2000. http://www.collectionscanada.ca/obj/s4/f2/dsk2/ftp03/MQ62412.pdf.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

42

Lawley, Michael John. "Program Transformation for Proving Database Transaction Safety." Thesis, Griffith University, 2000. http://hdl.handle.net/10072/365511.

Texto completo

Resumen

In this thesis we propose the use of Dijkstra's concept of a predicate transformer [Dij75] for the determination of database transaction safety [SS89] and the generation of simple conditions to check that a transaction will not violate the integrity constraints in the case that it is not safe. The generation of this simple condition is something that can be done statically, thus providing a mechanism for generating safe transactions. Our approach treats a database as state, a database transaction as a program, and the database's integrity constraints as a postcondition in order to use a predic

Los estilos APA, Harvard, Vancouver, ISO, etc.

43

Brinkerhoff, Jennifer Alder. "Applying Toulmin's Argumentation Framework to Explanations in a Reform Oriented Mathematics Class." Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1960.pdf.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

44

Duff, Karen Malina. "What Are Some of the Common Traits in the Thought Processes of Undergraduate Students Capable of Creating Proof?" Diss., CLICK HERE for online access, 2007. http://contentdm.lib.byu.edu/ETD/image/etd1856.pdf.

Texto completo

Los estilos APA, Harvard, Vancouver, ISO, etc.

45

Alves, Marcos Antonio 1975. "Lógica e Informação : uma análise da consequência lógica a partir de uma perspectiva quantitativa da informação." [s.n.], 2012. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280390.

Texto completo

Resumen

Orientador: Ítala Maria Loffredo D'Ottaviano<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas<br>Made available in DSpace on 2018-08-21T17:22:51Z (GMT). No. of bitstreams: 1 Alves_MarcosAntonio_D.pdf: 1540719 bytes, checksum: ef2df1bb686bd9200a4eb2597ab54495 (MD5) Previous issue date: 2012<br>Resumo: Nosso objetivo nesta Tese é desenvolver uma definição da consequência lógica a partir de uma perspectiva quantitativa da informação. O trabalho pode ser dividido em duas partes. Na primeira, que consiste dos três capítulos iniciais, fazemos um es

Los estilos APA, Harvard, Vancouver, ISO, etc.

46

Suguitani, Leandro Oliva 1976. "Sobre a lógica e a aritmética das relações." [s.n.], 2013. http://repositorio.unicamp.br/jspui/handle/REPOSIP/280386.

Texto completo

Resumen

Orientador: Itala Maria Loffredo D'Ottaviano<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas<br>Made available in DSpace on 2018-08-24T01:21:05Z (GMT). No. of bitstreams: 1 Suguitani_LeandroOliva_D.pdf: 1496205 bytes, checksum: 6197787056972a0020750fa2c72c9cd6 (MD5) Previous issue date: 2013<br>Resumo: O resumo poderá ser visualizado no texto completo da tese digital<br>Abstract: The complete abstract is available with the full electronic document.<br>Doutorado<br>Filosofia<br>Doutor em Filosofia

Los estilos APA, Harvard, Vancouver, ISO, etc.

47

Rodrigues, Tarcísio Genaro. "Sobre os fundamentos de programação lógica paraconsistente." [s.n.], 2010. http://repositorio.unicamp.br/jspui/handle/REPOSIP/278897.

Texto completo

Resumen

Orientador: Marcelo Esteban Coniglio<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas<br>Made available in DSpace on 2018-08-17T03:29:03Z (GMT). No. of bitstreams: 1 Rodrigues_TarcisioGenaro_M.pdf: 1141020 bytes, checksum: 59bb8a3ae7377c05cf6a8d8e6f7e45a5 (MD5) Previous issue date: 2010<br>Resumo: A Programação Lógica nasce da interação entre a Lógica e os fundamentos da Ciência da Computação: teorias de primeira ordem podem ser interpretadas como programas de computador. A Programação Lógica tem sido extensamente utilizada em ramos da

Los estilos APA, Harvard, Vancouver, ISO, etc.

48

Reis, Teofilo de Souza. "Conectivos flexíveis : uma abordagem categorial às semânticas de traduções possíveis." [s.n.], 2008. http://repositorio.unicamp.br/jspui/handle/REPOSIP/278896.

Texto completo

Resumen

Orientador: Marcelo Esteban Coniglio<br>Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciencias Humanas<br>Made available in DSpace on 2018-08-11T21:55:18Z (GMT). No. of bitstreams: 1 Reis_TeofilodeSouza_M.pdf: 733611 bytes, checksum: 0e64d330d9e71079eddd94de91f141c2 (MD5) Previous issue date: 2008<br>Resumo: Neste trabalho apresentamos um novo formalismo de decomposição de Lógicas, as Coberturas por Traduções Possíveis, ou simplesmente CTPs. As CTPs constituem uma versão formal das Semânticas de Traduções Possíveis, introduzidas por W. Carnielli em 1990

Los estilos APA, Harvard, Vancouver, ISO, etc.

49

Araújo, Anderson. "Uma abordagem modelo-teórica da computabilidade de Turing clássica." [s.n.], 2011. http://repositorio.unicamp.br/jspui/handle/REPOSIP/281062.

Texto completo

Resumen

Orientador: Walter Alexandre Carnielli<br>Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas<br>Made available in DSpace on 2018-08-17T17:02:46Z (GMT). No. of bitstreams: 1 Araujo_Anderson_D.pdf: 1286485 bytes, checksum: 1e51db7a5721f4affeaf8f512d23269e (MD5) Previous issue date: 2011<br>Resumo: Esta tese propõe uma nova abordagem da computabilidade de Turing clássica, denominada abordagem modelo-teórica. De acordo com essa abordagem, estruturas e teorias são associadas às máquinas de Turing a fim de investigar as características de suas computaçõ

Los estilos APA, Harvard, Vancouver, ISO, etc.

50

Secco, Érica Fernanda Aparecida. "Teoria de conjuntos fuzzy e aplicações /." Rio Claro, 2013. http://hdl.handle.net/11449/94362.

Texto completo

Resumen

Orientador: Renata Zotin Gomes de Oliveira<br>Banca: Elaine Cristina Catapani Poletti<br>Banca: Wladimir Seixas<br>Resumo: Neste traboalho são apresentados alguns conceitos básicos da Teoria de Conjuntos Fuzzy como: operações comu conjunto fuzzy, Princípio de Extensão de Zadeh, números fuzzy e noçoes de lógica fuzzy. As relações são apresentadas com o objetivo de tratarmos de sistemas baseados em regras fuzzy e algumas aplicações<br>Abstract: In this paper are presented some basic concepts of Fuzzy Sets Theory: operation with fuzzy sets, Zadeh extension principle, fuzzy numbers and fuzzy logic

Los estilos APA, Harvard, Vancouver, ISO, etc.

Ofrecemos descuentos en todos los planes premium para autores cuyas obras están incluidas en selecciones literarias temáticas. ¡Contáctenos para obtener un código promocional único!