Results 11 to 20 of about 1,184,149 (273)
Aggressive Behavior, Volume 49, Issue 1, Page 5-14, January 2023., 2023 Abstract This study uses longitudinal data from the UK Millennium Cohort Study (N = 13,277) to examine the childhood and early adolescence factors that predict weapon involvement in middle adolescence, which in this study is exemplified by having carried or used a weapon.
Aase Villadsen, Emla Fitzsimons
wiley +1 more source
On the meaning of logical completeness [PDF]
Logical Methods in Computer Science, 2010 Goedel's completeness theorem is concerned with provability, while Girard's theorem in ludics (as well as full completeness theorems in game semantics) are concerned with proofs.
Michele Basaldella, Kazushige Terui
doaj +1 more source
Failure Trace Semantics for a Process Algebra with Time-outs [PDF]
Logical Methods in Computer Science, 2021 This paper extends a standard process algebra with a time-out operator, thereby increasing its absolute expressiveness, while remaining within the realm of untimed process algebra, in the sense that the progress of time is not quantified.
Rob van Glabbeek
doaj +1 more source
Journal of Applied Clinical Medical Physics, Volume 23, Issue 12, December 2022., 2022 Abstract Purpose A set of treatment planning strategies were designed and retrospectively implemented for locally advanced, non‐small cell lung cancer (NSCLC) patients in order to minimize cardiac dose without compromising target coverage goals. Methods Retrospective analysis was performed for 20 NSCLC patients prescribed to 60–66 Gy that received a ...
Joshua P. Kim +5 more
wiley +1 more source
Algebraic Notions of Termination [PDF]
Logical Methods in Computer Science, 2011 Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation.
Desharnais Jules +2 more
doaj +1 more source
Psi-calculi: a framework for mobile processes with nominal data and logic [PDF]
Logical Methods in Computer Science, 2011 The framework of psi-calculi extends the pi-calculus with nominal datatypes for data structures and for logical assertions and conditions. These can be transmitted between processes and their names can be statically scoped as in the standard pi-calculus.
Jesper Bengtson +3 more
doaj +1 more source
Knowledge-Based Synthesis of Distributed Systems Using Event Structures [PDF]
Logical Methods in Computer Science, 2011 To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification exists. This process is particularly effective if the specifications are written in a
Mark Bickford +3 more
doaj +1 more source
On Berry's conjectures about the stable order in PCF [PDF]
Logical Methods in Computer Science, 2012 PCF is a sequential simply typed lambda calculus language. There is a unique order-extensional fully abstract cpo model of PCF, built up from equivalence classes of terms. In 1979, G\'erard Berry defined the stable order in this model and proved that the
Fritz Müller
doaj +1 more source
A rich hierarchy of functionals of finite types [PDF]
Logical Methods in Computer Science, 2009 We are considering typed hierarchies of total, continuous functionals using complete, separable metric spaces at the base types. We pay special attention to the so called Urysohn space constructed by P. Urysohn. One of the properties of the Urysohn space
Dag Normann
doaj +1 more source
The clinical spectrum of SMA‐PME and in vitro normalization of its cellular ceramide profile
Annals of Clinical and Translational Neurology, Volume 9, Issue 12, Page 1941-1952, December 2022., 2022 Abstract Objective The objectives of this study were to define the clinical and biochemical spectrum of spinal muscular atrophy with progressive myoclonic epilepsy (SMA‐PME) and to determine if aberrant cellular ceramide accumulation could be normalized by enzyme replacement.
Michelle M. Lee +16 more
wiley +1 more source