Results 41 to 50 of about 823,326 (291)
Indexed linear logic and higher-order model checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In recent work, Kobayashi observed that the acceptance by an alternating tree automaton A of an infinite tree T generated by a higher-order recursion scheme G may be formulated as the typability of the recursion scheme G in an appropriate intersection ...
Charles Grellois, Paul-André Melliès
doaj +1 more source
Information and Computation, 1995 This paper draws the main ``boulevards'' of a logical approach to complexity, based on the idea that the expressive power of a logical system is the complexity of its cut-elimination procedure. A very careful handling of Linear Logic (LL) exponentials leads the author to define a weak LL (the ``Light Linear Logic'' LLL), for which he proves the ...
openaire +2 more sources
Incompleteness of a first-order Gödel logic and some temporal logics of programs [PDF]
, 1996 It is shown that the infinite-valued first-order Gödel logic G° based on the set of truth values {1/k: k ε w {0}} U {0} is not r.e. The logic G° is the same as that obtained from the Kripke semantics for first-order intuitionistic logic with constant ...
Baaz, Matthias +2 more
core +2 more sources
Linear Temporal Logic for Regular Cost Functions [PDF]
Logical Methods in Computer Science, 2014 Regular cost functions have been introduced recently as an extension to the notion of regular languages with counting capabilities, which retains strong closure, equivalence, and decidability properties.
Denis Kuperberg
doaj +1 more source
On an Intuitionistic Logic for Pragmatics [PDF]
, 2018 We reconsider the pragmatic interpretation of intuitionistic logic [21] regarded as a logic of assertions and their justications and its relations with classical logic.
Bellin, Gianluigi +2 more
core +1 more source
Theoretical Computer Science, 1987 The paper contains, in reverse order, (A) a substantial contribution to proof theory, and (B) speculations on using proofs as parts of programs, interspersed by (C) diverse relations to the (logical) literature. Here are a few samples from this, at least, for the reviewer, very readable paper.
openaire +2 more sources
FEBS Letters, EarlyView.We reconstituted Synechocystis glycogen synthesis in vitro from purified enzymes and showed that two GlgA isoenzymes produce glycogen with different architectures: GlgA1 yields denser, highly branched glycogen, whereas GlgA2 synthesizes longer, less‐branched chains.
Kenric Lee +3 more
wiley +1 more source
Digital twins to accelerate target identification and drug development for immune‐mediated disorders
FEBS Open Bio, EarlyView.Digital twins integrate patient‐derived molecular and clinical data into personalised computational models that simulate disease mechanisms. They enable rapid identification and validation of therapeutic targets, prediction of drug responses, and prioritisation of candidate interventions.
Anna Niarakis, Philippe Moingeon
wiley +1 more source
Automata Linear Dynamic Logic on Finite Traces [PDF]
Logical Methods in Computer ScienceTemporal logics are widely used by the Formal Methods and AI communities. Linear Temporal Logic is a popular temporal logic and is valued for its ease of use as well as its balance between expressiveness and complexity.
Kevin W. Smith, Moshe Y. Vardi
doaj +1 more source
Logical operators for ontological modeling [PDF]
, 2014 We show that logic has more to offer to ontologists than standard first order and modal operators. We first describe some operators of linear logic which we believe are particularly suitable for ontological modeling, and suggest how ...
Borgo, Stefano +2 more
core +1 more source