Results 31 to 40 of about 2,597 (173)
Canonical formulas for k-potent commutative, integral, residuated lattices
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 +2 more
core +1 more source
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
COLLECTION FRAMES FOR DISTRIBUTIVE SUBSTRUCTURAL LOGICS
AbstractWe present a new frame semantics for positive relevant and substructural propositional logics. This frame semantics is both a generalisation of Routley–Meyer ternary frames and a simplification of them. The key innovation of this semantics is the use of a single accessibility relation to relate collections of points to points.
GREG RESTALL, SHAWN STANDEFER
openaire +3 more sources
Singly generated quasivarieties and residuated structures [PDF]
A quasivariety K of algebras has the joint embedding property (JEP) iff it is generated by a single algebra A. It is structurally complete iff the free countably generated algebra in K can serve as A.
Anderson A. R. +25 more
core +2 more sources
Meeting strength in substructural logics [PDF]
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
This study repurposes mitochondrial DNA mutations as endogenous barcodes for lineage tracing in human pluripotent stem cell‐derived organoids. Integrated with transcriptomic and spatial data, it reveals NOTCH‐mediated stromal‐progenitor crosstalk orchestrates clonal dynamics and spatial zonation during early hematopoietic development, offering a non ...
Yan Xue +17 more
wiley +1 more source
A graph-theoretic account of logics [PDF]
A graph-theoretic account of logics is explored based on the general notion of m-graph (that is, a graph where each edge can have a finite sequence of nodes as source).
Coniglio, Marcelo E. +3 more
core +2 more sources
Semi-Substructural Logics à la Lambek [PDF]
This work studies the proof theory of left (right) skew monoidal closed categories and skew monoidal bi-closed categories from the perspective of non-associative Lambek calculus. Skew monoidal closed categories represent a relaxed version of monoidal closed categories, where the structural laws are not invertible; instead, they are natural ...
Cheng-Syuan Wan
openalex +3 more sources
Predictive models successfully screen nanoparticles for toxicity and cellular uptake. Yet, complex biological dynamics and sparse, nonstandardized data limit their accuracy. The field urgently needs integrated artificial intelligence/machine learning, systems biology, and open‐access data protocols to bridge the gap between materials science and safe ...
Mariya L. Ivanova +4 more
wiley +1 more source
Sequent Systems for Consequence Relations of Cyclic Linear Logics
Linear Logic is a versatile framework with diverse applications in computer science and mathematics. One intriguing fragment of Linear Logic is Multiplicative-Additive Linear Logic (MALL), which forms the exponential-free component of the larger ...
Paweł Płaczek
doaj +1 more source

