Dissertations / Theses on the topic 'Mani valued logics'

2015 - 2016
This thesis, as the research activity of the author, is devoted to establish new connections and to strengthen well-established relations between different branches of mathematics, via logic tools. Two main many valued logics, logic of balance and L ukasiewicz logic, are considered; their associated algebraic structures will be studied with different tools and these techniques will be applied in social choice theory and artificial neural networks. The thesis is structured in three parts. Part I The logic of balance, for short Bal(H), is introduced. It is showed: the relation with `-Groups, i.e. lattice ordered abelian groups (Chapter 2); a functional representation (Chapter 3); the algebraic geometry of the variety of `-Groups with constants (Chapter 4). Part II A brief historical introduction of L ukasiewicz logic and its extensions is provided. It is showed: a functional representation via generalized states (Chapter 5); a non-linear model for MV-algebras and a detailed study of it, culminating in a categorical theorem (Chapter 6). Part III Applications to social choice theory and artificial neural network are presented. In particular: preferences will be related to vector lattices and their cones, recalling the relation between polynomials and cones studied in Chapter 4; multilayer perceptrons will be elements of non-linear models introduced in Chapter 6 and networks will take advantages from polynomial completeness, which is studied in Chapter 2. We are going to present: in Sections 1.2 and 1.3 all the considered structures, our approach to them and their (possible) applications; in Section 1.4 a focus on the representation theory for `-Groups and MV-algebras. Note that: algebraic geometry for `-Groups provides a modus operandi which turns out to be useful not only in theoretical field, but also in applications, opening (we hope) new perspectives and intuitions, as we made in this first approach to social theory; non-linear models here presented and their relation to neural networks seem to be very promising, giving both intuitive and formal approach to many concrete problems, for instance degenerative diseases or distorted signals. All these interesting topics will be studied in future works of the author. [edited by author]
Questa tesi, come l’attivit`a di ricerca dell’autore, `e dedicata a stabilire nuove connessioni e a rafforzare le relazioni ben consolidate tra diversi settori della matematica, attraverso strumenti logici. Sono considerate due principali logiche a piu` valori, logic of balance e L ukasiewicz logic; le loro strutture algebriche associate verranno studiate con strumenti diversi e queste tecniche saranno applicate nella teoria della scelta sociale e nelle reti neurali artificiali. La tesi `e strutturata in tre parti. Part I Viene introdotta la Logic of balance. Viene mostrato: la relazione con `-Groups, gruppi abeliani ordinati reticolarmente (Chapter 2); una rappresentazione funzionale (Chapter 3); geometria algebrica della variet`a degli `-Groups con costanti (Chapter 4). Part II Viene fornita una breve introduzione storica della logica di L ukasiewicz e delle sue estensioni. Viene mostrato: una rappresentazione funzionale tramite stati generalizzati (Chapter 5); Un modello non lineare per le MV-algebre e uno studio dettagliato di esso, culminando in un teorema categoriale (Chapter 6). Part III Sono presentate applicazioni alla teoria delle scelte sociali e delle rete neurali artificiali. In particolare: le preferenze saranno correlate ai reticoli vettoriali e ai loro coni, richiamando la relazione tra polinomi e coni studiati nel Capitolo 4; I multilayer perceptrons saranno elementi di modelli non lineari introdotti nel Capitolo 6 e le reti prenderanno vantaggi dalla completezza polinomiale, studiata nel Capitolo 2. La geometria algebrica per gli `-Groups fornisce un modus operandi che risulta utile non solo nel campo teorico, ma anche nelle applicazioni, aprendo (speriamo) nuove prospettive e intuizioni, come abbiamo fatto in questo primo approccio alla teoria sociale; I modelli non lineari qui presentati e la loro relazione con le reti neurali sembrano molto promettenti, offrendo un approccio intuitivo e formale a molti problemi concreti, ad esempio malattie degenerative o segnali distorti. Tutti questi argomenti saranno oggetto di studio in opere future dell’autore. [a cura dell'autore]
XV n.s. (XXIX)

The purpose of this paper is to make a suggestion to deontic logic: Respect Hume\'s Law, the answer to the is-ought problem that says that all ought-talk is completely cut off from is-talk. Most deontic logicians have sought another solution: Namely, the solution that says that we can bridge the is-ought gap. Thus, a century\'s worth of research into these normative systems of logic has lead to many attempts at doing just that. At the same time, the field of deontic logic has come to be plagued with paradox. My argument essentially depends upon there being a substantive relation between this betrayal of Hume and the plethora of paradoxes that have appeared in two-adic (binary normative operator), one-adic (unary normative operator), and zero-adic (constant normative operator) deontic systems, expressed in the traditions of von Wright, Kripke, and Anderson, respectively. My suggestion has two motivations: First, to rid the philosophical literature of its puzzles and second, to give Hume\'s Law a proper formalization. Exploring the issues related to this project also points to the idea that maybe we should re-engineer (e.g., further generalize) our classical calculus, which might involve the adoption of many-valued logics somewhere down the line.
Master of Arts

The scientific area this thesis belongs to are many-valued logics: in particular, the logic MTL and some of its extensions, in the propositional and in the first-order case (see [8],[9],[6],[7]). The thesis is divided in two parts: in the first one the necessary background about these logics, with some minor new results, are presented. The second part is devoted to more specific topics: there are five chapters, each one about a different problem. In chapter 6 a temporal semantics for Basic Logic BL is presented. In chapter 7 we move to first-order logics, by studying the supersoundness property: we have improved some previous works about this theme, by expanding the analysis to many extensions of the first-order version of MTL. Chapter 8 is dedicated to four different families of n-contractive axiomatic extensions of BL, analyzed in the propositional and in the first-order case: completeness, computational and arithmetical complexity, amalgamation and interpolation properties are studied. Finally, chapters 9 and 10 are about Nilpotent Minimum logic (NM, see [8]): in chapter 9 the sets of tautologies of some NM-chains (subalgebras of [0,1]_NM) are studied, compared and the problems of axiomatization and undecidability are tackled. Chapter 10, instead, concerns some logical and algebraic properties of (propositional) Nilpotent Minimum logic. The results (or an extended version of them) of these last chapters have been also presented in papers [1, 4, 5, 2, 3]. ---------------------------------References--------------------------------------------- [1] S. Aguzzoli, M. Bianchi, and V. Marra. A temporal semantics for Basic Logic. Studia Logica, 92(2), 147-162, 2009. doi:10.1007/s11225-009-9192-3. [2] M. Bianchi. First-order Nilpotent Minimum Logics: first steps. Submitted for publication,2010. [3] M. Bianchi. On some logical and algebraic properties of Nilpotent Minimum logic and its relation with Gödel logic. Submitted for publication, 2010. [4] M. Bianchi and F. Montagna. Supersound many-valued logics and Dedekind-MacNeille completions. Arch. Math. Log., 48(8), 719-736, 2009. doi:10.1007/s00153-009-0145-3. [5] M. Bianchi and F. Montagna. n-contractive BL-logics. Arch. Math. Log., 2010. doi:10.1007/s00153-010-0213-8. [6] P. Cintula, F. Esteva, J. Gispert, L. Godo, F. Montagna, and C. Noguera. Distinguished algebraic semantics for t-norm based fuzzy logics: methods and algebraic equivalencies. Ann. Pure Appl. Log., 160(1), 53-81, 2009. doi:10.1016/j.apal.2009.01.012. [7] P. Cintula and P. Hájek. Triangular norm predicate fuzzy logics. Fuzzy Sets Syst., 161(3), 311-346, 2010. doi:10.1016/j.fss.2009.09.006. [8] F. Esteva and L. Godo. Monoidal t-norm based logic: Towards a logic for left-continuous t-norms. Fuzzy sets Syst., 124(3), 271-288, 2001. doi:10.1016/S0165-0114(01)00098-7. [9] P. Hájek. Metamathematics of Fuzzy Logic, volume 4 of Trends in Logic. Kluwer Academic Publishers, paperback edition, 1998. ISBN:9781402003707.

Spectral techniques in digital logic design have been known for more than thirty years. They have been used for Boolean function classification, disjoint decomposition, parallel and serial linear decomposition, spectral translation synthesis (extraction of linear pre- and post-filters), multiplexer synthesis, prime implicant extraction by spectral summation, threshold logic synthesis, estimation of logic complexity, testing, and state assignment. This dissertation resolves many important issues concerning the efficient application of spectral methods used in the computer-aided design of digital circuits. The main obstacles in these applications were, up to now, memory requirements for computer systems and lack of the possibility of calculating spectra directly from Boolean equations. By using the algorithms presented here these obstacles have been overcome. Moreover, the methods presented in this dissertation can be regarded as representatives of a whole family of methods and the approach presented can be easily adapted to other orthogonal transforms used in digital logic design. Algorithms are shown for Adding, Arithmetic, and Reed-Muller transforms. However, the main focus of this dissertation is on the efficient computer calculation of Rademacher-Walsh spectra of Boolean functions, since this particular ordering of Walsh transforms is most frequently used in digital logic design. A theory has been developed to calculate the Rademacher-Walsh transform from a cube array specification of incompletely specified Boolean functions. The importance of representing Boolean functions as arrays of disjoint ON- and DC- cubes has been pointed out, and an efficient new algorithm to generate disjoint cubes from non-disjoint ones has been designed. The transform algorithm makes use of the properties of an array of disjoint cubes and allows the determination of the spectral coefficients in an independent way. By such an approach each spectral coefficient can be calculated separately or all the coefficients can be calculated in parallel. These advantages are absent in the existing methods. The possibility of calculating only some coefficients is very important since there are many spectral methods in digital logic design for which the values of only a few selected coefficients are needed. Most of the current methods used in the spectral domain deal only with completely specified Boolean functions. On the other hand, all of the algorithms introduced here are valid, not only for completely specified Boolean functions, but for functions with don't cares. Don't care minterms are simply represented in the form of disjoint cubes. The links between spectral and classical methods used for designing digital circuits are described. The real meaning of spectral coefficients from Walsh and other orthogonal spectra in classical logic terms is shown. The relations presented here can be used for the calculation of different transforms. The methods are based on direct manipulations on Karnaugh maps. The conversion start with Karnaugh maps and generate the spectral coefficients. The spectral representation of multiple-valued input binary functions is proposed here for the first time. Such a representation is composed of a vector of Walsh transforms each vector is defined for one pair of the input variables of the function. The new representation has the advantage of being real-valued, thus having an easy interpretation. Since two types of codings of values of binary functions are used, two different spectra are introduced. The meaning of each spectral coefficient in classical logic terms is discussed. The mathematical relationships between the number of true, false, and don't care minterms and spectral coefficients are stated. These relationships can be used to calculate the spectral coefficients directly from the graphical representations of binary functions. Similarly to the spectral methods in classical logic design, the new spectral representation of binary functions can find applications in many problems of analysis, synthesis, and testing of circuits described by such functions. A new algorithm is shown that converts the disjoint cube representation of Boolean functions into fixed-polarity Generalized Reed-Muller Expansions (GRME). Since the known fast algorithm that generates the GRME, based on the factorization of the Reed-Muller transform matrix, always starts from the truth table (minterms) of a Boolean function, then the described method has advantages due to a smaller required computer memory. Moreover, for Boolean functions, described by only a few disjoint cubes, the method is much more efficient than the fast algorithm. By investigating a family of elementary second order matrices, new transforms of real vectors are introduced. When used for Boolean function transformations, these transforms are one-to-one mappings in a binary or ternary vector space. The concept of different polarities of the Arithmetic and Adding transforms has been introduced. New operations on matrices: horizontal, vertical, and vertical-horizontal joints (concatenations) are introduced. All previously known transforms, and those introduced in this dissertation can be characterized by two features: "ordering" and "polarity". When a transform exists for all possible polarities then it is said to be "generalized". For all of the transforms discussed, procedures are given for generalizing and defining for different orderings. The meaning of each spectral coefficient for a given transform is also presented in terms of standard logic gates. There exist six commonly used orderings of Walsh transforms: Hadamard, Rademacher, Kaczmarz, Paley, Cal-Sal, and X. By investigating the ways in which these known orderings are generated the author noticed that the same operations can be used to create some new orderings. The generation of two new Walsh transforms in Gray code orderings, from the straight binary code is shown. A recursive algorithm for the Gray code ordered Walsh transform is based on the new operator introduced in this presentation under the name of the "bi-symmetrical pseudo Kronecker product". The recursive algorithm is the basis for the flow diagram of a constant geometry fast Walsh transform in Gray code ordering. The algorithm is fast (N 10g2N additions/subtractions), computer efficient, and is implemented

Introduced by C.C. Chang in the 1950s, MV algebras are to many-valued (Łukasiewicz) logics what boolean algebras are to two-valued logic. More recently, effect algebras were introduced by physicists to describe quantum logic. In this thesis, we begin by investigating how these two structures, introduced decades apart for wildly different reasons, are intimately related in a mathematically precise way. We survey some connections between MV/effect algebras and more traditional algebraic structures. Then, we look at the categorical structure of effect algebras in depth, and in particular see how the partiality of their operations cause things to be vastly more complicated than their totally defined classical analogues. In the final chapter, we discuss coordinatization of MV algebras and prove some new theorems and construct some new concrete examples, connecting these structures up (requiring a detour through effect algebras!) to boolean inverse semigroups.

In this thesis we study particular subclasses of WNM algebras. The variety of WNM algebras forms the algebraic semantics of the WNM logic, a propositional many-valued logic that generalizes some well-known case in the setting of triangular norms logics. WNM logic lies in the hierarchy of schematic extensions of MTL, which is proven to be the logic of all left-continuous triangular norms and their residua. In this work, I have extensively studied two extensions of WNM logic, namely RDP logic and NMG logic, from the point of view of algebraic and categorical logic. We develop spectral dualities between the varieties of algebras corresponding to RDP logic and NMG logic, and suitable defined combinatorial categories. Categorical dualities allow to give algorithmic construction of products in the dual categories obtaining computable descriptions of coproducts (which are notoriously hard to compute working only in the algebraic side) for the corresponding finite algebras. As a byproduct, representation theorems for finite algebras and free finitely generated algebras in the considered varieties are obtained. This latter characterization is especially useful to provide explicit construction of a number of objects relevant from the point of view of the logical interpretation of the varieties of algebras: normal forms, strongest deductive interpolants and most general unifiers.

In recent years ternary reversible logic has caught the attention of researchers because of its enormous potential in different fields, in particular quantum computing. It is desirable that any future reversible technology should be fault tolerant and have low power consumption; hence developing testing techniques in this area is of great importance. In this work we propose a design for an online testable ternary reversible circuit. The proposed design can implement almost all of the ternary logic operations and is also capable of testing the reversible ternary network in real time (online). The error detection unit is also constructed in a reversible manner, which results in an overall circuit which meets the requirements of reversible computing. We have also proposed an upgrade of the initial design to make the design more optimized. Several ternary benchmark circuits have been implemented using the proposed approaches. The number of gates required to implement the benchmarks for each approach have also been compared. To our knowledge this is the first such circuit in ternary with integrated online testability feature.
xii, 92 leaves : ill. ; 29 cm

This thesis deals with different aspects towards many-valued unification which have been studied in the scope of category theory. The main motivation of this investigation comes from the fact that in logic programming, classical unification has been identified as the provision of coequalizers in Kleisli categories of term monads. Continuing in that direction, we have used categorical instrumentations to generalise the classical concept of a term. It is expected that this approach will provide an appropriate formal framework for useful developments of generalised terms as a basis for many-valued logic programming involving an extended notion of terms.

As a first step a concept for generalised terms has been studied. A generalised term is given by a composition of monads that again yields a monad, i.e. compositions of powerset monads with the term monad provide definitions for generalised terms. A composition of monads does, however, not always produce a monad. In this sense, techniques for monads composition provide a helpful tool for our concerns and therefore the study of these techniques has been a focus of this research.

The composition of monads make use of a lot of equations. Proofs become complicated, not to mention the challenge of understanding different steps of the equations. In this respect, we have studied visual techniques and show how a graphical approach can provide the support we need.

For the purpose of many-valued unification, similarity relations, generalised substitutions and unifiers have been defined for generalised terms.

As quantum computers edge closer to viability, it becomes necessary to create logic synthesis and minimization algorithms that take into account the particular aspects of quantum computers that differentiate them from classical computers. Since quantum computers can be functionally described as reversible computers with superposition and entanglement, both advances in reversible synthesis and increased utilization of superposition and entanglement in quantum algorithms will increase the power of quantum computing. One necessary component of any practical quantum computer is the computation of irreversible functions. However, very little work has been done on algorithms that synthesize and minimize irreversible functions into a reversible form. In this thesis, we present and implement a pair of algorithms that extend the best published solution to these problems by taking advantage of Product-Sum EXOR (PSE) gates, the reversible generalization of inhibition gates, which we have introduced in previous work [1,2]. We show that these gates, combined with our novel synthesis algorithms, result in much lower quantum costs over a wide variety of functions as compared to our competitors, especially on incompletely specified functions. Furthermore, this solution has applications for milti-valued and multi-output functions.

In 1942, Paul C. Rosenbloom put out a definition of a Post algebra after Emil L. Post published a collection of systems of many–valued logic. Post algebras became easier to handle following George Epstein’s alternative definition. As conceived by Rosenbloom, Post algebras were meant to capture the algebraic properties of Post’s systems; this fact was not verified by Rosenbloom nor Epstein and has been assumed by others in the field. In this thesis, the long–awaited demonstration of this oft–asserted assertion is given. After an elemental history of many–valued logic and a review of basic Classical Propositional Logic, the systems given by Post are introduced. The definition of a Post algebra according to Rosenbloom together with an examination of the meaning of its notation in the context of Post’s systems are given. Epstein’s definition of a Post algebra follows the necessary concepts from lattice theory, making it possible to prove that Post’s systems of many–valued logic do in fact form a Post algebra.

Orientador: Walter Alexandre Carnielli
Tese (doutorado) - Universidade Estadual de Campinas, Instituto de Filosofia e Ciências Humanas
Made available in DSpace on 2018-08-23T18:22:31Z (GMT). No. of bitstreams: 1 Matulovic_Mariana_D.pdf: 1191409 bytes, checksum: 5228f60f9fdb9f3a9df31d448de09ca2 (MD5) Previous issue date: 2013
Resumo: O presente trabalho tem por objetivo explorar, em diversas vertentes, o caráter universal de uma ferramenta poderosa de prova, apta a ser utilizada em lógicas clássicas e não clássicas, em particular em lógicas multivaloradas proposicionais (determinísticas e não-determinísticas), em lógicas paraconsistentes, em lógicas modais e na Lógica de Primeira Ordem. Trata-se do Método de Prova de Anéis de Polinômios, que também pode, em princípio, ser visto do ponto de vista da semântica algébrica, desenvolvido inicialmente em (Carnielli 2005b). O método traduz fórmulas de uma lógica específica em polinômios (em geral finitos, mas podendo ser infinitos) com coeficientes em corpos finitos, e transforma o problema de se encontrar demonstrações no correlato algébrico da busca de soluções de sistemas de equações polinomiais. Esta universalidade do método possibilita a abertura de diversas linhas de pesquisa, sendo a questão da verofuncionalidade e suas generalizações uma delas. Outras linhas de pesquisa são: possibilidades de se investigar enfoques alternativos da complexidade computacional, prova automática de teoremas, métodos heurísticos em lógica e correlações entre álgebra e lógica. Este trabalho analisa e compara sistemas de anéis de polinômios para sistemas com verofuncionalidade generalizada, como no caso das semânticas não-determinísticas, e ainda em sistemas onde a verofuncionalidade é perdida, tais como em sistemas multivalorados reduzidos a bivalorados através da conhecida redução de Suszko. O método de anéis de polinômios, além de poderoso e elegante em sua aparente simplicidade, constitui ainda um ótimo instrumento pedagógico. Em relação á lógica clássica, definimos um anel de polinômios para a Lógica de Primeira Ordem, fundamentado em um novo domínio que opera com somas e produtos infinitos, o qual se denomina domínio de séries generalizadas fechado por produtos. Finalmente, procuramos avaliar todas as potencialidades do método, principalmente no aspecto inerente á questão de se poder pensar em uma característica unificadora na medida que utiliza o mesmo viés matemático para traduzir diferentes sistemas lógicos em variedades algébricas similares. Além disso, analisamos as interrelações do método com respeito a lógica algébrica (ou álgebra da lógica), e avaliamos suas perspectivas
Abstract: This investigation aims to explore, in various aspects, the universal character of a powerful proof method, able to be used in classical and non-classical logics, in particular in propositional many-valued logics (deterministic and non- deterministic) in paraconsistent logics, in modal logics and in First Order Logic. This is the Method of Polynomial Rings, which can also be considered as an algebraic semantics, initially developed in (Carnielli 2005b). The method translates logical formulas into specific polynomials (usually finite, but sometimes infinite) with coefficients infinite fields, and transforms the problem of finding proofs in the search for solutions of systems of polynomial equations. This universality of the method enables the opening of several research lines, in particular the issue of truth-functionality and its generalizations. Other lines of research are: the possibilities of investigating alternative approaches of computational complexity, automatic theorem proving, heuristic methods in logic and correlations between algebra and logic. This study compares and analyzes the polynomial ring systems for systems with generalized truth-functionality, as in the case of non- deterministic semantic and even in systems where truth-functionality is lost, such as those many-valued systems reduced to bivalued by means of the so-called Suszko reduction. The method of polynomial rings, besides being a powerful and elegant apparatus in its apparent simplicity, is still a great teaching tool. Regarding classical logic, we define the polynomial ring for First Order Logic , based on a new domain that operates on sums and infinite products, called domain of generalized series closed under products. Finally, we evaluate the full potential of the method, especially in what concerns the question of obtaining a unifying feature that uses the same mathematical basis to translate different logical systems on similar algebraic varieties. Furthermore, we address the connections of the method with respect to algebraic logic (algebra of logic), and evaluate their perspectives
Doutorado
Filosofia
Doutora em Filosofia

This dissertation describes the development of automated synthesis algorithms that construct reversible quantum circuits for reversible functions with large number of variables. Specifically, the research area is focused on reversible, permutative and fully specified binary and ternary specifications and the applicability of the resulting circuit to the physical limitations of existing quantum technologies. Automated synthesis of arbitrary reversible specifications is an NP hard, multiobjective optimization problem, where 1) the amount of time and computational resources required to synthesize the specification, 2) the number of primitive quantum gates in the resulting circuit (quantum cost), and 3) the number of ancillary qubits (variables added to hold intermediate calculations) are all minimized while 4) the number of variables is maximized. Some of the existing algorithms in the literature ignored objective 2 by focusing on the synthesis of a single solution without the addition of any ancillary qubits while others attempted to explore every possible solution in the search space in an effort to discover the optimal solution (i.e., sacrificed objective 1 and 4). Other algorithms resorted to adding a huge number of ancillary qubits (counter to objective 3) in an effort minimize the number of primitive gates (objective 2). In this dissertation, I first introduce the MMDSN algorithm that is capable of synthesizing binary specifications up to 30 variables, does not add any ancillary variables, produces better quantum cost (8-50% improvement) than algorithms which limit their search to a single solution and within a minimal amount of time compared to algorithms which perform exhaustive search (seconds vs. hours). The MMDSN algorithm introduces an innovative method of using the Hasse diagram to construct candidate solutions that are guaranteed to be valid and then selects the solution with the minimal quantum cost out of this subset. I then introduce the Covered Set Partitions (CSP) algorithm that expands the search space of valid candidate solutions and allows for exploring solutions outside the range of MMDSN. I show a method of subdividing the expansive search landscape into smaller partitions and demonstrate the benefit of focusing on partition sizes that are around half of the number of variables (15% to 25% improvements, over MMDSN, for functions less than 12 variables, and more than 1000% improvement for functions with 12 and 13 variables). For a function of n variables, the CSP algorithm, theoretically, requires n times more to synthesize; however, by focusing on the middle k (k by MMDSN which typically yields lower quantum cost. I also show that using a Tabu search for selecting the next set of candidate from the CSP subset results in discovering solutions with even lower quantum costs (up to 10% improvement over CSP with random selection). In Chapters 9 and 10 I question the predominant methods of measuring quantum cost and its applicability to physical implementation of quantum gates and circuits. I counter the prevailing literature by introducing a new standard for measuring the performance of quantum synthesis algorithms by enforcing the Linear Nearest Neighbor Model (LNNM) constraint, which is imposed by the today's leading implementations of quantum technology. In addition to enforcing physical constraints, the new LNNM quantum cost (LNNQC) allows for a level comparison amongst all methods of synthesis; specifically, methods which add a large number of ancillary variables to ones that add no additional variables. I show that, when LNNM is enforced, the quantum cost for methods that add a large number of ancillary qubits increases significantly (up to 1200%). I also extend the Hasse based method to the ternary and I demonstrate synthesis of specifications of up to 9 ternary variables (compared to 3 ternary variables that existed in the literature). I introduce the concept of ternary precedence order and its implication on the construction of the Hasse diagram and the construction of valid candidate solutions. I also provide a case study comparing the performance of ternary logic synthesis of large functions using both a CUDA graphic processor with 1024 cores and an Intel i7 processor with 8 cores. In the process of exploring large ternary functions I introduce, to the literature, eight families of ternary benchmark functions along with a Multiple Valued file specification (the Extended Quantum Specification XQS). I also introduce a new composite quantum gate, the multiple valued Swivel gate, which swaps the information of qubits around a centrally located pivot point. In summary, my research objectives are as follows: * Explore and create automated synthesis algorithms for reversible circuits both in binary and ternary logic for large number of variables. * Study the impact of enforcing Linear Nearest Neighbor Model (LNNM) constraint for every interaction between qubits for reversible binary specifications. * Advocate for a revised metric for measuring the cost of a quantum circuit in concordance with LNNM, where, on one hand, such a metric would provide a way for balanced comparison between the various flavors of algorithms, and on the other hand, represents a realistic cost of a quantum circuit with respect to an ion trap implementation. * Establish an open source repository for sharing the results, software code and publications with the scientific community. With the dwindling expectations for a new lifeline on silicon-based technologies, quantum computations have the potential of becoming the future workhorse of computations. Similar to the automated CAD tools of classical logic, my work lays the foundation for creating automated tools for constructing quantum circuits from reversible specifications.

Es wird eine sprachliche Erweiterung der Aussagenlogik vorgeschlagen. Es handelt sich um eine Art von schwacher Negation ('disbelief'). Eine entsprechende Logik wird entwickelt. Diese wird semantisch charakterisiert. Weiterhin wird auf Schwierigkeiten hingewiesen, die bei der Axiomatisierung auftreten werden.

This study investigates six theoretical approaches offered as solutions to the paradox of the heap (sorites paradox), a logic puzzle dating back to the ancient Greek philosopher Eubulides. Those considered are: Incoherence Theory, Epistemic Theory, Supervaluation Theory, Many-Valued Logic, Fuzzy Logic, and Non-Classical Semantics. After critically examining all of these, it is concluded that none of the attempts to explain the sorites are fully adequate, and the paradox remains unresolved.
Philosophy
M.A. (Philosophy)