Sciweavers

3690 search results - page 32 / 738
» Computation with classical sequents
Sort
View
CSL
2005
Springer
14 years 4 months ago
Permutative Logic
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet
BIRTHDAY
2005
Springer
14 years 4 months ago
a-logic
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
Murdoch Gabbay, Michael Gabbay
ICPP
1997
IEEE
14 years 2 months ago
A Register Allocation Technique Using Register Existence Graph
Optamzztng compalataon as very amportant for generatang code sequentes an order to utalaze the characterastacs of processor archatectures. One of the most essentaal optzmazataon t...
Akira Koseki, Yoshiaki Fukazawa, Hideaki Komatsu
JSYML
2000
110views more  JSYML 2000»
13 years 10 months ago
Basic Logic: Reflection, Symmetry, Visibility
We introduce a sequent calculus B for a new logic, named basic logic. The aim of basic logic is to find a structure in the space of logics. Classical, intuitionistic, quantum and ...
Giovanni Sambin, Giulia Battilotti, Claudia Faggia...
JAR
2010
123views more  JAR 2010»
13 years 9 months ago
A Framework for Proof Systems
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
Vivek Nigam, Dale Miller