Results 51 to 60 of about 7,198 (311)

Decidability of higher-order matching [PDF]

open access: yesLogical Methods in Computer Science, 2009
We show that the higher-order matching problem is decidable using a game-theoretic argument.
Colin Stirling
doaj   +1 more source

European Standard Clinical Practice Guideline and EXPeRT Recommendations for the Diagnosis and Management of Gastroenteropancreatic Neuroendocrine Neoplasms in Children and Adolescents

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Pediatric gastroenteropancreatic neuroendocrine neoplasms (GEP‐NENs) are extremely rare and clinically heterogeneous. Management has largely been extrapolated from adult practice. This European Standard Clinical Practice Guideline (ESCP), developed by the EXPeRT network in collaboration with adult NEN experts, provides (adult) evidence ...
Michaela Kuhlen   +23 more
wiley   +1 more source

On the decidability of connectedness constraints in 2D and 3D Euclidean spaces

open access: yes, 2011
We investigate (quantifier-free) spatial constraint languages with equality, contact and connectedness predicates as well as Boolean operations on regions, interpreted over low-dimensional Euclidean spaces. We show that the complexity of reasoning varies
Yavor Nenov   +11 more
core   +1 more source

Trees over Infinite Structures and Path Logics with Synchronization [PDF]

open access: yesElectronic Proceedings in Theoretical Computer Science, 2011
We provide decidability and undecidability results on the model-checking problem for infinite tree structures. These tree structures are built from sequences of elements of infinite relational structures.
Alex Spelten   +2 more
doaj   +1 more source

Clinical and Biological Features of Response in Resistant Neuroblastoma to 131I‐Metaiodobenzylguanidine Radiotherapy in the Anti‐GD2 Immunotherapy Era

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background 131I‐metaiodobenzylguanidine (131I‐MIBG) radiotherapy is a key treatment for relapsed and refractory (R/R) neuroblastoma (NB). Patients with R/R disease treated in the modern era are increasingly exposed to anti‐GD2 immunotherapy, which exerts selective pressure and may modify both tumor cell state and microenvironment.
Benjamin J. Lerman   +7 more
wiley   +1 more source

Decidability problems in Petri nets with names and replication

open access: yes, 2010
In this paper we study decidability of several extensions of P/T nets with name creation and/or replication. In particular, we study how to restrict the models of RN systems (P/T nets extended with replication, for which reachability is undecidable) and ...
Rosa Velardo, Fernando   +1 more
core   +1 more source

On decidability of pure hybrid logic

open access: yesLietuvos Matematikos Rinkinys, 2012
In this paper we study a decidable class of pure Hybrid Logic. To prove decidability we use terminating sequent for formulae of H(@) logic.
Stanislovas Norgėla
doaj   +1 more source

Hospitalization Through Families’ Eyes: Comparing Inpatient Care Quality for Children With Sickle Cell Disease and Cystic Fibrosis in Canada

open access: yesPediatric Blood &Cancer, EarlyView.
ABSTRACT Background Sickle cell disease (SCD) is a chronic, inherited hemoglobinopathy that requires frequent hospitalization for disease‐related complications. Canadian data on inpatient care is limited. This study compared caregiver‐reported hospital experiences of children with SCD to those with cystic fibrosis (CF), a chronic, autosomal recessive ...
Hailey M. Zwicker   +11 more
wiley   +1 more source

To the 90th anniversary of the birth of A. I. Kokorin. Stages of scientific and pedagogical way

open access: yesИзвестия Иркутского государственного университета: Серия "Математика", 2019
The paper is devoted to the scientific and pedagogical activity of A. I. Kokorin, the founder of the Irkutsk algebraic-logical school, whose 90th anniversary is celebrated in November 2019. Five research areas with the most significant contributions made
V. V. Bludov   +3 more
doaj   +1 more source

A dependent nominal type theory [PDF]

open access: yesLogical Methods in Computer Science, 2012
Nominal abstract syntax is an approach to representing names and binding pioneered by Gabbay and Pitts. So far nominal techniques have mostly been studied using classical logic or model theory, not type theory. Nominal extensions to simple, dependent and
James Cheney
doaj   +1 more source

Home - About - Disclaimer - Privacy