Results 131 to 140 of about 658,878 (281)
Automata, Resolution, and Cut-elimination
Automata, Resolution, and Cut-elimination are three methods to prove the decidability of provability in various logics. The goal of this paper is to understand the relation between these three methods, using Alternating pushdown systems as a unifying ...
Dowek, Gilles +2 more
core
ERα splice variant ERα∆7 lacks the C‐terminus, and its expression may change phenotypes of breast cancers. Our results showed that ERα∆7 is found in the luminal A subtype, and elevated ERα∆7 levels are linked to improved cell survival with lower proliferation and migration.
Long Wai Tsui +10 more
wiley +1 more source
This study investigated a novel WST‐8‐based assay for evaluating d‐Amino acid oxidase (DAO) inhibitors. We confirmed its effectiveness using known inhibitors and found that uremic toxins possess relatively weak inhibitory activity compared to existing drugs.
Kahoko Miyake +4 more
wiley +1 more source
Matrix metalloproteinase‐9 (MMP9) drives ovarian cancer progression. Using MMP9‐null cells (M9‐KO) created from ovarian cancer cells, we found MMP9 loss did not block Epidermal Growth Factor (EGF)‐driven E‐cadherin dissolution or EMT but delayed and reduced EGF‐driven membrane protrusions. Transient MMP9 re‐expression drove membrane protrusion.
Claire Strauel +8 more
wiley +1 more source
Mechanising cut-elimination for display logic [PDF]
We describe a deep embedding of the display calculus ÆRA, for relation algebras, using Isabelle/HOL. We then describe how the embedding was used to formalise a cut-elimination theorem for ÆRA. Our implementation generalises easily to handle other display
Dawson, Jeremy, Gore, Rajeev
core
Cytosolically synthesized chloroplast preproteins are translocated across the outer and inner envelope membranes through translocons called TOC and TIC, respectively. In green algae and plants, the TIC core is composed of essential membrane proteins, Tic12, Tic20, and Tic214.
Mengyi Li, Xueyang Zhao, Masato Nakai
wiley +1 more source
Cut Elimination in Propositional Based Logics
. Sufficient conditions for sequent calculi for propositional based logics to enjoy cut elimination are established. These conditions are satisfied by a wide class of sequent calculi encompassing among others calculi for classical and intuitionistic ...
J. Rasga
core
Elimination of structure controlled highwall failures at an open cut coal mine [PDF]
Jianping Li
openalex +1 more source
This study explores the feasibility of expressing the antitumoral protein Amblyomin‐X through a suicide gene therapy approach and investigates its intracellular fate after gene delivery. Although the gene is efficiently expressed, melanoma cells rapidly degrade the Amblyomin‐X protein via proteasome activity.
Victor Dal Posolo Cinel +4 more
wiley +1 more source
Aspects of the Cut-Elimination Theorem
I give a proof of the cut-elimination theorem (Gentzen's Hauptsatz ) for an intuitionistic multi-succedent calculus. The proof follows the strategy of eliminating topmost maximal-rank cuts that allows for a straightforward way to measure the upper bound ...
Rýdl, Jiří
core

