Rozprawy doktorskie na temat „Logic”
Utwórz poprawne odniesienie w stylach APA, MLA, Chicago, Harvard i wielu innych
Sprawdź 50 najlepszych rozpraw doktorskich naukowych na temat „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.
Zhu, Biao. "Logic programming framework for resolution logics". Thesis, National Library of Canada = Bibliothèque nationale du Canada, 1999. http://www.collectionscanada.ca/obj/s4/f2/dsk1/tape7/PQDD_0006/MQ43411.pdf.
Pełny tekst źródłaRabe, Florian [Verfasser]. "Representing logics and logic translations / Florian Rabe". Bremen : IRC-Library, Information Resource Center der Jacobs University Bremen, 2009. http://d-nb.info/103498439X/34.
Pełny tekst źródłaMezzadri, Daniele. "Language and logic in Wittgenstein's Tractatus Logico-Philosophicus". Thesis, University of Stirling, 2010. http://hdl.handle.net/1893/2432.
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łaNguyen, Loc Bao. "Logic design using programmable logic devices". PDXScholar, 1988. https://pdxscholar.library.pdx.edu/open_access_etds/4103.
Pełny tekst źródłaSack, Joshua. "Adding temporal logic to dynamic epistemic logic". [Bloomington, Ind.] : Indiana University, 2007. http://gateway.proquest.com/openurl?url_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:dissertation&res_dat=xri:pqdiss&rft_dat=xri:pqdiss:3274928.
Pełny tekst źródłaSource: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4531. Adviser: Lawrence Moss. Title from dissertation home page (viewed Apr. 22, 2008).
Veen, Maria Helena van der. "[Pi]-Logic". [S.l. : Groningen : s.n. ; University Library Groningen] [Host], 2006. http://irs.ub.rug.nl/ppn/293902518.
Pełny tekst źródłaMerrison, Joanne. "Coleridge's logic". Thesis, University of East Anglia, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316092.
Pełny tekst źródłaWheelhouse, Mark James. "Segment logic". Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/10473.
Pełny tekst źródłaRoşu, Grigore. "Hidden logic /". Diss., Connect to a 24 p. preview or request complete full text in PDF format. Access restricted to UC campuses, 2000. http://wwwlib.umi.com/cr/ucsd/fullcit?p9979966.
Pełny tekst źródłaThalmann, Lars. "Term-modal logic and quantifier-free dynamic assignment logic". Doctoral thesis, Uppsala : Institutionen för informationsteknologi, Univ. [distributör], 2000. http://publications.uu.se/theses/91-506-1443-6/.
Pełny tekst źródłaWeidner, Thomas. "Probabilistic Logic, Probabilistic Regular Expressions, and Constraint Temporal Logic". Doctoral thesis, Universitätsbibliothek Leipzig, 2016. http://nbn-resolving.de/urn:nbn:de:bsz:15-qucosa-208732.
Pełny tekst źródłaAlbuquerque, Hugo Cardoso. "Operators and strong versions of sentential logics in Abstract Algebraic Logic". Doctoral thesis, Universitat de Barcelona, 2016. http://hdl.handle.net/10803/394003.
Pełny tekst źródłaAquesta dissertació presenta els resultats de la nostra recerca sobre alguns temes recents en Lògica Algebraica Abstracta (LAA), concretament, l'operador de Suszko, els filtres de Leibniz, i les lògiques truth-equacionals. La interacció entre vàries nocións relacionades amb els operadors de Leibniz i de Suszko ens va portar a considerar un marc general basat en la noció de S-operador, que abasta els operadors de Leibniz, de Suszko, i de Frege, unificant així aquests tres operadors paradigmàtics de la LAA sota un mateix tractament.
Cerami, 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.
Chen, Guiming. "Fuzzy FOIL: A fuzzy logic based inductive logic programming system". Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/9621.
Pełny tekst źródłaKozlowski, Tomasz. "Application of exclusive-OR logic in technology independent logic optimisation". Thesis, University of Bristol, 1996. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.296702.
Pełny tekst źródłaObeid, Naji. "MIM-Logic : a logic for reasoning about molecular interaction maps". Toulouse 3, 2014. http://thesesups.ups-tlse.fr/2527/.
Pełny tekst źródłaThe series of biochemical reactions that occur within a cell form what we call Metabolic Pathways. Most of them can be quite intricate and involve many proteins and enzymes. Logical representations of such networks can help reason about them in general, where the reasoning can range from answering some queries, to completing missing nodes and arcs, and finding inconsistencies. This work proposes a new logical model based on a fragment of first-order logic capable of describing reactions that appear in a Molecular Interaction Maps. We also propose an efficient automated deduction method that can answer queries by deduction to predict reaction results or by abductive reasoning to find reactions and protein states. This automated deduction method is based on a translation procedure that transforms first-order formulas into quantifier free formulas
Martinelli, Giovanni <1995>. "Transition from Goods-dominant logic to the Service-dominant logic". Master's Degree Thesis, Università Ca' Foscari Venezia, 2021. http://hdl.handle.net/10579/18756.
Pełny tekst źródłaDrescher, Conrad. "Action Logic Programs". Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-68252.
Pełny tekst źródłaWansing, Heinrich. "Displaying modal logic /". Dordrecht [u.a.] : Kluwer, 1998. http://www.gbv.de/dms/ilmenau/toc/24662969X.PDF.
Pełny tekst źródłaMcPhee, Richard. "Compositional logic programming". Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393413.
Pełny tekst źródłaMathiesen, Erik Arne. "Abstract hoare logic". Thesis, Queen Mary, University of London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.497518.
Pełny tekst źródłaToni, Francesca. "Abductive logic programming". Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.490558.
Pełny tekst źródłaMcClenaghan, Nathan David. "Molecular logic systems". Thesis, Queen's University Belfast, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.314084.
Pełny tekst źródłaCOSTA, VASTON GONCALVES DA. "LOGIC PROOFS COMPACTATION". PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIRO, 2007. http://www.maxwell.vrac.puc-rio.br/Busca_etds.php?strSecao=resultado&nrSeq=10018@1.
Pełny tekst źródłaCONSELHO NACIONAL DE DESENVOLVIMENTO CIENTÍFICO E TECNOLÓGICO
É um fato conhecido que provas clássicas podem ser demasiadamente grandes. Estudos em teoria da prova descobriram diferenças exponenciais entre provas normais (ou provas livres do corte) e suas respectivas provas não normais. Por outro lado, provadores automáticos de teorema usualmente se baseiam na construção de provas normais, livres de corte ou provas de corte atômico, pois tais procedimento envolvem menos escolhas. Provas de algumas tautologias são conhecidamente grandes quanto realizadas sem a regra do corte e curtas quando a utilizam. Queremos com este trabalho apresentar procedimentos para reduzir o tamanho de provas proposicionais. Neste sentido, apresentamos dois métodos. O primeiro, denominado método vertical, faz uso de axiomas de extensão e alguns casos é possível uma redução considerável no tamanho da prova. Apresentamos um procedimento que gera tais axiomas de extensão. O segundo, denominado método horizontal, adiciona fórmulas máximas por meio de unificação via substituição de variáveis proposicionais. Também apresentamos um método que gera tal unificação durante o processo de construção da prova. O primeiro método é aplicado a dedução natural enquanto o segundo à Dedução Natural e Cálculo de Seqüentes. As provas produzidas correspondem de certo modo a provas não normais (com a regra do corte).
It is well-known that the size of propositional classical proofs can be huge. Proof theoretical studies discovered exponential gaps between normal or cut-free proofs and their respective non-normal proofs. The task of automatic theorem proving is, on the other hand, usually based on the construction of normal, cut-free or only-atomic-cuts proofs, since this procedure produces less alternative choices. There are familiar tautologies such that the cut-free proof is huge while the non-cut-free is small. The aim of this work is to reduce the weight of proposicional deductions. In this sense we present two methods. The fi first, namely vertical method, uses the extension axioms. We present a method that generates a such extension axiom. The second, namely horizontal method, adds suitable (propositional) unifi fications modulo variable substitutions.We also present a method that generates a such unifi fication during the proving process. The proofs produced correspond in a certain way to non normal proofs (non cut-free proofs).
Koskela, Suvi Jonna Mikaela. "Molecular logic gates". Thesis, University of Bath, 2003. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760841.
Pełny tekst źródłaHeck, Richard Gustave. "Logic, semantics, ontology". Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13940.
Pełny tekst źródłaVita.
Includes bibliographical references (leaves 195-197).
by Richard Gustave Heck, Jr.
Ph.D.
Dalrymple, David Allen. "Asynchronous logic automata". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44914.
Pełny tekst źródłaThis electronic version was submitted by the student author. The certified thesis is available in the Institute Archives and Special Collections.
Includes bibliographical references (p. 89-92).
Numerous applications, from high-performance scientific computing to large, high-resolution multi-touch interfaces to strong artificial intelligence, push the practical physical limits of modern computers. Typical computers attempt to hide the physics as much as possible, running software composed of a series of instructions drawn from an arbitrary set to be executed upon data that can be accessed uniformly. However, we submit that by exposing, rather than hiding, the density and velocity of information and the spatially concurrent, asynchronous nature of logic, scaling down in size and up in complexity becomes significantly easier. In particular, we introduce "asynchronous logic automata", which are a specialization of both asynchronous cellular automata and Petri nets, and include Boolean logic primitives in each cell. We also show some example algorithms, means to create circuits, potential hardware implementations, and comparisons to similar models in past practice.
by David Allen Dalrymple.
S.M.
Prakash, Manu. "Microfluidic bubble logic". Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/46593.
Pełny tekst źródła"September 2008."
Includes bibliographical references.
In this thesis, I propose a new paradigm in computing where bits can simultaneously transport and manipulate materials and information. Information representation is invariably physical. Though this insight is fundamental to understanding the physical limits of computation, it has never been exploited as a scheme for material manipulation. Bringing together notions from computer science and fluid dynamics, I present a new logic family "Bubble Logic" capable of both universal computation and programmable material manipulation in an all-fluidic two-phase system. This removes the distinction between materials and mechanisms to control them, bringing the programmability of the digital world into the physical world - with a wide range of promising applications in biotechnology, highthroughput screening, genomics and fluidic control systems for soft robotics, printing and digital fabrication.Microfluidics, the art of handling nano-to pico-liter volume fluids, is leading to a revolution in large-scale automation of biology and analytical chemistry. However, current lab-on-chip technologies are dependent on external macro-scale control elements, thus requiring a lab to run the chip. Bubble logic provides a dropletel,internal, inherently digital flow control mechanism at kHz frequencies with no moving parts or off-chip components. Nonlinearity is introduced in an otherwise linear, reversible, low Reynolds number flow via bubble-tobubble hydrodynamic interactions. I demonstrate bubble logic AND/OR/NOT gates, a toggle flip-flop, a ripple counter, a timing restoration device, a ring oscillator, a bistable valve and an on-demand bubble generator. These show the nonlinearity, gain, bistability, synchronization, cascadability, feedback and programmability required for scalable universal computation and control.
(cont.) The representation used in this thesis makes possible encapsulation and manipulation of a large variety of micro-to nanocale materials including single molecules like DNA or proteins, live cells, liquid crystals, nano-particles and other biological and chemical reagents. Bubble logic provides a scheme to transport, store and operate on this new class of "digital materials" in an integrated, high-throughput fashion. Furthermore, microfluidics has also been extensively employed in biological systems. This thesis describes the discovery of two new physical fluid dynamic mechanisms motivated by a common theme of microfluidics in biology. Firstly, I describe a new superhydrophobic waterrepelling surface that has a characteristic of directional anisotropy to fluid resistance. The discovery, made while studying the integument of water-walking insects, helps rationalize the origin of thrust and hence propulsion of water-walking insects on a fluid interface. Secondly, this thesis uncovers a new physical mechanism for directed droplet transport, which I term "Capillary ratchet". Discovered in a class of surface feeding shorebirds, it is the only physical mechanism that is known to exploit contact angle hysteresis for fluid transport. Capillary ratchet is a promising candidate for implementing global clocking for integrated microfluidic devices.
by Manu Prakash.
Ph.D.
Wright, Adam. "Structural separation logic". Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/17838.
Pełny tekst źródłaBader, Antoine. "DNA-based logic". Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/31065.
Pełny tekst źródłaRedmond, Walter. "Logic, Duty, Virtue". Pontificia Universidad Católica del Perú - Departamento de Humanidades, 2013. http://repositorio.pucp.edu.pe/index/handle/123456789/112991.
Pełny tekst źródłaLa lógica deóntica. la lógica de la ética, es aplicable a varias teorías morales, por ejemplo a las fundamentadas en la concepción de la virtud o en la del deber. Un cuadrado de oposición al estilo escolástico puede servir para exhibir las relaciones lógicas entre tales nociones morales u operadores como debe y puede. El sistema puede construirse sobre la base de un solo operador y luego otros pueden agregarse para indicar una correspondencia con otras expresiones del lenguaje ordinario. Se ofrecen dos principios para aclarar la super erogación.el caso del acto o hábito bueno no obligatorio. y para proponer una lógica básica de la virtud.
Barbosa, Fábio Daniel Moreira. "Probabilistic propositional logic". Master's thesis, Universidade de Aveiro, 2016. http://hdl.handle.net/10773/22198.
Pełny tekst źródłaO termo Lógica Probabilística, em geral, designa qualquer lógica que incorpore conceitos probabilísticos num sistema lógico formal. Nesta dissertacção o principal foco de estudo e uma lógica probabilística (designada por Lógica Proposicional Probabilística Exógena), que tem por base a Lógica Proposicional Clássica. São trabalhados sobre essa lógica probabilística a síntaxe, a semântica e um cálculo de Hilbert, provando-se diversos resultados clássicos de Teoria de Probabilidade no contexto da EPPL. São também estudadas duas propriedades muito importantes de um sistema lógico - correcção e completude. Prova-se a correcção da EPPL da forma usual, e a completude fraca recorrendo a um algoritmo de satisfazibilidade de uma fórmula da EPPL. Serão também considerados na EPPL conceitos de outras lógicas probabilísticas (incerteza e probabilidades intervalares) e Teoria de Probabilidades (condicionais e independência).
The term Probabilistic Logic generally refers to any logic that incorporates probabilistic concepts in a formal logic system. In this dissertation, the main focus of study is a probabilistic logic (called Exogenous Probabilistic Propo- sitional Logic), which is based in the Classical Propositional Logic. There will be introduced, for this probabilistic logic, its syntax, semantics and a Hilbert calculus, proving some classical results of Probability Theory in the context of EPPL. Moreover, there will also be studied two important properties of a logic system - soundness and completeness. We prove the EPPL soundness in a standard way, and weak completeness using a satis ability algorithm for a formula of EPPL. It will be considered in EPPL concepts of other probabilistic logics (uncertainty and intervalar probability) and of Probability Theory (independence and conditional).
Coleman, Neil Edward. "Logic as modelling". Thesis, University of Bristol, 2015. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.702219.
Pełny tekst źródłaGiesecke, Normen. "Ternary quantum logic". PDXScholar, 2006. https://pdxscholar.library.pdx.edu/open_access_etds/4092.
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łaXu, Leeka. "Synthesis and optimisation of combinational logic using universal logic module networks". Thesis, Edinburgh Napier University, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.295379.
Pełny tekst źródłaTibbits, Skylar J. E. "Logic matter : digital logic as heuristics for physical self-guided-assembly". Thesis, Massachusetts Institute of Technology, 2010. http://hdl.handle.net/1721.1/64566.
Pełny tekst źródłaCataloged from PDF version of thesis.
Includes bibliographical references (p. 123-124).
Given the increasing complexity of the physical structures surrounding our everyday environment -- buildings, machines, computers and almost every other physical object that humans interact with -- the processes of assembling these complex structures are inevitably caught in a battle of time, complexity and human/machine processing power. If we are to keep up with this exponential growth in construction complexity we need to develop automated assembly logic embedded within our material parts to aid in construction. In this thesis I introduce Logic Matter as a system of passive mechanical digital logic modules for self-guided-assembly of large-scale structures. As opposed to current systems in self-reconfigurable robotics, Logic Matter introduces scalability, robustness, redundancy and local heuristics to achieve passive assembly. I propose a mechanical module that implements digital NAND logic as an effective tool for encoding local and global assembly sequences. I then show a physical prototype that successfully demonstrates the described mechanics, encoded information and passive self-guided-assembly. Finally, I show exciting potentials of Logic Matter as a new system of computing with applications in space/volume filling, surface construction, and 3D circuit assembly.
by Skylar J.E. Tibbits.
S.M.
Lin, Dianhuan. "Logic programs as declarative and procedural bias in inductive logic programming". Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/24553.
Pełny tekst źródłaTall, Aliou. "From mathematics in logic to logic in mathematics : Boole and Frege". Thesis, University of York, 2002. http://etheses.whiterose.ac.uk/14163/.
Pełny tekst źródłaCelani, Laura. "Logic in theory and in practice : the normative status of logic". Thesis, University of St Andrews, 2015. http://hdl.handle.net/10023/6329.
Pełny tekst źródłaGenito, Daniele. "Some topics in fuzzy logic". Doctoral thesis, Universita degli studi di Salerno, 2010. http://hdl.handle.net/10556/113.
Pełny tekst źródłaSi trattano diversi aspetti della logica fuzzy, in particolare: 1) le proprietà preservate da un modello fuzzy ogniqualvolta esso è sottoposto a qualche genere di modifica; 2) la programmazione logica fuzzy, la logica della similarità e la metaprogrammazione, considerando la relazione di sinonimia tra predicati; 3) la connessione tra logica fuzzy e teoria dei bireticoli per il trattamento sia della verità che del grado di informazione.
VIII n.s.
Oliveira, 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
Hawley, Derik. "Logic in pictures : an examination of diagrammatic representations, graph theory amd logic /". Waterloo, Ont. : University of Waterloo [Dept. of Philosophy], 1994. http://etd.uwaterloo.ca/etd/dhawley1994.pdf.
Pełny tekst źródłaIncludes bibliographical references (p. 51). Issued also in PDF format and available via the World Wide Web. Requires Internet connectivity, World Wide Web browser, and Adobe Acrobat Reader.
Hawley, Derik. "Logic in Pictures: An Examination of Diagrammatic Representations, Graph Theory and Logic". Thesis, University of Waterloo, 1994. http://hdl.handle.net/10012/738.
Pełny tekst źródłaBattell, Chelsea. "The Logic of Hereditary Harrop Formulas as a Specification Logic for Hybrid". Thesis, Université d'Ottawa / University of Ottawa, 2016. http://hdl.handle.net/10393/35264.
Pełny tekst źródłaRamakrishnan, Lakshmi Narasimhan. "SDMLp - Secure Differential Multiplexer Logic : Logic Design for DPA-Resistant Cryptographic Circuits". University of Cincinnati / OhioLINK, 2011. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1311691925.
Pełny tekst źródłaWarnke, Martin. "Logic as a medium". Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4271/.
Pełny tekst źródłaWong, Ka-Shu Computer Science & Engineering Faculty of Engineering UNSW. "Forgetting in logic programs". Publisher:University of New South Wales. Computer Science & Engineering, 2009. http://handle.unsw.edu.au/1959.4/43732.
Pełny tekst źródła