Catalogue Search | MBRL
Are you sure you want to remove the book from the shelf?
{{itemTitle}}
2,392
result(s) for
"Abstract logic"
Sort by:
Scaling Up Digital Circuit Computation with DNA Strand Displacement Cascades
To construct sophisticated biochemical circuits from scratch, one needs to understand how simple the building blocks can be and how robustly such circuits can scale up. Using a simple DNA reaction mechanism based on a reversible strand displacement process, we experimentally demonstrated several digital logic circuits, culminating in a four-bit square-root circuit that comprises 130 DNA strands. These multilayer circuits include thresholding and catalysis within every logical operation to perform digital signal restoration, which enables fast and reliable function in large circuits with roughly constant switching time and linear signal propagation delays. The design naturally incorporates other crucial elements for large-scale circuitry, such as general debugging tools, parallel circuit preparation, and an abstraction hierarchy supported by an automated circuit compiler.
Journal Article
On the Deductive System of the Order of an Equationally Orderable Quasivariety
We consider the equationally orderable quasivarieties and associate with them deductive systems defined using the order. The method of definition of these deductive systems encompasses the definition of logics preserving degrees of truth we find in the research areas of substructural logics and mathematical fuzzy logic. We prove several general results, for example that the deductive systems so defined are finitary and that the ones associated with equationally orderable varieties are congruential.
Journal Article
Gentzen-Style Sequent Calculus for Semi-intuitionistic Logic
The variety Sℋ of semi-Heyting algebras was introduced by H. P. Sankappanavar (in: Proceedings of the 9th \"Dr. Antonio A. R. Monteiro\" Congress, Universidad Nacional del Sur, Bahía Blanca, 2008) [13] as an abstraction of the variety of Heyting algebras. Semi-Heyting algebras are the algebraic models for a logic HsH, known as semi-intuitionistic logic, which is equivalent to the one defined by a Hilbert style calculus in Cornejo (Studia Logica 98(1-2): 9-25, 2011) [6]. In this article we introduce a Gentzen style sequent calculus GsH for the semi-intuitionistic logic whose associated logic GsH is the same as HsH. The advantage of this presentation of the logic is that we can prove a cutelimination theorem for GsH that allows us to prove the decidability of the logic. As a direct consequence, we also obtain the decidability of the equational theory of semi-Heyting algebras.
Journal Article
Constructing Natural Extensions of Propositional Logics
The proofs of some results of abstract algebraic logic, in particular of the transfer principle of Czelakowski, assume the existence of so-called natural extensions of a logic by a set of new variables. Various constructions of natural extensions, claimed to be equivalent, may be found in the literature. In particular, these include a syntactic construction due to Shoesmith and Smiley and a related construction due to Loś and Suszko. However, it was recently observed by Cintula and Noguera that both of these constructions fail in the sense that they do not necessarily yield a logic. Here we show that whenever the Loś-Suszko construction yields a logic, so does the Shoesmith-Smiley construction, but not vice versa. We also describe the smallest and the largest conservative extension of a logic by a set of new variables and show that contrary to some previous claims in the literature, a logic of cardinality k may have more than one conservative extension of cardinality k by a set of new variables. In this connection we then correct a mistake in the formulation of a theorem of Dellunde and Jansana.
Journal Article
What Is a Non-Truth-Functional Logic?
What is the fundamental insight behind truth-functionality? When is a logic interpretable by way of a truth-functional semantics? To address such questions in a satisfactory way, a formal definition of truth-functionality from the point of view of abstract logics is clearly called for. As a matter of fact, such a definition has been available at least since the 70s, though to this day it still remains not very widely well-known. A clear distinction can be drawn between logics characterizable through: (1) genuinely finite-valued truth-tabular semantics; (2) no finite-valued but only an infinite-valued truthtabular semantics; (3) no truth-tabular semantics at all. Any of those logics, however, can in principle be characterized through non-truth-functional valuation semantics, at least as soon as their associated consequence relations respect the usual tarskian postulates. So, paradoxical as that might seem at first, it turns out that truth-functional logics may be adequately characterized by non-truth-functional semantics. Now, what feature of a given logic would guarantee it to dwell in class (1) or in class (2), irrespective of its circumstantial semantic characterization? The present contribution will recall and examine the basic definitions, presuppositions and results concerning truth-functionality of logics, and exhibit examples of logics indigenous to each of the aforementioned classes. Some problems pertaining to those definitions and to some of their conceivable generalizations will also be touched upon.
Journal Article
BK-lattices. Algebraic Semantics for Belnapian Modal Logics
Earlier algebraic semantics for Belnapian modal logics were defined in terms of twist-structures over modal algebras. In this paper we introduce the class of BK-lattices, show that this class coincides with the abstract closure of the class of twist-structures, and it forms a variety. We prove that the lattice of subvarieties of the variety of BK-lattices is dually isomorphic to the lattice of extensions of Belnapian modal logic BK. Finally, we describe invariants determining a twist-structure over a modal algebra.
Journal Article
Logic reversibility and thermodynamic irreversibility demonstrated by DNAzyme-based Toffoli and Fredkin logic gates
The Toffoli and Fredkin gates were suggested as a means to exhibit logic reversibility and thereby reduce energy dissipation associated with logic operations in dense computing circuits. We present a construction of the logically reversible Toffoli and Fredkin gates by implementing a library of predesigned Mg ²⁺-dependent DNAzymes and their respective substrates. Although the logical reversibility, for which each set of inputs uniquely correlates to a set of outputs, is demonstrated, the systems manifest thermodynamic irreversibility originating from two quite distinct and nonrelated phenomena. (i) The physical readout of the gates is by fluorescence that depletes the population of the final state of the machine. This irreversible, heat-releasing process is needed for the generation of the output. (ii) The DNAzyme-powered logic gates are made to operate at a finite rate by invoking downhill energy-releasing processes. Even though the three bits of Toffoli’s and Fredkin’s logically reversible gates manifest thermodynamic irreversibility, we suggest that these gates could have important practical implication in future nanomedicine.
Journal Article
Categorical Abstract Algebraic Logic: Behavioral π-Institutions
Recently, Caleiro, Gonçalves and Martins introduced the notion of behaviorally algebraizable logic. The main idea behind their work is to replace, in the traditional theory of algebraizability of Blok and Pigozzi, unsorted equational logic with multi-sorted behavioral logic. The new notion accommodates logics over many-sorted languages and with non-truth-functional connectives. Moreover, it treats logics that are not algebraizable in the traditional sense while, at the same time, shedding new light to the equivalent algebraic semantics of logics that are algebraizable according to the original theory. In this paper, the notion of an abstract multi-sorted π-institution is introduced so as to transfer elements of the theory of behavioral algebraizability to the categorical setting. Institutions formalize a wider variety of logics than deductive systems, including logics involving multiple signatures and quantifiers. The framework developed has the same relation to behavioral algebraizability as the classical categorical abstract algebraic logic framework has to the original theory of algebraizability of Blok and Pigozzi.
Journal Article
Update to \A Survey of Abstract Algebraic Logic\
A definition and some inaccurate cross-references in the paper A Survey of Abstract Algebraic Logic, which might confuse some readers, are clarified and corrected; a short discussion of the main one is included. We also update a dozen of bibliographic references.
Journal Article