Results 91 to 100 of about 491,607 (366)
Well Behaved Transition Systems [PDF]
Logical Methods in Computer Science, 2017 The well-quasi-ordering (i.e., a well-founded quasi-ordering such that all antichains are finite) that defines well-structured transition systems (WSTS) is shown not to be the weakest hypothesis that implies decidability of the coverability problem.
Michael Blondin +2 more
doaj +1 more source
Molecular Oncology, EarlyView.This study investigates gene expression differences between two major pediatric acute lymphoblastic leukemia (ALL) subtypes, B‐cell precursor ALL, and T‐cell ALL, using a data‐driven approach consisting of biostatistics and machine learning methods. Following analysis of a discovery dataset, we find a set of 14 expression markers differentiating the ...
Mona Nourbakhsh +8 more
wiley +1 more source
A Syntactic Proof of the Decidability of First-Order Monadic Logic
Bulletin of the Section of LogicDecidability of monadic first-order classical logic was established by Löwenheim in 1915. The proof made use of a semantic argument and a purely syntactic proof has never been provided.
Eugenio Orlandelli, Matteo Tesi
doaj +1 more source
International Journal of Algebra and Computation, 2016 We characterize absorption in finite idempotent algebras by means of Jónsson absorption and cube term blockers. As an application we show that it is decidable whether a given subset is an absorbing subuniverse of an algebra given by the tables of its basic operations.
Libor Barto, Alexandr Kazda
openaire +2 more sources
Molecular Oncology, EarlyView.mir‐196a promotes Esophagus Adenocarcinoma aggressiveness. On one hand, mir‐196a targets the valosin‐containing protein (VCP) mRNA, causing the accumulation of c‐MYC protein that leads to high amounts of TERT. On the other hand, mir‐196a targets the inhibitor of NFκB (NFKBIA).
Jesús García‐Castillo +8 more
wiley +1 more source
The First-Order Theory of Sets with Cardinality Constraints is Decidable
, 2004 We show that the decidability of the first-order theory of the language that combines Boolean algebras of sets of uninterpreted elements with Presburger arithmetic operations. We thereby disprove a recent conjecture that this theory is undecidable.
Kuncak, Viktor, Rinard, Martin
core +3 more sources
Decidability and Independence of Conjugacy Problems in Finitely Presented Monoids
, 2017 There have been several attempts to extend the notion of conjugacy from groups to monoids. The aim of this paper is study the decidability and independence of conjugacy problems for three of these notions (which we will denote by $\sim_p$, $\sim_o$, and $
Araújo, João +3 more
core +1 more source
Molecular Oncology, EarlyView.The COMBAT classification system, developed through multi‐omics integration, stratifies adult patients with B‐cell acute lymphoblastic leukemia(B‐ALL) into three molecular subtypes with distinct surface antigen patterns, immune landscape, methylation patterns, biological pathways and prognosis.
Yang Song +11 more
wiley +1 more source
Branch-Well-Structured Transition Systems and Extensions [PDF]
Logical Methods in Computer ScienceWe propose a relaxation to the definition of well-structured transition systems (\WSTS) while retaining the decidability of boundedness and non-termination.
Benedikt Bollig +2 more
doaj +1 more source
Competition in the European Arena: How the Rules of the Game Help Nationalists Gain
Politics and Governance, 2020 Why does the European election fail to produce competition between European policy alternatives despite the increased politicization of European integration and efforts to connect election results to the Commission Presidency via the Spitzenkandidaten ...
Zoe Lefkofridi
doaj +1 more source