Results 31 to 40 of about 82,622 (268)
Theoretical Computer Science, 1987 The paper contains, in reverse order, (A) a substantial contribution to proof theory, and (B) speculations on using proofs as parts of programs, interspersed by (C) diverse relations to the (logical) literature. Here are a few samples from this, at least, for the reviewer, very readable paper.
openaire +2 more sources
Linear Temporal Logic for Regular Cost Functions [PDF]
Logical Methods in Computer Science, 2014 Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties.
Denis Kuperberg
doaj +1 more source
Linear logic as a logic of computations
Annals of Pure and Applied Logic, 1994 The author gives a complete computational interpretation of several initial fragments of linear logic and, based on this interpretation, establishes precisely the complexity level of these fragments. He begins with the !-Horn fragment of linear logic, which uses only positive literals, the linear implication, the tensor product \(\otimes\) and the ...
openaire +1 more source
A note on the expressive power of linear orders [PDF]
Logical Methods in Computer Science, 2011 This article shows that there exist two particular linear orders such that first-order logic with these two linear orders has the same expressive power as first-order logic with the Bit-predicate FO(Bit). As a corollary we obtain that there also exists a
Thomas Schwentick, Nicole Schweikardt
doaj +1 more source
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Information and Computation, 1995 This paper draws the main ``boulevards'' of a logical approach to complexity, based on the idea that the expressive power of a logical system is the complexity of its cut-elimination procedure. A very careful handling of Linear Logic (LL) exponentials leads the author to define a weak LL (the ``Light Linear Logic'' LLL), for which he proves the ...
openaire +2 more sources
The ubiquitin‐proteasome system and autophagy as guardians of the cellular proteome
FEBS Letters, EarlyView.This Perspective covers the three principles governing the crosstalk between the ubiquitin‐proteasome system and autophagy in cellular proteostasis: (1) a shared ubiquitin code routing substrates via shuttle factors or autophagy receptors; (2) spatial compartmentalization into phase‐separated degradation hubs and organelle‐specific modules (exemplified
Ivan Dikic
wiley +1 more source
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
Automata Linear Dynamic Logic on Finite Traces [PDF]
Logical Methods in Computer ScienceTemporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity.
Kevin W. Smith, Moshe Y. Vardi
doaj +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source