Results 101 to 110 of about 117,954 (285)
Bulletin of the Section of LogicA many-valued modal logic, called linear abelian modal logic \(\rm {\mathbf{LK(A)}}\) is introduced as an extension of the abelian modal logic \(\rm \mathbf{K(A)}\). Abelian modal logic \(\rm \mathbf{K(A)}\) is the minimal modal extension of the logic of
Hamzeh Mohammadi
doaj +1 more source
Hijacking emergency granulopoiesis: Neutrophil ontogeny and reprogramming in cancer
Molecular Oncology, EarlyView.Neutrophils are highly plastic innate immune cells; their functions in cancer extend beyond the tumour microenvironment. This Review summarises current understanding of neutrophil maturation and heterogeneity and highlights tumour‐induced granulopoiesis as a systemic programme that expands immature, immunosuppressive neutrophils via tumour‐derived ...
Gabriela Marinescu, Yi Feng
wiley +1 more source
IMELL Cut Elimination with Linear Overhead [PDF]
Recently, Accattoli introduced the Exponential Substitution Calculus (ESC) given by untyped proof terms for Intuitionistic Multiplicative Exponential Linear Logic (IMELL), endowed with rewriting rules at-a-distance for cut elimination. He also introduced
Accattoli, Beniamino +3 more
core +3 more sources
Molecular Oncology, EarlyView.RNA profiling of circulating extracellular vesicles (EVs) from blood samples of men undergoing prostate biopsy identifies transcripts associated with clinically significant prostate cancer. Integrative analysis with public tumor datasets links EV‐derived gene signatures to tumor stage and progression‐free survival, highlighting CASP3, XRCC2, and RIT1 ...
Stefan Werner +14 more
wiley +1 more source
A Simple Proof That Super-Consistency Implies Cut Elimination
, 2023 We give a simple and direct proof that super-consistency implies the cut elimination property in deduction modulo. This proof can be seen as a simplification of the proof that super-consistency implies proof normalization.
Dowek, Gilles, Hermant, Olivier
core
Cuts for circular proofs: semantics and cut-elimination
, 2013 One of the authors introduced in (Santocanale 2003) a calculus of circular proofs for studying the computability arising from the following categorical operations: finite products, finite coproducts, initial algebras, final coalgebras. The calculus presented (Santocanale 2003) is cut-free; even if sound and complete for provability, it lacked an ...
Jérôme Fortier, Luigi Santocanale
openaire +4 more sources
Molecular Oncology, EarlyView.Dormant cancer cells can hide in distant organs for years, evading treatment and the immune system. This review highlights how signals from the surrounding tissue and immune environment keep these cells inactive or trigger their reawakening. Understanding these mechanisms may help develop therapies to eliminate or control dormant cells and prevent ...
Kanishka Tiwary +1 more
wiley +1 more source
Algebraic proofs of cut elimination
, 2008 Algebraic proofs of the cut-elimination theorems for classical and intuitionistic logic are presented, and are used to show how one can sometimes extract a constructive proof and an algorithm from a proof that is nonconstructive.
Jeremy Avigad
core
Molecular Oncology, EarlyView.Combining osimertinib with the STING agonist ADU‐S100 activates innate and adaptive immunity to overcome the non‐inflamed microenvironment of Egfr‐mutant lung cancer. This combination increases NK and CD8+ T‐cell infiltration, associated with activation of the STING‐IRF3 pathway and local immunogenic cell death.
Jun Nishimura +19 more
wiley +1 more source
On cut elimination in the presence of perice rule
Archiv für Mathematische Logik und Grundlagenforschung, 1987 If the classical predicate logic is formulated in a sequent calculus, say LJP, by adding the so-called Peirce rule to Gentzen's intuitionistic LJ, the commonly known proof form of cut elimination for the system cannot be formalized in primitive recursive arithmetic.
openaire +1 more source