Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 6 of 6 for “"cut–elimination"”.

  1. Orthomodular Lattices and Cut Elimination

    … lattices. It was a proof theoretical 'partial' cut elimination procedure.

    uiuc Repository record for Orthomodular Lattices and Cut Elimination (opens in a new tab)

  2. Deep Inference and Symmetry in Classical Proofs

    … derivations. Like sequent systems, they have a cut rule which is admissible. Unlike sequent systems, they enjoy various new interesting properties. Not only the identity axiom, but also cut, weakening and even contraction are reducible to atomic form. This leads to inference rules that are …

    qucosa-diss

  3. Modal and fixpoint linear logic.

    … and the indexed sequents of Mints, and prove cut-elimination properties. We show that semantics and deductive systems that are equivalent for classical modal logic become nonequivalent when adapted to linear logic. We also provide a semantics based on Girard's phase semantics for the fixpoint …

    ottawa-retro Repository record for Modal and fixpoint linear logic. (opens in a new tab)

  4. Linear Logic and Noncommutativity in the Calculus of Structures

    … in the sequent calculus. All systems enjoy the cut elimination property. Moreover, this can be proved independently from the sequent calculus via techniques that are based on the new top-down symmetry. Furthermore, for all systems, I will present several decomposition theorems which constitute a …

    qucosa-diss

  5. A Possible and Necessary Consistency Proof

    … natural deduction. The former proof includes a cut elimination theorem for the calculus and a syntactical study of the purely arithmetical part of the system. The latter consistency proof in standard natural deduction has been an open problem since the publication of Gentzen's proofs. The …

    helsinki Repository record for A Possible and Necessary Consistency Proof (opens in a new tab)

  6. Verovatnosni računi sekvenata i klasifikacija neklasičnih logika zasnovana na entropiji

    Posle kratkog uvodnog pregleda, rad je podeljen na dva dela. Prvi deo se bavi prisustvom verovatnoće u logici (v. [16], [17], [18], [19], [22], [23] i [24]), a drugi je posvećen primeni entropije u klasifikaciji polivalentnih logika (v. [14], [15], [20], [21] i [25]). Osnovna ideja koja dominira …

    belgrade Repository record for Verovatnosni računi sekvenata i klasifikacija neklasičnih logika zasnovana na entropiji (opens in a new tab)