Results 51 to 60 of about 165,990,627 (290)
On proof normalization in linear logic
Theoretical Computer Science, 1994 Classical linear logic has been introduced by Girard as a logic of actions. Compared to classical logic, the two structural rules weakening and contraction are dropped from the Gentzen-type rules. In this system each resource (hypothesis) must be used exactly once. Classical linear logic is a very rich system. It is used for studying various aspects in
Galmiche, Didier, Perrier, Guy
openaire +2 more sources
Artificial molecular machines and motors—Design and control of nanoscale motion
FEBS Letters, EarlyView.Molecules are constantly moving because of thermal fluctuations, but random motion alone cannot be exploited to perform directional tasks. Artificial molecular machines use chemical, electrical, or light energy to bias this motion. Molecular shuttles, rotary motors, and supramolecular pumps illustrate how nanoscale movement can be controlled and ...
Leonardo Andreoni, Alberto Credi
wiley +1 more source
Barriers in Concurrent Separation Logic: Now With Tool Support! [PDF]
Logical Methods in Computer Science, 2012 We develop and prove sound a concurrent separation logic for Pthreads-style barriers. Although Pthreads barriers are widely used in systems, and separation logic is widely used for verification, there has not been any effort to combine the two.
Aquinas Hobor, Cristian Gherghina
doaj +1 more source
Bulletin of the Section of Logic, 2023 Neil Tennant’s core logic is a type of bilateralist natural deduction system based on proofs and refutations. We present a proof system for propositional core logic, explain its connections to bilateralism, and explore the possibility of using it as a ...
Emma van Dijk +2 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
Socratic Proofs for Propositional Linear-Time Logic [PDF]
, 2014 This paper presents a calculus of Socratic proofs for Propositional Linear-Time Logic (PLTL) and discusses potential automation of its proof ...
Bolotov, A. +3 more
core
A Q‐Learning Algorithm to Solve the Two‐Player Zero‐Sum Game Problem for Nonlinear Systems
International Journal of Adaptive Control and Signal Processing, Volume 39, Issue 3, Page 566-581, March 2025.A Q‐learning algorithm to solve the two‐player zero‐sum game problem for nonlinear systems. ABSTRACT This paper deals with the two‐player zero‐sum game problem, which is a bounded L2$$ {L}_2 $$‐gain robust control problem. Finding an analytical solution to the complex Hamilton‐Jacobi‐Issacs (HJI) equation is a challenging task.
Afreen Islam +2 more
wiley +1 more source
Logical Methods in Computer Science, 2017 We propose new sequent calculus systems for orthologic (also known as minimal quantum logic) which satisfy the cut elimination property. The first one is a simple system relying on the involutive status of negation. The second one incorporates the notion
Olivier Laurent
doaj +1 more source
Binding Logic: Proofs and Models
, 2002 We define an extension of predicate logic, called Binding Logic, where variables can be bound in terms and in propositions. We introduce a notion of model for this logic and prove a soundness and completeness theorem for it. This theorem is obtained by encoding this logic back into predicate logic and using the classical soundness and completeness ...
Dowek, Gilles +2 more
openaire +4 more sources
Logics with disjunction and proof by cases
Archive for Mathematical Logic, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
San-Min Wang, Petr Cintula
openaire +2 more sources