Abstract In this paper we will consider the existing notions of bilateralism in context proof-theoretic semantics and propose, based on our understanding bilateralism, an extension to logical multilateralism. This approach differs from what has been proposed under name before that do not multiple speech acts as core such a theory but rather consequence relations. We argue for aim most beneficia...

There are many reasons why a computer scientist should study logic. For example, logic underlies the reasoning in mathematical statements. In particular, proving that a program meets its specification is argued with the help of logical deductions. We begin by studying propositional logic, which is one of the simplest logical theories. Nevertheless, propositional logic has a large number of appl...

This paper presents LEOPARD, a Logical Effort-based fanout OPtimizer for ARea and Delay, which relies on the availability of a (near) continuous size buffer library. Based on the concept of logical effort in VLSI circuits, the proposed algorithm attempts to minimize the total buffer area under the required time and input capacitance constraints by constructing the fanout tree topology and assig...

We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard (AES) and analyze the quantum resources required to carry out such an attack. We consider the overall circuit size, the number of qubits, and the circuit depth as measures for the cost of the presented quantum algorithms. Throughout, we focus on Clifford+T gates as the underlying fault-toleran...

Irreversible information processing cannot be carried out without some inevitable thermodynamical work cost. This fundamental restriction, known as Landauer's principle, is increasingly relevant today, as the energy dissipation of computing devices impedes the development of their performance. Here we determine the minimal work required to carry out any logical process, for instance a computati...