Factbites
 Where results make sense
About us   |   Why use us?   |   Reviews   |   PR   |   Contact us  

Topic: Proof nets


  
  Proof theory - Wikipedia, the free encyclopedia
Proofs are typically presented as inductively-defined data structures such as plain lists, boxed lists, or trees, which are constructed according to the axioms and rules of inference of the logical system.
Proof theory can also be considered a branch of philosophical logic, where the primary interest is in the idea of a proof-theoretic semantics, an idea which depends upon technical ideas in structural proof theory to be feasible.
Structural proof theory is connected to type theory by means of the Curry-Howard correspondence, which observes a structural analogy between the process of normalisation in the natural deduction calculus and beta reduction in the typed lambda calculus.
en.wikipedia.org /wiki/Proof_theory   (1014 words)

  
 proof nets for classical MLL and linear lambda terms (401 lines)
As in the case of the purely implicational fragment of ILL, the oriented proof nets corresponding to a correct derivation may essentially use the constants $\bot$ and $\bf 1$ and the definition of $A^{\bot}$ as $A \limp \bot$.
Let $R$ be a proof net with conclusions $A_1$, $\ldots$, $A_{k+1}$; given a D-R-switching, we obtain a natural deduction derivation of $A'_{k+1}$ from $A'_1$, $\ldots$, $A'_k$ [or a sequent derivation in IMLL of $A'_1\ldots A'_k \vdash A'_{k+1}$].
E.g., given the obvious cut-free proof net with conclusions $$B\wp(B^{\perp} \otimes A^{\perp}), A,$$ the orientation assigning O to both conclusions corresponds to $\vdash (B \wp A) \limp B, A$, which is unprovable in FILL.
www.cis.upenn.edu /~bcpierce/types/archives/1992/msg00057.html   (1549 words)

  
 Properties of Coinductive Proof Nets
proof nets, which solves two of the most striking shortcomings of classical logic: the inability to reason with limited resources and the inability to reason with infinite objects.
Proof nets on the other hand supply us with only one proof for all reduction sequences that are equal modulo the order in which the individual reductions were applied.
It follows directly from this example and the correspondence between proof nets and the λ-calculus, that there is a proof net with an infinite reduction sequence and no normal form, hence strong normalisation does not hold for the type-free version of (co)inductive proof nets.
homepages.inf.ed.ac.uk /s0235396/korte04bnvki.html   (1203 words)

  
 proof nets for classical logic
Let R be a proof structure satisfying the conditions for multiplicative proof nets with quantifiers and weakening inside and outside each additive box.
As the additional condition for proof nets in LC take (***) for every structure inside each box and for the structure R as a whole, the privileged conclusion (if any) is maximal w.r.t.
Proof: Since the premises and the conclusion Z of L are not privileged, Z could be in pe(Q') only by an application of conditions (3*) or (4*) in the definition of privileged empire.
www.cis.upenn.edu /~bcpierce/types/archives/1991/msg00125.html   (1201 words)

  
 VENTILATION PERFORMANCES OF A LARGE CANARIAN TYPE GREENHOUSE EQUIPPED WITH INSECT-PROOF NETS
This study analyses the ventilation performances of a large Canarian type greenhouse equipped with insect-proof nets on the vent openings.
Air exchange rate measurements were performed in the region of Agadir, Morocco, by means of tracer gas method in a 6000 m² greenhouse planted with a tomato crop and equipped with insect-proof nets.
The simulation model was later used to study the effects of anti-trips and anti-aphids nets on the greenhouse ventilation performances and the resulting climate.
www.actahort.org /books/578/578_8.htm   (195 words)

  
 DI & CoS - Proof Nets, Semantics of Proofs and the War to Bureaucracy
Deep inference and the calculus of structures are influencing the design of a new generation of proof nets.
Furthermore, the identifications enforced on proofs are such that the proof nets, as they are presented here, form the arrows of the free (symmetric) *-autonomous category.
In the second part of the paper we show that the identifications enforced on proofs are such that the class of two-conclusion proof nets defines the free *-autonomous category.
alessio.guglielmi.name /res/cos/PN/index.html   (1994 words)

  
 Linear Logic (Stanford Encyclopedia of Philosophy)
When viewing proof search as a computational model, we can see formulas in a sequent as being “agents” that may act independently or in concert with others in its environment: the action of the agent is determined by reading the introduction rule for it bottom-up.
These are actually computation rules over proof nets, and the correctness criteria allow to verify easily that any such rule preserves correctness, and as a consequence the reductum of a proof net still comes from a sequent calculus proof of the same sequent.
Many models of linear logic proofs have been proposed; we consider that, to date, the simplest and most intuitive construction is those based on the so-called “relational semantics”, where formulas are interpreted as multisets, sequents as tuples of multisets and proofs as relations over the interpretation of sequents.
plato.stanford.edu /entries/logic-linear   (5958 words)

  
 Project-Team-Calligramme:Proof Nets, Sequent Calculus and Typed Lambda Calculi
Proof nets are graphical representations (in the sense of graph theory) of proofs in linear logic.
Their role is very similar to lambda terms for more traditional logics; as a matter of fact there are several back-and-forth translations that relate several classes of lambda terms with classes of proof nets.
In particular, in the case of automatic proof search, correctness criteria can be used as invariants during the inductive process of proof construction.
www.inria.fr /rapportsactivite/RA2005/calligramme/uid10.html   (334 words)

  
 National ICT Australia - Proof Nets for Linear Logic   (Site not responding. Last check: 2007-11-06)
Two proofs can be considered equivalent if they differ merely through permutation of rules.
The presence of an abundance of equivalent instantiations of what can be considered the same abstract proof can be an enormous handicap in establishing general proof theoretic results such as cut-elimination – it leads to a proliferation of lemmas establishing invariance under permutations.
A notion of proof net for Cut-free Multiplicative-Additive Linear logic was recently formulated, thereby extending Girard's original proof nets for Multiplicative Linear Logic.
www.nicta.com.au /director/research/programs/fm/people/robert_jan_van_glabbeek/proof_nets_for_linear_logic.cfm?print=1   (158 words)

  
 Bewijstheoretische methoden in NLP
Gentzen calculus does have a nice backward chaining proof search interpretation, but it is inefficient as a result of spurious non-determinism: there can be different derivations that compute one and the same meaning.
Proof nets are graphs satisfying certain well-formedness conditions.
In the second part of the course, we look at proposals for incremental proof net constructions, and their relevance for human language processing issues.
www.let.uu.nl /%7EMichael.Moortgat/personal/Courses/cgld02.html   (734 words)

  
 Two sided proof nets with units   (Site not responding. Last check: 2007-11-06)
These proof nets have a structure more closely parallel to that of traditional natural deduction than Girard's one-sided nets do.
One significant feature of this version of proof nets is that we are able to include the units for the tensors in our presentation.
With this, we are able to extend these nets to the full case of multiplicative linear logic (with units), and prove sequentialisation there.
www.cis.upenn.edu /~bcpierce/types/archives/1991/msg00112.html   (324 words)

  
 Index of /pub/ (via CobWeb/3.1 planet03.csc.ncsu.edu)   (Site not responding. Last check: 2007-11-06)
We define a notion of proof function analogous to the notion of truth function, determining a transformation between functors, and show that the transformation denoted by a proof net is dinatural if and only if the proof net is sound, namely acyclic and connected.
Proof functions are of independent interest as a 2-valued model of MLL with MIX.
Although none of the operations is particularly oriented to nets it is nevertheless possible to use them to express processes constructed as a net of subprocesses, and more generally as a system consisting of components.
boole.stanford.edu.cob-web.org:8888 /pub   (6325 words)

  
 FILL paper   (Site not responding. Last check: 2007-11-06)
We define the appropriate notion of proof nets for these logics, and use them to describe coherence results for the corresponding categorical structures.
we develop proof nets for FILL (as well as bilinear logic - but this latter is shown equivalent to the system of non-commutative *-autonomous categories we studied in an earlier paper [BCST], so that is not new).
our proof nets seem very like the "naive" sequent calculus that Schellinx has shown does not admit cut elimination; we analyze the apparent "paradox" in claiming a normalization result for this system of proof nets, and relate our work to previous work of Hyland and dePaiva.
www.math.mcgill.ca /rags/nets/fill.abstract.html   (457 words)

  
 A Procedure for Automatic Proof Nets Construction - Galmiche, Perrier (ResearchIndex)   (Site not responding. Last check: 2007-11-06)
Linear logic is more expressive than classical and intuitionistic logic and has an undirectional character due to the particular treatment of negation and the absence of structural rules.
Considering this new logical framework to make logic programming or programming with proofs (extracting programs from proofs), a better comprehension of proofs in MLL (proof nets) is necessary and automated...
Because of a superficial similarity between matrix characterizations and proof nets it is very likely that this can be achieved at least...
citeseer.ist.psu.edu /134403.html   (667 words)

  
 Proof Nets for Unit-free Multiplicative-Additive Linear Logic (Extended abstract)   (Site not responding. Last check: 2007-11-06)
A cornerstone of the theory of proof nets for unit-free multiplicative linear logic (MLL) is the abstract representation of cut-free proofs modulo inessential commutations of rules.
Thus the problem of finding a satisfactory notion of proof net for unit-free multiplicative-additive linear logic (MALL) has remained open since the incep-tion of linear logic in 1986.
We present a new definition of MALL proof net which remains faithful to the cornerstone of the MLL theory.
csdl.computer.org /comp/proceedings/lics/2003/1884/00/18840001abs.htm   (190 words)

  
 USATODAY.com - Stern hopeful Nets can make move to Newark   (Site not responding. Last check: 2007-11-06)
EAST RUTHERFORD, N.J. — NBA Commissioner David Stern is hopeful a deal can be worked out that will allow the Nets to move from the Meadowlands and play in New Jersey's largest city.
He spoke minutes before the Nets played the Indiana Pacers in Game 2 of their best-of-5 first-round playoff series at the Continental Airlines Arena on Monday night.
YankeeNets, the company that owns both the Nets and New Jersey Devils of the NHL, has been trying to work out a deal with the state to build a new arena in Newark and to move the teams there.
www.usatoday.com /sports/nba/nets/2002-04-23-newark.htm   (434 words)

  
 CiteULike: Tag proof   (Site not responding. Last check: 2007-11-06)
Proof systems for structured specifications and their refinements
Proof interpretations and the computational content of proofs
Slaying the Kraken: The Sociohistory of a Mathematical Proof
www.citeulike.org /tag/proof   (569 words)

  
 Bibliography on Linear Logic
The semantics and proof theory of linear logic.
On proof nets for multiplicative and additive linear logic: Correctness conditions and intuitionistic translations.
Proof nets and typed lambda calculus I: Empires and kingdoms.
www-2.cs.cmu.edu /~carsten/linearbib/llb.html   (6680 words)

  
 Proof Nets and Boolean Circuits   (Site not responding. Last check: 2007-11-06)
We study the relationship between proof nets for mutiplicative linear logic (with unbounded fan-in logical connectives) and Boolean circuits.
We give simulations of each other in the style of the proofs-as-programs correspondence; proof nets correspond to Boolean circuits and cut-elimination corresponds to evaluation.
The depth of a proof net is defined to be the maximum logical depth of cut formulas in it, and it is shown that every unbounded fan-in Boolean circuit of depth n, possibly with stCONN₂ gates, is polynomially simulated by a proof net of depth O(n) and vice versa.
csdl.computer.org /comp/proceedings/lics/2004/2192/00/21920182abs.htm   (185 words)

  
 Generation with Semantic Proof Nets (ResearchIndex)   (Site not responding. Last check: 2007-11-06)
Abstract: Categorial grammars and Lambek calculus found a nice embedding in Linear Logic, and a lot of work have presented proof nets uses for linguistic purposes, with a special look at proof nets for Lambek calculus.
But they have mainly explored the syntactic capabilities of proof nets, describing parsing processes.
The main features of this proposal consist in the use of proof nets for lambek calculus but also for...
citeseer.ist.psu.edu /459766.html   (429 words)

  
 Petri nets based proof of ADA 95 solution for preference control.   (Site not responding. Last check: 2007-11-06)
Preference control is the ability to satisfy a request depending on the parameters passed in by the calling task and often also on the internal state of the server.
This description, which can be done in terms of colored Petri nets, can lead jointly to validate the chosen implementation and to program it with protected objects and requeue statements of Ada-95.
The paper is issued from an examination exercise that has followed a course on Programming and Validation of Concurrent Applications and is presented in form of progressive steps for which the students were expected to give answer.
www.informatik.uni-hamburg.de /TGI/pnbib/b/barkaoui_k2.html   (253 words)

  
 Paola Bruscoli
My research interests focus on structural proof theory, substructural logics and their application in the design of logical languages for planning and concurrency, logic programming, concurrency, and more in general mathematical foundations of language design and theoretical computer science.
Workshop SD'05 -- Structures and Deduction - the quest for the essence of proofs, satellite of ICALP '05, Lisbon 16--17 July 2005.
Moreover, the translation is not an encoding, meaning that to the algebraic structure of Nabla programs is assigned logical meaning through a non-trivial use of linear logic connectives, as opposed to merely reflecting their operational behavior through a simulation into terms of the logic.
iccl.tu-dresden.de /~paola   (2181 words)

  
 Edmund Robinson: Proof Nets for Classical Logic   (Site not responding. Last check: 2007-11-06)
In this talk I propose to outline how someone seeking a more graphical representation is led to something like proof nets, and to explain why the only serious problem in adapting the standard linear technology is caused by weakening.
This gives a notion of proof net for full classical propositional logic.
We sketch the proof that any such net is sequentialisable (i.e.
www.cs.bham.ac.uk /~exr/dag01/robinson.html   (129 words)

  
 Structures and Deduction
This meeting is about new algebraic and geometric methods in proof theory, with the aim of expanding our ability to manipulate proofs, eliminate bureaucracy from deductive systems, and ultimately provide: 1) a satisfying answer to the problem of identity of proofs and 2) tools for improving our ability to implement logics.
New proof nets, and new associated semantics, are giving surprising insight about the very subtle relationship between categories and proofs, for example in the formerly intractable case of classical logic.
The field of deduction modulo, which turns out to be very much in the spirit of deep inference, decreases our dependency on the syntactic presentation of functional objects, and brings us closer to their intrinsic nature, even from the computational point of view.
www.prooftheory.org /sd05   (561 words)

  
 Other references on linear logic and proof nets   (Site not responding. Last check: 2007-11-06)
Date: Mon, 02 Dec 91 10:18:24 EST To: linear@cs.stanford.edu Dear Pat, in view of previous messages, I would like to point out that I give a proof of sequentialization for multiplicative proof nets in Constructive Logic Part II: Linear Logic and Proof nets.
The proof in the PRL report had a faulty lemma which is corrected in the Penn Tech report.
The proof does NOT explicitly use empires, but I have since realized that for the quantifier case, some form of empire is necessary.
www.cis.upenn.edu /~bcpierce/types/archives/1991/msg00118.html   (180 words)

  
 Coherence for weakly distributive categories
We wish to announce that the following paper may be obtained by anonymous ftp (details below) or directly from the authors.
(These are a natural generalization of monoidal categories to include a second "interwoven" tensor, the interweaving given by tensorial strength - the "weak distributivities".) * New uses of logical techniques to prove coherence: proof nets and empires (from linear logic).
We prove a sequentialization theorem for these nets and the corresponding sequent calculus, and deduce the coherence theorem for weakly distributive categories.
www.seas.upenn.edu /~sweirich/types/archive/1993/msg00009.html   (462 words)

  
 From Proof-Nets to Interaction Nets - Lafont (ResearchIndex)   (Site not responding. Last check: 2007-11-06)
Abstract: Introduction If we consider the interpretation of proofs as programs, say in intuitionistic logic, the question of equality between proofs becomes crucial: The syntax introduces meaningless distinctions whereas the (denotational) semantics makes excessive identifications.
This question does not have a simple answer in general, but it leads to the notion of proof-net, which is one of the main novelties of linear logic.
On Proof Nets for Multiplicative Linear Logic with Units - Straßburger, Lamarche (2004)
citeseer.ist.psu.edu /lafont94from.html   (513 words)

  
 CiteULike: Connection methods in linear logic and proof nets construction   (Site not responding. Last check: 2007-11-06)
Connection methods in linear logic and proof nets construction
In this paper, we analyse the relationships between the proof net notion of LL and the connection notion used for efficient proof-search in different logics.
Aiming at using proof nets as a tool for automated deduction in linear logic, we define a connection-based characterization of provability in Multiplicative Linear Logic (MLL).
www.citeulike.org /user/vcvpaiva/article/441036   (284 words)

Try your search on: Qwika (all wikis)

Factbites
  About us   |   Why use us?   |   Reviews   |   Press   |   Contact us  
Copyright © 2005-2007 www.factbites.com Usage implies agreement with terms.