Results 51 to 60 of about 3,702,791 (303)

On the Lambek Calculus with an Exchange Modality [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2019
In this paper we introduce Commutative/Non-Commutative Logic (CNC logic) and two categorical models for CNC logic. This work abstracts Benton's Linear/Non-Linear Logic by removing the existence of the exchange structural rule.
Jiaming Jiang   +2 more
doaj   +1 more source

Single‐cell DNA methylation profiling: Technologies, computation, and applications in precision oncology

open access: yesMolecular Oncology, EarlyView.
Single‐cell DNA methylation (scDNAme) profiling maps epimutational clonal evolution, revealing mechanisms of malignancy and therapeutic resistance across diverse cancer types. By providing a high‐resolution landscape of intratumoral heterogeneity, these technologies empower precise patient stratification, guide the development of enhanced ...
Ik Soo Kim
wiley   +1 more source

Undecidability of Multiplicative Subexponential Logic [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2015
Subexponential logic is a variant of linear logic with a family of exponential connectives—called subexponentials—that are indexed and arranged in a pre-order. Each subexponential has or lacks associated structural properties of weakening and contraction.
Kaustuv Chaudhuri
doaj   +1 more source

Targeting transcription factors associated with hemoglobinopathies: Lessons from successful interventions and implications for cancer

open access: yesMolecular Oncology, EarlyView.
This review summarizes the transcription factors, repressive chromatin‐modifying complexes, and epigenetic mechanisms that control fetal hemoglobin repression. Notably, many regulators of γ‐globin silencing also function in transcriptional and epigenetic networks that drive cancer, highlighting opportunities to translate advances in hemoglobinopathy ...
Meigen Yu   +3 more
wiley   +1 more source

Two-Variable Logic with Two Order Relations [PDF]

open access: yesLogical Methods in Computer Science, 2012
It is shown that the finite satisfiability problem for two-variable logic over structures with one total preorder relation, its induced successor relation, one linear order relation and some further unary relations is EXPSPACE-complete.
Thomas Schwentick, Thomas Zeume
doaj   +1 more source

Simulating Linear Logic in 1-Only Linear Logic

open access: yesCoRR, 2017
Here is a copy of CNRS, Laboratoire de Mathematiques Discretes Pretirage no 94-02 January 28 ...
openaire   +3 more sources

Linear Logic Properly Displayed

open access: yesACM Transactions on Computational Logic, 2023
We introduce proper display calculi for intuitionistic, bi-intuitionistic and classical linear logics with exponentials, which are sound, complete, conservative, and enjoy cut elimination and subformula property. Based on the same design, we introduce a variant of Lambek calculus with exponentials, aimed at capturing the controlled ...
Giuseppe Greco 0001   +1 more
openaire   +3 more sources

Arginine methylation as a regulatory ratchet in cancer: From substrate selection to malignant‐state stabilization

open access: yesMolecular Oncology, EarlyView.
Arginine methylation can be viewed as a persistence‐prone post‐translational modification regulated by a network of PRMTs. Competitive and compensatory interactions among PRMTs can redistribute methylation across substrate pools shaped by sequence, structural, spatial, and environmental layers, reinforcing RNA‐processing, chromatin, and signaling ...
So Hyun Kwon, Ji Min Lee
wiley   +1 more source

Socratic Proofs for Propositional Linear-Time Logic [PDF]

open access: yes, 2014
This paper presents a calculus of Socratic proofs for Propositional Linear-Time Logic (PLTL) and discusses potential automation of its proof ...
Bolotov, A.   +3 more
core  

Review: "An Algebraic Study of Tense Logic with Linear Time," by R. A. Bull [PDF]

open access: yes, 1971
Publisher's, offprint versionIn these papers (the second of which is principally a correction and adumbration of the first) Bull constructs algebraic semantics which provide completeness theorems for three prepositional tense logics for linear time ...
Cocchiarella, Nino
core   +1 more source

Home - About - Disclaimer - Privacy