Results 71 to 80 of about 14,982 (276)
Towards a canonical classical natural deduction system [PDF]
, 2012 Preprint submitted to Elsevier, 6 July 2012This paper studies a new classical natural deduction system, presented as a typed calculus named lambda-mu- let.
Ariola +33 more
core +2 more sources
In situ molecular organization and heterogeneity of the Legionella Dot/Icm T4SS
FEBS Letters, EarlyView.We present a nearly complete in situ model of the Legionella Dot/Icm type IV secretion system, revealing its central secretion channel and identifying new components. Using cryo‐electron tomography with AI‐based modeling, our work highlights the structure, variability, and mechanism of this complex nanomachine, advancing understanding of bacterial ...
Przemysław Dutka +11 more
wiley +1 more source
Interaction and Depth against Nondeterminism in Proof Search [PDF]
Logical Methods in Computer Science, 2014 Deep inference is a proof theoretic methodology that generalizes the standard notion of inference of the sequent calculus, whereby inference rules become applicable at any depth inside logical expressions.
Ozan Kahramanogullari
doaj +1 more source
Semi-Axiomatic Sequent Calculus
, 2020 We present the semi-axiomatic sequent calculus (SAX) that blends features of Gentzen’s sequent calculus with an axiomatic formulation of intuitionistic logic. We develop and prove a suitable analogue to cut elimination and then show that a natural computational interpretation of SAX provides a simple form of shared memory concurrency.
DeYoung, Henry +2 more
openaire +2 more sources
Sequence determinants of RNA G‐quadruplex unfolding by Arg‐rich regions
FEBS Letters, EarlyView.We show that Arg‐rich peptides selectively unfold RNA G‐quadruplexes, but not RNA stem‐loops or DNA/RNA duplexes. This length‐dependent activity is inhibited by acidic residues and is conserved among SR and SR‐related proteins (SRSF1, SRSF3, SRSF9, U1‐70K, and U2AF1).
Naiduwadura Ivon Upekala De Silva +10 more
wiley +1 more source
Loop-check free sequent calculi for unary fragment of temporal logic
Lietuvos Matematikos RinkinysThis paper explores the construction of an efficient sequent calculus for a selected fragment of porpositional linear temporal logic (PLTL), extending the ideas of classical calculi discussed in [1], and builds upon previous investigations into the ...
Lukas Maksimiak, Adomas Birštunas
doaj +1 more source
A Proof Theoretic Analysis of Intruder Theories [PDF]
Logical Methods in Computer Science, 2010 We consider the problem of intruder deduction in security protocol analysis: that is, deciding whether a given message M can be deduced from a set of messages Gamma under the theory of blind signatures and arbitrary convergent equational theories modulo ...
Alwen F Tiu, Rajeev Gore, Jeremy Dawson
doaj +1 more source
FEBS Letters, EarlyView.The Ile181Asn variant of human UDP‐xylose synthase (hUXS1), associated with a short‐stature genetic syndrome, has previously been reported as inactive. Our findings demonstrate that Ile181Asn‐hUXS1 retains catalytic activity similar to the wild‐type but exhibits reduced stability, a looser oligomeric state, and an increased tendency to precipitate ...
Tuo Li +2 more
wiley +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
Grouping based calculus for propositional linear temporal logic
Lietuvos Matematikos RinkinysIn this paper, the authors research the problem of loops in linear temporal logic PLTL. The task involves defining the standard rule application process for the derivation procedure (as used in [4] and [5]), determining and proving properties for the ...
Kostas Ragauskas, Adomas Birštunas
doaj +3 more sources