A Classical Propositional Logic for Reasoning About Reversible Logic Circuits
From MaRDI portal
Publication:2820684
DOI10.1007/978-3-662-52921-8_4zbMath1478.68084OpenAlexW2489308093WikidataQ62038212 ScholiaQ62038212MaRDI QIDQ2820684
Robin Kaarsgaard, Holger Bock Axelsen, Robert Glück
Publication date: 9 September 2016
Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-662-52921-8_4
Classical propositional logic (03B05) Switching theory, applications of Boolean algebras to circuits and networks (94C11) Networks and circuits as models of computation; circuit complexity (68Q06) Quantum gates (81P65)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- \(\mathcal{MOQA}\); unlocking the potential of compositional static average-case analysis
- The geometry of tensor calculus. I
- Handbook of proof theory
- Categorical logic and type theory
- Braided tensor categories
- White Dots do Matter: Rewriting Reversible Logic Circuits
- Reversible Computing
- Reversible arithmetic logic unit for quantum arithmetic
- Towards a Design Flow for Reversible Logic
- Irreversibility and Heat Generation in the Computing Process