Results 21 to 30 of about 2,358 (145)

Basic Logic and Quantum Entanglement [PDF]

, 2006
As it is well known, quantum entanglement is one of the most important features of quantum computing, as it leads to massive quantum parallelism, hence to exponential computational speed-up.
Battilotti G, Bell J S, Birkhoff G, Gentzen G, Jozsa R, Nielsen M A, P A Zizzi, Zizzi P   +7 more
core   +2 more sources

Proof complexity of substructural logics

Annals of Pure and Applied Logic, 2021
34 ...
openaire   +3 more sources

An Alternative Natural Deduction for the Intuitionistic Propositional Logic [PDF]

, 2016
A natural deduction system NI, for the full propositional intuitionistic logic, is proposed. The operational rules of NI are obtained by the translation from Gentzen’s calculus LJ and the normalization is proved, via translations from sequent calculus ...
Ilić, Mirjana
core   +1 more source

Inconsistency, paraconsistency and ω-inconsistency [PDF]

, 2018
In this paper I'll explore the relation between ω-inconsistency and plain inconsistency, in the context of theories that intend to capture semantic concepts. In particular, I'll focus on two very well known inconsistent but non-trivial theories of truth:
Da Re, Bruno
core   +2 more sources

A substructural logic for layered graphs [PDF]

Journal of Logic and Computation, 2014
Complex systems, be they natural or synthetic, are ubiquitous. In particular, complex networks of devices and services underpin most of society's operations. By their very nature, such systems are difficult to conceptualize and reason about effectively.
Collinson, M, McDonald, K, Pym, D
openaire   +2 more sources

A Van Benthem Characterization Result for Distribution-Free Logics

Logics
This article contributes to recent results in the model theory of distribution-free logics (which include a Goldblatt-Thomason theorem and a development of their Sahlqvist theory) by lifting van Benthem’s characterization result for modal logic to the ...
Chrysafis Hartonas
doaj   +1 more source

Canonical formulas for k-potent commutative, integral, residuated lattices

, 2016
Canonical formulas are a powerful tool for studying intuitionistic and modal logics. Actually, they provide a uniform and semantic way to axiomatise all extensions of intuitionistic logic and all modal logics above K4.
Bezhanishvili, Nick, Galatos, Nick, Spada, Luca   +2 more
core   +1 more source

Classical BI: Its Semantics and Proof Theory [PDF]

, 2009
We present Classical BI (CBI), a new addition to the family of bunched logics which originates in O'Hearn and Pym's logic of bunched implications BI.
Alasdair Urquhart, Cristiano Calcagno, D. Galmiche, D. Mery, and D. Pym, D.J. Foulis and M.K. Bennett, David Pym, Peter O'Hearn, and Hongse, Greg Restall, Harold Schellinx, James Brotherston, Matthew Collinson, David Pym, and Edmund, Michael Dunn, Nick Benton, Nuel D. {Belnap, Jr., Peter W. O'Hearn and David J. Pym, Rajeev Goré, Richard Routley and Valerie Routley, Robert K. Meyer and Richard Routley, Robert K. Meyer and Richard Routley, Samson Abramsky   +17 more
core   +5 more sources

An Abstract Approach to Consequence Relations

, 2019
We generalise the Blok-J\'onsson account of structural consequence relations, later developed by Galatos, Tsinakis and other authors, in such a way as to naturally accommodate multiset consequence.
Cintula, Petr, Férez, José Gil, Moraschini, Tommaso, Paoli, Francesco   +3 more
core   +1 more source

Substructural logic and partial correctness [PDF]

ACM Transactions on Computational Logic, 2003
We formulate a noncommutative sequent calculus for partial correctness that subsumes propositional Hoare Logic. Partial correctness assertions are represented by intuitionistic linear implication. We prove soundness and completeness over relational and trace models.
Dexter Kozen, Jerzy Tiuryn
openaire   +1 more source