Results 41 to 50 of about 53,090 (266)
Thin Games with Symmetry and Concurrent Hyland-Ong Games [PDF]
Logical Methods in Computer Science, 2019 We build a cartesian closed category, called Cho, based on event structures. It allows an interpretation of higher-order stateful concurrent programs that is refined and precise: on the one hand it is conservative with respect to standard Hyland-Ong ...
Simon Castellan +2 more
doaj +1 more source
The Pebble-Relation Comonad in Finite Model Theory [PDF]
Logical Methods in Computer ScienceThe pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory.
Yoàv Montacute, Nihil Shah
doaj +1 more source
Applicable Mathematics in a Minimal Computational Theory of Sets [PDF]
Logical Methods in Computer Science, 2018 In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.
Arnon Avron, Liron Cohen
doaj +1 more source
Completions of Kleene's second model [PDF]
Logical Methods in Computer ScienceWe investigate completions of partial combinatory algebras (pcas), in particular of Kleene's second model $\mathcal{K}_2$ and generalizations thereof. We consider weak and strong notions of embeddability and completion that have been studied before in ...
Sebastiaan A. Terwijn
doaj +1 more source
Deciding Equations in the Time Warp Algebra [PDF]
Logical Methods in Computer ScienceJoin-preserving maps on the discrete time scale $\omega^+$, referred to as time warps, have been proposed as graded modalities that can be used to quantify the growth of information in the course of program execution. The set of time warps forms a simple
Sam van Gool +3 more
doaj +1 more source
Computability of 1-manifolds [PDF]
Logical Methods in Computer Science, 2014 A semi-computable set S in a computable metric space need not be computable. However, in some cases, if S has certain topological properties, we can conclude that S is computable.
Konrad Burnik, Zvonko Iljazovic
doaj +1 more source
Artificial molecular machines and motors—Design and control of nanoscale motion
FEBS Letters, EarlyView.Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley +1 more source
Unsolvability Cores in Classification Problems [PDF]
Logical Methods in Computer Science, 2014 Classification problems have been introduced by M. Ziegler as a generalization of promise problems. In this paper we are concerned with solvability and unsolvability questions with respect to a given set or language family, especially with cores of ...
Hermann K. -G. Walter, Ulrike Brandt
doaj +1 more source
Loss of IGF‐1R impairs DNA‐PKcs recruitment to chromatin leading to defective end‐joining
Molecular Oncology, EarlyView.IGF‐1R promotes radioresistance by facilitating DNA‐PKcs recruitment to chromatin, enabling non‐homologous end‐joining (NHEJ) repair of double‐strand breaks. Inhibition or loss of IGF‐1R disrupts this recruitment to damage sites, driving compensatory reliance on microhomology‐mediated end‐joining (MMEJ) repair.
Matthew O. Ellis +3 more
wiley +1 more source
Logical Methods in Computer Science, 2013 Almost all representations considered in computable analysis are partial. We provide arguments in favor of total representations (by elements of the Baire space).
Victor Selivanov
doaj +1 more source