Results 71 to 80 of about 39,716 (258)
Semi-decidable equivalence relations obtained by composition and lattice join of decidable equivalence relations [PDF]
Composition and lattice join (transitive closure of a union) of equivalence relations are operations taking pairs of decidable equivalence relations to relations that are semi-decidable, but not necessarily decidable. This article addresses the question, is every semi-decidable equivalence relation obtainable in those ways from a pair of decidable ...
arxiv
Variations of Checking Stack Automata: Obtaining Unexpected Decidability Properties
We introduce a model of one-way language acceptors (a variant of a checking stack automaton) and show the following decidability properties: (1) The deterministic version has a decidable membership problem but has an undecidable emptiness problem.
Ibarra, Oscar H., McQuillan, Ian
core +1 more source
Circulating tumor DNA (ctDNA) offers a possibility for different applications in early and late stage breast cancer management. In early breast cancer tumor informed approaches are increasingly used for detecting molecular residual disease (MRD) and early recurrence. In advanced stage, ctDNA provides a possibility for monitoring disease progression and
Eva Valentina Klocker+14 more
wiley +1 more source
Decidability for Sturmian words [PDF]
We show that the first-order theory of Sturmian words over Presburger arithmetic is decidable. Using a general adder recognizing addition in Ostrowski numeration systems by Baranwal, Schaeffer and Shallit, we prove that the first-order expansions of ...
Philipp Hieronymi+5 more
doaj +1 more source
The existence of a near-unanimity function is decidable [PDF]
We prove that the following problem is decidable: given a finite set of relations, decide whether this set admits a near-unanimity function.
arxiv
Model Checking Dynamic-Epistemic Spatial Logic [PDF]
In this paper we focus on Dynamic Spatial Logic, the extension of Hennessy-Milner logic with the parallel operator. We develop a sound complete Hilbert-style axiomatic system for it comprehending the behavior of spatial operators in relation with dynamic/
Mardare, Radu, Priami, Corrado
core
Strategy Logic with Imperfect Information
We introduce an extension of Strategy Logic for the imperfect-information setting, called SLii, and study its model-checking problem. As this logic naturally captures multi-player games with imperfect information, the problem turns out to be undecidable.
Berthon, Raphaël+4 more
core +1 more source
In this explorative biomarker analysis, we assessed serial sampling of circulating tumor cells (CTCs) with CellSearch in two randomized trials testing immune checkpoint inhibitors (ICIs) in metastatic breast cancer. Our data demonstrate a prognostic potential of CTCs, most apparent 4 weeks into ICI therapy.
Nikolai Kragøe Andresen+13 more
wiley +1 more source
Extending Unification in $\mathcal{EL}$ to Disunification: The Case of Dismatching and Local Disunification [PDF]
Unification in Description Logics has been introduced as a means to detect redundancies in ontologies. We try to extend the known decidability results for unification in the Description Logic $\mathcal{EL}$ to disunification since negative constraints ...
Franz Baader+2 more
doaj +1 more source
Circulating tumor cells: advancing personalized therapy in small cell lung cancer patients
Small cell lung cancer (SCLC) is an aggressive form of lung cancer that spreads rapidly to secondary sites such as the brain and liver. Cancer cells circulating in the blood, “circulating tumor cells” (CTCs), have demonstrated prognostic value in SCLC, and evaluating biomarkers on CTCs could guide treatment decisions such as for PARP inhibitors ...
Prajwol Shrestha+6 more
wiley +1 more source