منابع مشابه
Linear Logic as a Logic of Computations
The question at issue is to develop a computational interpretation of Linear Logic [S] and to establish exactly its expressive power. We follow the bottom-up approach. This involves starting with the simplest of the systems we are interested in, and then expanding them step-by-step. We begin with the !-Horn fragment of Linear Logic, which uses only positive literals, the linear implication -, t...
متن کاملProofs as Computations in Linear Logic
The notions of uniform proof and resolution represent the foundations of the proof-theoretic characterization of logic programming. In the standard logic programming setting, however, the form of the formulas, namely Horn clauses, plays a crucial role in discriminating between programming and theorem proving. In order to design coherent extensions of Horn clause-based languages, proper counterp...
متن کاملLinear Logic and Local Computations
This work deals with the exponential fragment of Girard’s linear logic [Gir87] without the contraction rule. This logical system has a natural relation with the direct logic [OnKo85],[KeWe]. A new sequent calculus for this logic is presented in order to remove also the weakening rule and recover its behavior via a special treatment of the propositional constants; the process of cut-elimination ...
متن کاملLinear Formulas in Continuous Logic
We prove that continuous sentences preserved by the ultramean construction (a generalization of the ultraproduct construction) are exactly those sentences which are approximated by linear sentences. Continuous sentences preserved by linear elementary equivalence are exactly those sentences which are approximated in the Riesz space generated by linear sentences. Also, characterizations for linea...
متن کاملLinear Logic as Logic Programming: An Abstract
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic re nement, Lolli [13], provide for various forms of abstraction (modules, abstract data types, and higher-order programming) but lack primitives for concurrency. The logic programming language, LO (Linear Objects) [2] ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annals of Pure and Applied Logic
سال: 1994
ISSN: 0168-0072
DOI: 10.1016/0168-0072(94)90011-6