Results 71 to 80 of about 7,198 (311)
Truncation and Semi-Decidability Notions in Applicative Theories [PDF]
BON ⁺ is an applicative theory and closely related to the first order parts of the standard systems of explicit mathematics. As such it is also a natural framework for abstract computations.
Rosebrock, Timotej Alexander +2 more
core +1 more source
A Decidable Ground Fragment of the Monotonicity Calculus
Monotonicity is a prevalent feature in natural language. Notably, determiners such as every, some, and no induce monotonic (upward) or antitonic (downward) entailments. The Monotonicity Calculus is a proof system that formalizes such reasoning in natural
Daniel Li
doaj +1 more source
Decidable Classes of Tree Automata Mixing Local and Global Constraints Modulo Flat Theories [PDF]
We define a class of ranked tree automata TABG generalizing both the tree automata with local tests between brothers of Bogaert and Tison (1992) and with global equality and disequality constraints (TAGED) of Filiot et al. (2007).
Luis Barguñó +4 more
doaj +1 more source
ABSTRACT Objective To compare the efficacy and safety of roxarestat versus recombinant human erythropoietin (rhEPO) in the management of renal anemia in patients undergoing maintenance hemodialysis. Methods This was a prospective, open‐label, randomized controlled trial.
Lingling Chen, Junjie Zhu, Qiaonan Ge
wiley +1 more source
The logical strength of B\"uchi's decidability theorem [PDF]
We study the strength of axioms needed to prove various results related to automata on infinite words and B\"uchi's theorem on the decidability of the MSO theory of $(N, {\le})$.
Leszek Kołodziejczyk +3 more
doaj +1 more source
ABSTRACT Background Therapeutic apheresis (TA) is an established treatment modality for hematologic, neurologic, and immunologic disorders, yet access remains severely limited in sub‐Saharan Africa. Donor apheresis, including platelet apheresis collection from healthy donors, represents an important complementary modality supporting blood product ...
Nosa Bazuaye +33 more
wiley +1 more source
Satisfiability of ATL with strategy contexts [PDF]
Various extensions of the temporal logic ATL have recently been introduced to express rich properties of multi-agent systems. Among these, ATLsc extends ATL with strategy contexts, while Strategy Logic has first-order quantification over strategies ...
François Laroussinie +3 more
core +1 more source
This essay’s content is rendered by the titles of the successive sections. 1. Effective solvability versus intuitive solvability. — 2. Decidability, i.e. effective solvability, in predicate logic. The speedup phenomenon — 3.
Marciszewski Witold
doaj +1 more source
Organoids in pediatric cancer research
Organoid technology has revolutionized cancer research, yet its application in pediatric oncology remains limited. Recent advances have enabled the development of pediatric tumor organoids, offering new insights into disease biology, treatment response, and interactions with the tumor microenvironment.
Carla Ríos Arceo, Jarno Drost
wiley +1 more source
Arriving on Time: Punctuality in Structures, Isomorphisms and 1-Decidability
This thesis contributes to the area of computable structure theory. In particular, it contributes to the study of punctual structures; the systematic study of the primitive recursive content of mathematics initiated by Kalimullin, Melnikov and Ng in ...
Ellen Hammatt (10905528)
core +1 more source

