Dissertations / Theses on the topic 'Logic'
To see the other types of publications on this topic, follow the link: Logic.
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 dissertations / theses for your research on the topic 'Logic.'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse dissertations / theses on a wide variety of disciplines and organise your bibliography correctly.
1
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.
Full text
2
Rabe, 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.
Full text
3
Mezzadri, Daniele. "Language and logic in Wittgenstein's Tractatus Logico-Philosophicus." Thesis, University of Stirling, 2010. http://hdl.handle.net/1893/2432.
Full textAbstract:
This thesis discusses some central aspects of Wittgenstein’s conception of language and logic in his Tractatus Logico-Philosophicus and brings them into relation with the philosophies of Frege and Russell. The main contention is that a fruitful way of understanding the Tractatus is to see it as responding to tensions in Frege’s conception of logic and Russell’s theory of judgement. In the thesis the philosophy of the Tractatus is presented as developing from these two strands of criticism and thus as the culmination of the philosophy of logic and language developed in the early analytic period. Part one examines relevant features of Frege’s philosophy of logic. Besides shedding light on Frege’s philosophy in its own right, it aims at preparing the ground for a discussion of those aspects of the Tractatus’ conception of logic which derive from Wittgenstein’s critical response to Frege. Part two first presents Russell’s early view on truth and judgement, before considering several variants of the multiple relation theory of judgement, devised in opposition to it. Part three discusses the development of Wittgenstein’s conception of language and logic, beginning with Wittgenstein’s criticism of the multiple relation theory and his early theory of sense, seen as containing the seeds of the picture theory of propositions presented in the Tractatus. I then consider the relation between Wittgenstein’s pictorial conception of language and his conception of logic, arguing that Wittgenstein’s understanding of sense in terms of bipolarity grounds his view of logical complexity and of the essence of logic as a whole. This view, I show, is free from the internal tensions that affect Frege’s understanding of the nature of logic.
4
Friend, Michèle Indira. "Second-order logic is logic." Thesis, University of St Andrews, 1997. http://hdl.handle.net/10023/14753.
Full textAbstract:
"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 other interest is historical: showing that second-order logic is a logical system according to the philosophical criteria mentioned above goes some way towards vindicating Frege's logicist project in a contemporary context.
5
Nguyen, Loc Bao. "Logic design using programmable logic devices." PDXScholar, 1988. https://pdxscholar.library.pdx.edu/open_access_etds/4103.
Full textAbstract:
The Programmable Logic Devices, PLO, have caused a major impact in logic design of digital systems in this decade. For instance, a twenty pin PLO device can replace from three hundreds to six hundreds Transistor Transistor Logic gates, which people have designed with since the 60s. Therefore, by using PLD devices, designers can squeeze more features, reduce chip counts, reduce power consumption, and enhance the reliability of the digital systems.
This thesis covers the most important aspects of logic design using PLD devices. They are Logic Minimization and State Assignment. In addition, the thesis also covers a seldomly used but very useful design style, Self-Synchronized Circuits.
The thesis introduces a new method to minimize Two-Level Boolean Functions using Graph Coloring Algorithms and the result is very encouraging. The raw speed of the coloring algorithms is as fast as the Espresso, the industry standard minimizer from Berkeley, and the solution is equally good.
The thesis also introduces a rule-based state assignment method which gives equal or better solutions than STASH (an Intel Automatic CAD tool) by as much as twenty percent.
One of the problems with Self-Synchronized circuits is that it takes many extra components to implement the circuit. The thesis shows how it can be designed using PLD devices and also suggests the idea of a Clock Chip to reduce the chip count to make the design style more attractive.
6
Sack, 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.
Full textAbstract:
Thesis (Ph.D.)--Indiana University, Dept. of Mathematics, 2007.Source: Dissertation Abstracts International, Volume: 68-07, Section: B, page: 4531. Adviser: Lawrence Moss. Title from dissertation home page (viewed Apr. 22, 2008).
7
Veen, Maria Helena van der. "[Pi]-Logic." [S.l. : Groningen : s.n. ; University Library Groningen] [Host], 2006. http://irs.ub.rug.nl/ppn/293902518.
Full text
8
Merrison, Joanne. "Coleridge's logic." Thesis, University of East Anglia, 1990. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.316092.
Full text
9
Wheelhouse, Mark James. "Segment logic." Thesis, Imperial College London, 2012. http://hdl.handle.net/10044/1/10473.
Full textAbstract:
O'Hearn, Reynolds and Yang introduced local Hoare reasoning about mutable data structures using separation logic. They reason about the local parts of the memory accessed by programs, and thus construct their smallest complete specifications. Gardner et al. generalised their work, using context logic to reason about structured data at the same level of abstraction as the data itself. In particular, we developed a formal specification of the Document Object Model (DOM), a W3C XML update library. Whilst we kept to the spirit of local reasoning, we were not able to retain small specifications for all of the commands of DOM: for example, our specification of the appendChild command was not small. We show how to obtain such small specifications by developing a more fine-grained context structure, allowing us to work with arbitrary segments of a data structure. We introduce segment logic, a logic for reasoning about such segmented data structures, staring at first with a simple tree structure, but then showing how to generalise our approach to arbitrary structured data. Using our generalised segment logic we construct a reasoning framework for abstract program modules, showing how to reason about such modules at the client level. In particular we look at modules for trees, lists, heaps and the more complex data model of DOM. An important part of any abstraction technique is an understanding of how to link the abstraction back to concrete implementations. Building on our previous abstraction and refinement work for local reasoning, we show how to soundly implement the segment models used in our abstract reasoning. In particular we show how to implement our fine-grained list and tree modules so that their abstract specifications are satisfied by the concrete implementations. We also show how our reasoning from the abstract level can be translated to reasoning at the concrete level. Finally, we turn our attention to concurrency and show how having genuine small axioms for our commands allows for a simple treatment of abstract level concurrency constructs.
10
Roş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.
Full text
11
Thalmann, 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/.
Full text
12
Weidner, 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.
Full textAbstract:
The classic theorems of Büchi and Kleene state the expressive equivalence of finite automata to monadic second order logic and regular expressions, respectively. These fundamental results enjoy applications in nearly every field of theoretical computer science. Around the same time as Büchi and Kleene, Rabin investigated probabilistic finite automata. This equally well established model has applications ranging from natural language processing to probabilistic model checking.
Here, we give probabilistic extensions Büchi\\\'s theorem and Kleene\\\'s theorem to the probabilistic setting. We obtain a probabilistic MSO logic by adding an expected second order quantifier. In the scope of this quantifier, membership is determined by a Bernoulli process. This approach turns out to be universal and is applicable for finite and infinite words as well as for finite trees. In order to prove the expressive equivalence of this probabilistic MSO logic to probabilistic automata, we show a Nivat-theorem, which decomposes a recognisable function into a regular language, homomorphisms, and a probability measure.
For regular expressions, we build upon existing work to obtain probabilistic regular expressions on finite and infinite words. We show the expressive equivalence between these expressions and probabilistic Muller-automata. To handle Muller-acceptance conditions, we give a new construction from probabilistic regular expressions to Muller-automata. Concerning finite trees, we define probabilistic regular tree expressions using a new iteration operator, called infinity-iteration. Again, we show that these expressions are expressively equivalent to probabilistic tree automata.
On a second track of our research we investigate Constraint LTL over multidimensional data words with data values from the infinite tree. Such LTL formulas are evaluated over infinite words, where every position possesses several data values from the infinite tree. Within Constraint LTL on can compare these values from different positions. We show that the model checking problem for this logic is PSPACE-complete via investigating the emptiness problem of Constraint Büchi automata.
13
Albuquerque, 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.
Full textAbstract:
This dissertation presents the results of our research on some recent devel-opments in Abstract Algebraic Logic (AAL), namely on the Suszko operator, the Leibniz filters, and truth-equational logics. Part I builts and develops an abstract framework which unifies under a common treatment the study of the Leibniz, Suszko, and Frege operators in AAL. Part II generalizes the theory of the strong version of protoalgebraic logics, started in, to arbitrary sentential logics.
The interplay between several Leibniz- and Suszko-related notions led us to consider a general framework based upon the notion of S-operator (inspired by that of "mapping compatible with S-filters" of Czelakowski), which encompasses the Leibniz, Suszko, and Frege operators. In particular, when applied to the Leibniz and Suszko operators, new notions of Leibniz and Suszko S-filters arise as instances of more general concepts inside the abstract framework built. The former generalizes the existing notion of Leibniz filter for protoalgebraic logics to arbitrary logics, while the latter is introduced here for the first time. Sev-eral results, both known and new, follow quite naturally inside this framework, again by instantiating it with the Leibniz and Suszko operators. Among the main new results, we prove a General Correspondence Theorem (Theorem ??), which generalizes Blok and Pigozzi's well-known Correspondence Theorem for protoalgebraic logics, as well as Czelakowski's less known Correspondence The-orem for arbitrary logics. We characterize protoalgebraic logics in terms of the Suszko operator as those logics in which the Suszko operator commutes with inverse images by surjective homomorphisms (Theorem ??). We characterize truth-equational logics in terms of their (Suszko) S-filters (Theorem ??), in terms of their full g-models (Corollary ??), and in terms of the Suszko operator, a characterization which strengthens that of Raftery, as those logics in which the Suszko operator is a structural representation from the set of S-filters to the set of AIg(S)-relative congruences, on arbitrary algebras (Theorem ??). Finally, we prove a new Isomorphism Theorem for protoalgebraic logics (Theorem ??), in the same spirit of the famous one for algebraizable logics and for weakly algebraizable logics.
Endowed with a notion of Leibniz filter applicable to any logic, we are able to generalize the theory of the strong version of a protoalgebraic logic developed by Font and Jansana to arbitrary sentential logics. Given a sentential logic 5, its strong version St is the logic induced by the class of matrices whose truth set is Leibniz filter. We study three definability criteria of Leibniz filters: equational, explicit and logical definability. Under (any of) these assumptions, we prove that the St-filters coincide with Leibniz S-filters on arbitrary algebras. Finally, we apply the general theory developed to a wealth of non-protoalgebraic log-ics covered in the literature. Namely, we consider Positive Modal Logic P,A4,C, Belnap's logic B, the subintuitionistic logics w1C, and Visser's logic VP,C, and Lukasiewicz's infinite-valued logic preserving degrees of truth. We also consider the generalization of the last example mentioned to logics preserving degrees of truth from varieties of integral commutative residuated lattices, and further generalizations to the non-integral case, as well as to the case without multi-plicative constant. We classify all the examples investigated inside the Leibniz and Frege hierarchies. While none of the logics studied is protoalgebraic, all the respective strong versions are truth-equational.Aquesta 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.
14
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.
Full textAbstract:
Description Logic is a formalism that is widely used in the framework of Knowledge Representation and Reasoning in Artificial Intelligence. They are based on Classical Logic in order to guarantee the correctness of the inferences on the required reasoning tasks. It is indeed a fragment of First Order Predicate Logic whose language is strictly related to the one of Modal Logic. Fuzzy Description Logic is the generalization of the classical Description Logic framework thought for reasoning with vague concepts that often arise in practical applications.
Fuzzy Description Logic has been investigated since the last decade of the 20th century. During the first fifteen years of investigation their semantics has been based on Fuzzy Set Theory. A semantics based on Fuzzy Set Theory, however, has been shown to have some counter-intuitive behavior, due to the fact that the truth function for the implication used is not the residuum of the truth function for the conjunction. In the meanwhile, Fuzzy Logic has been given a formal framework based on Many-valued Logic. This framework, called Mathematical Fuzzy Logic, has been proposed has the kernel of a mathematically well founded Fuzzy Logic.
In this dissertation we propose a Fuzzy Description Logic whose semantics is based on Mathematical Fuzzy Logic as its mathematically well settled kernel. To this end we provide a novel notation that is strictly related to the notation that is used in Mathematical Fuzzy Logic. After having settled the notation, we investigate the hierarchies of description languages over different-“t” norm based semantics and the reductions that can be performed between reasoning tasks. The new framework that we establish gives us the possibility to systematically investigate the relation of Fuzzy Description Logic to Fuzzy First Order Logic and Fuzzy Modal Logic. Next we provide some (un)decidability results for the case of infinite “t”-norm based semantics with or without knowledge bases. Finally we investigate the complexity bounds of reasoning tasks without knowledge bases for basic Fuzzy Description Logics over finite “t”-norms.El 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.
15
Chen, Guiming. "Fuzzy FOIL: A fuzzy logic based inductive logic programming system." Thesis, University of Ottawa (Canada), 1996. http://hdl.handle.net/10393/9621.
Full textAbstract:
In many domains, characterizations of a given attribute are imprecise, uncertain and incomplete in the available learning examples. The definitions of classes may be vague. Learning systems are frequently forced to deal with such uncertainty. Traditional learning systems are designed to work in the domains where imprecision and uncertainty in the data are absent. Those learning systems are limited because of their impossibility to cope with uncertainty--a typical feature of real-world data. In this thesis, we developed a fuzzy learning system which combines inductive learning with a fuzzy approach to solve problems arising in learning tasks in the domains affected by uncertainty and vagueness. Based on Fuzzy Logic, rather than pure First Order Logic used in FOIL, this system extends FOIL with learning fuzzy logic relation from both imprecise examples and background knowledge represented by Fuzzy Prolog. The classification into the positive and negative examples is allowed to be a degree (of positiveness or negativeness) between 0 and 1. The values of a given attribute in examples need not to be the same type. Symbolic and continuous data can exist in the same attribute, allowing for fuzzy unification (inexact matching). An inductive learning problem is formulated as to find a fuzzy logic relation with a degree of truth, in which a fuzzy gain calculation method is used to guide heuristic search. The Fuzzy FOIL's ability of learning the required fuzzy logic relations and dealing with vague data enhances FOIL's usefulness.
16
Kozlowski, 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.
Full text
17
Obeid, Naji. "MIM-Logic : a logic for reasoning about molecular interaction maps." Toulouse 3, 2014. http://thesesups.ups-tlse.fr/2527/.
Full textAbstract:
Les séries de réactions biochimiques apparaissant au cœur d'une cellule forme ce qu'on appelle des voies métaboliques. La plupart de ces voies sont très complexes impliquant un grand nombre de protéines et d'enzymes. Une représentation logique de ces réseaux contribue au raisonnement à propos de ces voies en général, allant du fait de répondre à certaines questions, compléter des arcs et nœuds manquant, et trouver des incohérences. Dans ce contexte on propose un nouveau model logique basé sur un fragment de logique de premier ordre capable de décrire les réactions apparaissant dans des Molecular Interaction Maps. On propose aussi une méthode de déduction automatique efficace capable de répondre aux questions par déduction pour prédire les résultats des réactions et par abduction pour trouver les états des protéines et de leurs réactions. Cette méthode automatique est basée sur une procédure de traduction qui élimine les quantificateurs des formules de logique premier ordreThe 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
18
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.
Full textAbstract:
L'oggetto di studio della tesi riguarda la transizione da una logica economica basata sui beni verso la logica economica dove il servizio diventa fondamentale nell'attività di impresa. Saranno approfonditi tutti gli elementi caratterizzanti di queste logiche a partire dai fondamenti storici caratterizzanti di entrambe fino ad arrivare al loro funzionamento. Saranno presentati casi pratici e implementati personali sviluppi di affermazione della logica basata sul servizio.
19
Drescher, Conrad. "Action Logic Programs." Doctoral thesis, Saechsische Landesbibliothek- Staats- und Universitaetsbibliothek Dresden, 2011. http://nbn-resolving.de/urn:nbn:de:bsz:14-qucosa-68252.
Full textAbstract:
We discuss a new concept of agent programs that combines logic programming with reasoning about actions. These agent logic programs are characterized by a clear separation between the specification of the agent’s strategic behavior and the underlying theory about the agent’s actions and their effects. This makes it a generic, declarative agent programming language, which can be combined with an action representation formalism of one’s choice. We present a declarative semantics for agent logic programs along with (two versions of) a sound and complete operational semantics, which combines the standard inference mechanisms for (constraint) logic programs with reasoning about actions.
20
Wansing, Heinrich. "Displaying modal logic /." Dordrecht [u.a.] : Kluwer, 1998. http://www.gbv.de/dms/ilmenau/toc/24662969X.PDF.
Full text
21
McPhee, Richard. "Compositional logic programming." Thesis, University of Oxford, 2000. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.393413.
Full text
22
Mathiesen, Erik Arne. "Abstract hoare logic." Thesis, Queen Mary, University of London, 2007. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.497518.
Full text
23
Toni, Francesca. "Abductive logic programming." Thesis, Imperial College London, 1995. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.490558.
Full text
24
McClenaghan, Nathan David. "Molecular logic systems." Thesis, Queen's University Belfast, 1999. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.314084.
Full text
25
COSTA, 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.
Full textAbstract:
PONTIFÍCIA UNIVERSIDADE CATÓLICA DO RIO DE JANEIROCONSELHO 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).
26
Koskela, Suvi Jonna Mikaela. "Molecular logic gates." Thesis, University of Bath, 2003. https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.760841.
Full text
27
Heck, Richard Gustave. "Logic, semantics, ontology." Thesis, Massachusetts Institute of Technology, 1991. http://hdl.handle.net/1721.1/13940.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Linguistics and Philosophy, 1991.Vita.
Includes bibliographical references (leaves 195-197).
by Richard Gustave Heck, Jr.
Ph.D.
28
Dalrymple, David Allen. "Asynchronous logic automata." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/44914.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2008.This 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.
29
Prakash, Manu. "Microfluidic bubble logic." Thesis, Massachusetts Institute of Technology, 2008. http://hdl.handle.net/1721.1/46593.
Full textAbstract:
Thesis (Ph. D.)--Massachusetts Institute of Technology, School of Architecture and Planning, Program in Media Arts and Sciences, 2008."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.
30
Wright, Adam. "Structural separation logic." Thesis, Imperial College London, 2013. http://hdl.handle.net/10044/1/17838.
Full textAbstract:
This thesis presents structural separation logic, a novel program reasoning approach for software that manipulates both standard heaps and structured data such as lists and trees. Structural separation logic builds upon existing work in both separation logic and context logic. It considers data abstractly, much as it is exposed by library interfaces, ignoring implementation details. We provide a programming language that works over structural heaps, which are similar to standard heaps but allow data to be stored in an abstract form. We introduce abstract heaps, which extend structural heaps to enable local reasoning about abstract data. Such data can be split up with structural addresses. Structural addresses allow sub-data (e.g. a sub-tree within a tree) to be abstractly allocated, promoting the sub-data to an abstract heap cell. This cell can be analysed in isolation, then re-joined with the original data. We show how the tight footprints this allows can be refined further with promises, which enable abstract heap cells to retain information about the context from which they were allocated. We prove that our approach is sound with respect to a standard Hoare logic. We study two large examples. Firstly, we present an axiomatic semantics for the Docu- ment Object Model in structural separation logic. We demonstrate how structural separa- tion logic allows abstract reasoning about the DOM tree using tighter footprints than were possible in previous work. Secondly, we give a novel presentation of the POSIX file system library. We identify a subset of the large POSIX standard that focuses on the file system, including commands that manipulate both the file heap and the directory structure. Axioms for this system are given using structural separation logic. As file system resources are typically identified by paths, we use promises to give tight footprints to commands, so that that they do not require all the resource needed to explain paths being used. We demonstrate our reasoning using a software installer example.
31
Bader, Antoine. "DNA-based logic." Thesis, University of Edinburgh, 2018. http://hdl.handle.net/1842/31065.
Full textAbstract:
DNA nanotechnology has been developed in order to construct nanostructures and nanomachines by virtue of the programmable self-assembly properties of DNA molecules. Although DNA nanotechnology initially focused on spatial arrangement of DNA strands, new horizons have been explored owing to the development of the toehold-mediated strand-displacement reaction, conferring new dynamic properties to previously static and rigid structures. A large variety of DNA reconfigurable nanostructures, stepped and autonomous nanomachines and circuits have been operated using the strand-displacement reaction. Biological systems rely on information processing to guide their behaviour and functions. Molecular computation is a branch of DNA nanotechnology that aims to construct and operate programmable computing devices made out of DNA that could interact in a biological context. Similar to conventional computers, the computational processes involved are based on Boolean logic, a propositional language that describes statements as being true or false while connecting them with logic operators. Numerous logic gates and circuits have been built with DNA that demonstrate information processing at the molecular level. However, development of new systems is called for in order to perform new tasks of higher computational complexity and enhanced reliability. The contribution of secondary structure to the vulnerability of a toehold-sequestered device to undesired triggering of inputs was examined, giving new approaches for minimizing leakage of DNA devices. This device was then integrated as a logic component in a DNA-based computer with a retrievable memory, thus implementing two essential biological functions in one synthetic device. Additionally, G-quadruplex logic gates were developed that can be switched between two topological states in a logic fashion. Their individual responses were detected simultaneously, establishing a new approach for parallel biological computing. A new AND-NOT logic circuit based on the seesaw mechanism was constructed that, in combination with the already existing AND and OR gates, form a now complete basis set that could perform any Boolean computation. This work introduces a new mode of kinetic control over the operation of such DNA circuits. Finally, the first example of a transmembrane logic gate being operated at the single-molecule level is described. This could be used as a potential platform for biosensing.
32
Redmond, Walter. "Logic, Duty, Virtue." Pontificia Universidad Católica del Perú - Departamento de Humanidades, 2013. http://repositorio.pucp.edu.pe/index/handle/123456789/112991.
Full textAbstract:
Deonticlogic, the logic of ethics, can apply to various moral theories. for example, those based on the concepts of virtue or on duty. A scholastic-style square of opposition isuseful in displaying logical relationships among moral notions oroperators such as ought and may. The system may be constructed with a single operator and the nothers may be added to parallel other expressions in ordinary language. Two principies are given to explain super erogation, the case of good but non obligatory acts or habits and to suggest a basic logic of virtue.La 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.
33
Barbosa, Fábio Daniel Moreira. "Probabilistic propositional logic." Master's thesis, Universidade de Aveiro, 2016. http://hdl.handle.net/10773/22198.
Full textAbstract:
Mestrado em Matemática e AplicaçõesO 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).
34
Coleman, Neil Edward. "Logic as modelling." Thesis, University of Bristol, 2015. http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.702219.
Full textAbstract:
We are often faced with normative claims about our logical systems and practice. 'classical systems are good', 'intuitionistic logics are deviant and therefore should not be used', etc. In this thesis I aim consider the nature of these norms. I ask: what is it to be a good or bad logic? What are the norms governing logical practice? The answer I offer traces back to the work of Cook (2000) and Shapiro (2012). I argue that Logic is best understood as a discipline concerned with the construction, development and application of a particular type of scientific model: logics. Logics are models in the same way that the Hodgkin-Huxley equations are a model of action potential. They are representational tools which have the capacity to be applied to target systems in order to satisfy a range of different functions. Thus, logics are to be evaluated in the same manner as any other model. Their value will stem from their satisfaction of a representational function. One way in which we might characterise this is to talk of the modes of assessment we usually attribute to scientific models {such as representational adequacy, simplicity, elegance and so forth). Logical practice is also therefore governed by the same norms applicable to scientific modelling generally. In essence, Logic is the search for the best model for a given target and function. Noteworthy about this approach to the normative issues are the following points: firstly, it recognises a greater variety of evaluations for logic than the simple binary of 'true' and 'false' or 'correct' and 'incorrect'. Second, what we might call 'non-correspondence virtues' (such as simplicity, unity etc.) become relevant to the assessment of logics. Finally, we find that Logic becomes open to functional and subject relativisms, along with methodological pluralisms, though the degree to which such pluralisms will actually exist will depend on the particular targets and functions to which our logics are applied
35
Giesecke, Normen. "Ternary quantum logic." PDXScholar, 2006. https://pdxscholar.library.pdx.edu/open_access_etds/4092.
Full textAbstract:
The application of Moore's Law would not be feasible by using the computing systems fabrication principles that are prevalent today. Fundamental changes in the field of computing are needed to keep Moore's Law operational. Different quantum technologies are available to take the advancement of computing into the future. Logic in quantum technology uses gates that are very different from those used in contemporary technology. Limiting itself to reversible operations, this thesis presents different methods to realize these logic gates. Two methods using Generalized Ternary Gates and Muthukrishnan Stroud Gates are presented for synthesis of ternary logic gates. Realizations of well-known quantum gates like the Feynman gate, Toffoli Gate, 2-qudit and 3-qudit SW AP gates are shown. In addition a new gate, the Inverse SW AP gate, is proposed and its realization is also presented.
36
Fors, 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.
Full text
37
Wiklund, 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.
Full text
38
Xu, 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.
Full text
39
Tibbits, 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.
Full textAbstract:
Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Architecture; and, (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2010.Cataloged 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.
40
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.
Full textAbstract:
Machine Learning is necessary for the development of Artificial Intelligence, as pointed out by Turing in his 1950 article ``Computing Machinery and Intelligence''. It is in the same article that Turing suggested the use of computational logic and background knowledge for learning. This thesis follows a logic-based machine learning approach called Inductive Logic Programming (ILP), which is advantageous over other machine learning approaches in terms of relational learning and utilising background knowledge. ILP uses logic programs as a uniform representation for hypothesis, background knowledge and examples, but its declarative bias is usually encoded using metalogical statements. This thesis advocates the use of logic programs to represent declarative and procedural bias, which results in a framework of single-language representation. We show in this thesis that using a logic program called the top theory as declarative bias leads to a sound and complete multi-clause learning system MC-TopLog. It overcomes the entailment-incompleteness of Progol, thus outperforms Progol in terms of predictive accuracies on learning grammars and strategies for playing Nim game. MC-TopLog has been applied to two real-world applications funded by Syngenta, which is an agriculture company. A higher-order extension on top theories results in meta-interpreters, which allow the introduction of new predicate symbols. Thus the resulting ILP system Metagol can do predicate invention, which is an intrinsically higher-order logic operation. Metagol also leverages the procedural semantic of Prolog to encode procedural bias, so that it can outperform both its ASP version and ILP systems without an equivalent procedural bias in terms of efficiency and accuracy. This is demonstrated by the experiments on learning Regular, Context-free and Natural grammars. Metagol is also applied to non-grammar learning tasks involving recursion and predicate invention, such as learning a definition of staircases and robot strategy learning. Both MC-TopLog and Metagol are based on a 'top'-directed framework, which is different from other multi-clause learning systems based on Inverse Entailment, such as CF-Induction, XHAIL and IMPARO. Compared to another 'top'-directed multi-clause learning system TAL, Metagol allows the explicit form of higher-order assumption to be encoded in the form of meta-rules.
41
Tall, Aliou. "From mathematics in logic to logic in mathematics : Boole and Frege." Thesis, University of York, 2002. http://etheses.whiterose.ac.uk/14163/.
Full textAbstract:
This project proceeds from the premise that the historical and logical value of Boole's logical calculus and its connection with Frege's logic remain to be recognised. It begins by discussing Gillies' application of Kuhn's concepts to the history oflogic and proposing the use of the concept of research programme as a methodological tool in the historiography oflogic. Then it analyses'the development of mathematical logic from Boole to Frege in terms of overlapping research programmes whilst discussing especially Boole's logical calculus. Two streams of development run through the project: 1. A discussion and appraisal of Boole's research programme in the context of logical debates and the emergence of symbolical algebra in Britain in the nineteenth century, including the improvements which Venn brings to logic as algebra, and the axiomatisation of 'Boolean algebras', which is due to Huntington and Sheffer. 2. An investigation of the particularity of the Fregean research programme, including an analysis ofthe extent to which certain elements of Begriffsschrift are new; and an account of Frege's discussion of Boole which focuses on the domain common to the two formal languages and shows the logical connection between Boole's logical calculus and Frege's. As a result, it is shown that the progress made in mathematical logic stemmed from two continuous and overlapping research programmes: Boole's introduction ofmathematics in logic and Frege's introduction oflogic in mathematics. In particular, Boole is regarded as the grandfather of metamathematics, and Lowenheim's theorem ofl915 is seen as a revival of his research programme.
42
Celani, Laura. "Logic in theory and in practice : the normative status of logic." Thesis, University of St Andrews, 2015. http://hdl.handle.net/10023/6329.
Full textAbstract:
In my thesis, I address the question ʽWhat normative status does logic have?', to argue that logical normativity is of a weak sort, and that its constraining power is similar to that of recommendations. The thesis first discusses the notion of logical validity and logical formality, then asks whether logic is a priori and whether it can provide a priori norms for thinking. Subsequently, the issue of the bridge principles linking formal logic to informal reasoning is addressed, jointly with a brief discussion of the deontic operators included in the bridge principles. Then, the thesis addresses three criticisms of the normative role of logic with respect to rational reasoning. The first criticism is discussed in the fourth chapter; it starts from the consideration of the cognitive limitations of human agents and discusses a model of rationality that takes those limitations into account. The second criticism is analyzed in the fifth chapter; it is motivated by the empirical studies in the psychology of reasoning, and discusses human reasoning from a descriptive point of view, lending support to the model of rationality presented in the fourth chapter. The third criticism, presented in the sixth and final chapter, addresses the normative role of logic from an a priori point of view, showing how the epistemic paradoxes are crucial for determining what normative import logic has on rational reasoning. The final chapter defends the main thesis that logic has a weak import on our reasoning, which resembles a recommendation rather than an obligation.
43
Genito, Daniele. "Some topics in fuzzy logic." Doctoral thesis, Universita degli studi di Salerno, 2010. http://hdl.handle.net/10556/113.
Full textAbstract:
2008-2009Si 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.
44
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.
Full textAbstract:
Orientador: Walter Alexandre CarnielliDissertaçã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
45
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.
Full textAbstract:
Thesis (M.A.)-University of Waterloo, 1994.Includes 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.
46
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.
Full textAbstract:
This thesis explores the various forms of reasoning that are associated with diagrams. It does this by a logical analysis of diagrammatic symbols. The thesis is divided into three sections dealing with different aspects of diagrammatic logic. They are (1) The relevance of diagrammatic symbols and their role in logic, (2) Methods of formalizing diagrammatic symbols, such as subway maps and Peirce's Existential Graphs through the means of Graph theory, (3) The conception of inference in diagrammatic logic systems.
47
Battell, 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.
Full textAbstract:
Hybrid is a two-level logical framework that supports higher-order abstract syntax
(HOAS), where a specification logic (SL) extends the class of object logics (OLs) we
can reason about. We develop a new Hybrid SL and formalize its metatheory, proving weakening, contraction, exchange, and cut admissibility; results that greatly simplify reasoning about OLs in systems providing HOAS. The SL is a sequent calculus defined as an inductive type in Coq and we prove properties by structural induction over SL sequents. We also present a generalized SL and metatheory statement, allowing us to prove many cases of such theorems in a general way and understand how to identify and prove the difficult cases. We make a concrete and measurable improvement to Hybrid with the new SL formalization and provide a technique for abstracting such proofs, leading to a condensed presentation, greater understanding, and a generalization that may be instantiated to other logics.
48
Ramakrishnan, 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.
Full text
49
Warnke, Martin. "Logic as a medium." Universität Potsdam, 2010. http://opus.kobv.de/ubp/volltexte/2010/4271/.
Full textAbstract:
Computer games are rigid in a peculiar way: the logic of computation was the first to shape the early games. The logic of interactivity marked the action genre of games in the second place, while in massive multiplayer online gaming all the emergences of the net occur to confront us with just another type of logic. These logics are the media in which the specific forms of computer games evolve. Therefore, a look at gaming supposing that there are three eras of computation is taken: the early synthetical era, ruled by the Turing machine and by mainframe computers, by the IPO principle of computing; the second, mimetical era, when interactivity and graphical user interfaces dominate, the domain of the feedback loop; and the third, emergent era, in which the complexity of networked personal computers and their users is dominant.
50
Wong, 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.
Full textAbstract:
Forgetting is an operation which removes information from a set of logical statements, such that a) the language used by the logic is simplified; and b) as much information as possible from the original logical statements are preserved. Forgetting operations are useful in a variety of contexts, including knowledge representation, where it is necessary to have an operation for removing information from knowledge bases; and the problem of relevance, where logical statements are simplified by removing irrelevant information. In this thesis we consider forgetting operations on logic programs with negation-as-failure according to the stable model semantics. There are existing notions of forgetting on logic programs in the literature: the strong forgetting and weak forgetting of Zhang and Foo, and the semantic approach to forgetting introduced by Wang et al. However, these notions are inadequate: the strong and weak forgettings are defined syntactically with no obvious connections to semantic notions of forgetting; while the semantic approach of Wang et al. does not take into account ``hidden'' information encoded in unused rules. The idea of equivalence on logic programs capture the extent of information contained in a logic program. We consider that two logic programs are equivalent iff the two programs contain the same information. For logic programs, there are many different possible notions of equivalence. We look at the well-known notion of strong equivalence and a new notion of equivalence which we call T-equivalence. Associated with each of these equivalences is a consequence relation on logic program rules. We present sound and complete set of inference rules for both consequence relations. We present a novel approach to logic program forgetting which uses as its basis a set of postulates, which are defined relative to a notion of equivalence. We show that if we use T-equivalence as the equivalence relation, then the only possible forgetting operations (up to equivalence) are strong forgetting and weak forgetting. If strong equivalence is used instead, then there are also only two possible forgetting operations (up to equivalence).