Results 21 to 30 of about 3,086 (177)
Dynamic Separation Logic and its Use in Education
Mathematical logic is widely used in hardware and software verification. Hoare logic is particularly suitable for reasoning about imperative programs.
Evgeny Makarov
doaj +1 more source
Remarks on an algebraic semantics for paraconsistent Nelson's logic
In the paper Busaniche and Cignoli (2009) we presented a quasivariety of commutative residuated lattices, called NPc-lattices, that serves as an algebraic semantics for paraconsistent Nelson's logic.
Manuela Busaniche, Roberto Cignoli
doaj +1 more source
On structures in hypergraphs of models of a theory [PDF]
We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types of models of ...
Kulpeshov, Beibut, Sudoplatov, Sergey
core +3 more sources
Inconsistency, paraconsistency and ω-inconsistency [PDF]
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
An Alternative Natural Deduction for the Intuitionistic Propositional Logic [PDF]
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
Proof complexity of substructural logics
34 ...
openaire +3 more sources
Modal translation of substructural logics [PDF]
In an article dating back in 1992, Kosta Došen initiated a project of modal translations in substructural logics, aiming at generalizing the well-known Gödel-McKinsey-Tarski translation of intuitionistic logic into {\bf S4}. Došen's translation worked well for (variants of) {\bf BCI} and stronger systems ({\bf BCW}, {\bf BCK}), but not for systems ...
openaire +2 more sources
Classical and Intuitionistic Subexponential Logics are Equally Expressive [PDF]
International audienceIt is standard to regard the intuitionistic restriction of a classical logic as increasing the expressivity of the logic because the classical logic can be adequately represented in the intuitionistic logic by double-negation, while
C. Liang +6 more
core +5 more sources
Uniqueness Typing for Resource Management in Message-Passing Concurrency [PDF]
We view channels as the main form of resources in a message-passing programming paradigm. These channels need to be carefully managed in settings where resources are scarce.
Adrian Francalanza +28 more
core +5 more sources
What is a Paraconsistent Logic? [PDF]
Paraconsistent logics are logical systems that reject the classical principle, usually dubbed Explosion, that a contradiction implies everything. However, the received view about paraconsistency focuses only the inferential version of Explosion, which is
Alexej Pynko +30 more
core +1 more source

