Results 31 to 40 of about 83,510 (168)

Linear logic

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

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

Linear logic as a logic of computations

Annals of Pure and Applied Logic, 1994
The author gives a complete computational interpretation of several initial fragments of linear logic and, based on this interpretation, establishes precisely the complexity level of these fragments. He begins with the !-Horn fragment of linear logic, which uses only positive literals, the linear implication, the tensor product \(\otimes\) and the ...
openaire   +1 more source

Linear Logical Algorithms [PDF]

, 2008
Bottom-up logic programming can be used to declaratively specify many algorithms in a succinct and natural way, and McAllester and Ganzinger have shown that it is possible to define a cost semantics that enables reasoning about the running time of algorithms written as inference rules.
Robert J. Simmons, Frank Pfenning
openaire   +1 more source

A note on the expressive power of linear orders [PDF]

Logical Methods in Computer Science, 2011
This article shows that there exist two particular linear orders such that first-order logic with these two linear orders has the same expressive power as first-order logic with the Bit-predicate FO(Bit). As a corollary we obtain that there also exists a
Thomas Schwentick, Nicole Schweikardt
doaj   +1 more source

Linear Abelian Modal Logic

Bulletin of the Section of Logic
A many-valued modal logic, called linear abelian modal logic \(\rm {\mathbf{LK(A)}}\) is introduced as an extension of the abelian modal logic \(\rm \mathbf{K(A)}\). Abelian modal logic \(\rm \mathbf{K(A)}\) is the minimal modal extension of the logic of
Hamzeh Mohammadi
doaj   +1 more source

Light Linear Logic

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

Visibly linear dynamic logic [PDF]

Theoretical Computer Science, 2018
We introduce Visibly Linear Dynamic Logic (VLDL), which extends Linear Temporal Logic (LTL) by temporal operators that are guarded by visibly pushdown languages over finite words. In VLDL one can, e.g., express that a function resets a variable to its original value after its execution, even in the presence of an unbounded number of intermediate ...
Alexander Weinert, Martin Zimmermann 0002   +1 more
openaire   +6 more sources

Automata Linear Dynamic Logic on Finite Traces [PDF]

Logical Methods in Computer Science
Temporal 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

Contradictory Perspectives on Academic Support: Beyond Linear Logic

Frontiers in Education, 2021
This paper employs a Square of Opposition as an interpretivist heuristic device in order to interrogate perceptions of academic support. The Square of Opposition is used to move beyond binary explanations of academic development subsumed within learner ...
Fiona Hallett
doaj   +1 more source