Results 41 to 50 of about 140,069 (266)
Bulletin of the Section of LogicIn this paper, we prove the semantic incompleteness of some expansions of the Hilbert-style system for the minimal normal term-modal logic with equality and non-rigid terms that were proposed in Liberman et al.
Takahiro Sawasaki
doaj +1 more source
Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure [PDF]
Logical Methods in Computer Science, 2007 String languages recognizable in (deterministic) log-space are characterized either by two-way (deterministic) multi-head automata, or following Immerman, by first-order logic with (deterministic) transitive closure.
Joost Engelfriet, Hendrik Jan Hoogeboom
doaj +1 more source
Phosphoinositides and inositol phosphates as molecular glues
FEBS Letters, EarlyView.Inositol phosphates (IPs) and phosphoinositides (PIPs) regulate diverse eukaryotic processes. Beyond recruiting signaling proteins or acting as structural cofactors, recent studies suggest they mediate protein–protein interactions as natural molecular glues.
Aleshia Seaton‐Terry +9 more
wiley +1 more source
Informatika, 2021 There are three main families of inference algorithms in first-order logic: direct inference and its application to deductive databases and production systems; backward inference procedures and logic programming systems; theorem proving systems based on ...
A. М. Sobol +2 more
doaj +1 more source
Interpreting the effects of DNA polymerase variants at the structural level
Molecular Oncology, EarlyView.Using MAVISp and molecular dynamics simulations, we analyzed over 60 000 missense variants in POLE and POLD1 from ClinVar, COSMIC, cBioPortal, and saturation mutagenesis. Identified mechanistic indicators, including stability, binding, and long‐range, enable structural interpretation, providing ACMG‐like evidence for possible reclassification of VUS ...
Matteo Arnaudi +7 more
wiley +1 more source
Indistinguishability and First-Order Logic [PDF]
, 2008 The "richness" of properties that are indistinguishable from first-order properties is investigated. Indistinguishability is a concept of equivalence among properties of combinatorial structures that is appropriate in the context of testability. All formulas in a restricted class of second-order logic are shown to be indistinguishable from first-order ...
Skip Jordan, Thomas Zeugmann
openaire +1 more source
Positive First-order Logic on Words [PDF]
2021 36th Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), 2021 We study FO+, a fragment of first-order logic on finite words, where monadic predicates can only appear positively. We show that there is a FO-definable language that is monotone in monadic predicates but not definable in FO+. This provides a simple proof that Lyndon's preservation theorem fails on finite structures.
openaire +3 more sources
Executable First-Order Queries in the Logic of Information Flows [PDF]
Logical Methods in Computer ScienceThe logic of information flows (LIF) has recently been proposed as a general framework in the field of knowledge representation. In this framework, tasks of procedural nature can still be modeled in a declarative, logic-based fashion.
Heba Aamer +4 more
doaj +1 more source
Directed evolution of enzymes at the crossroads of tradition and innovation
FEBS Open Bio, EarlyView.An iterative cycle of data‐driven enzyme optimization comprising four stages: genetic diversification of a template enzyme, expression of protein variants, high‐throughput evaluation, and machine‐learning‐guided redesign of the next variant library.
Maria Tomkova +2 more
wiley +1 more source
Logic Journal of the IGPL, 2022 Abstract We present the first-order logic of change, which is an extension of the propositional logic of change $\textsf {LC}\Box $ developed and axiomatized by Świętorzecka and Czermak (2015, Log. et Anal., 232, 511–527). $\textsf {LC}\Box $ has two primitive operators: ${\mathcal {C}}$ to be read it changes whether and $\Box $ for ...
openaire +2 more sources