Results 1  10
of
610,284
cutting rules
, 1997
"... A complete derivation, from first principles, of the reactionrate formula for a generic process taking place in a heat bath of finite volume is given. It is shown that the formula involves no finitevolume correction. Through perturbative diagrammatic analysis of the resultant formula, the detailed ..."
Abstract
 Add to MetaCart
, the detailedbalance formula is derived. The zerotemperature limit of the formula is discussed. Thermal cutting rules, which are introduced in previous work, are compared with those introduced by other authors.
Proof Theory of the Cut Rule
"... The cut rule is a very basic component of any sequentstyle presentation of a logic. This essay starts by describing the categorical proof theory of the cut rule in a calculus which allows sequents to have many formulas on the left but only one on the right of the turnstile. We shall assume a minimu ..."
Abstract
 Add to MetaCart
The cut rule is a very basic component of any sequentstyle presentation of a logic. This essay starts by describing the categorical proof theory of the cut rule in a calculus which allows sequents to have many formulas on the left but only one on the right of the turnstile. We shall assume a
On the cut rule in the calculus of structures
, 2007
"... We investigate the proof complexity of analytic subsystems of the deep inference proof system SKSg (the calculus of structures). Exploiting the fact that the socalled cut rule of SKSg does not correspond to cut in the sequent calculus, but to the ¬left rule, we establish that the “analytic ” syste ..."
Abstract
 Add to MetaCart
We investigate the proof complexity of analytic subsystems of the deep inference proof system SKSg (the calculus of structures). Exploiting the fact that the socalled cut rule of SKSg does not correspond to cut in the sequent calculus, but to the ¬left rule, we establish that the “analytic
Cut Rules and Explicit Substitutions
, 2000
"... this paper deals exclusively with intuitionistic logic (in fact, only the implicative fragment), we require succedents to be a single consequent formula. Natural deduction systems, which we choose to call Nsystems, are symbolic logics generally given via introduction and elimination rules for the l ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
systems on the other hand seem to have an easier proof theory. Lsystems are often extended with a "cut" rule as part of showing that for a given Lsystem and Nsystem, the derivations of each system can be encoded in the other. For example, NK proves the same as LK + cut (Gentzen 1935). Proof Normalization
Controlled Integrations of the Cut Rule into Connection Tableau Calculi
"... In this paper techniques are developed and compared which increase the inferential power of tableau systems for classical firstorder logic. The mechanisms are formulated in the framework of connection tableaux, which is an amalgamation of the connection method and the tableau calculus, and a genera ..."
Abstract

Cited by 65 (3 self)
 Add to MetaCart
generalization of model elimination. Since connection tableau calculi are among the weakest proof systems with respect to proof compactness, and the (backward) cut rule is not suitable for the firstorder case, we study alternative methods for shortening proofs. The techniques we investigate are the folding up
UNITARITY CUTTING RULES FOR HARD PROCESSES ON NUCLEAR TARGETS
, 809
"... Unitarity cutting rules for the multiplicity of cut Pomerons, or topological cross sections have been obtained within the framework of nonlinear k ⊥ factorisation. Proper account for the color coupled channel aspects of the problem leads to the emergence of two types of cut Pomerons. This is illustr ..."
Abstract
 Add to MetaCart
Unitarity cutting rules for the multiplicity of cut Pomerons, or topological cross sections have been obtained within the framework of nonlinear k ⊥ factorisation. Proper account for the color coupled channel aspects of the problem leads to the emergence of two types of cut Pomerons
Theoretical improvements in algorithmic efficiency for network flow problems

, 1972
"... This paper presents new algorithms for the maximum flow problem, the Hitchcock transportation problem, and the general minimumcost flow problem. Upper bounds on ... the numbers of steps in these algorithms are derived, and are shown to compale favorably with upper bounds on the numbers of steps req ..."
Abstract

Cited by 560 (0 self)
 Add to MetaCart
required by earlier algorithms. First, the paper states the maximum flow problem, gives the FordFulkerson labeling method for its solution, and points out that an improper choice of flow augmenting paths can lead to severe computational difficulties. Then rules of choice that avoid these difficulties
A Computational Model of the ShortCut Rule for 2D Shape Decomposition
, 2014
"... We propose a new 2D shape decomposition method based on the shortcut rule. The shortcut rule originates from cognition research, and states that the human visual system prefers to partition an object into parts using the shortest possible cuts. We propose and implement a computational model for t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
We propose a new 2D shape decomposition method based on the shortcut rule. The shortcut rule originates from cognition research, and states that the human visual system prefers to partition an object into parts using the shortest possible cuts. We propose and implement a computational model
DAMTP 96/64 SIMPLE PHYSICAL APPROACH TO THERMAL CUTTING RULES
, 1996
"... A firstprinciples derivation is given of the imaginary part of a Green’s function in realtime thermal field theory. The analysis and its conclusions are simpler than in the usual circledvertex formalism. The relationship to Cutkoskylike cutting rules is explained. In a recent paper, Bedaque, Das ..."
Abstract
 Add to MetaCart
A firstprinciples derivation is given of the imaginary part of a Green’s function in realtime thermal field theory. The analysis and its conclusions are simpler than in the usual circledvertex formalism. The relationship to Cutkoskylike cutting rules is explained. In a recent paper, Bedaque
DAMTP 96/64 SIMPLE PHYSICAL APPROACH TO THERMAL CUTTING RULES
, 1996
"... A firstprinciples derivation is given of the imaginary part of a Green’s function in realtime thermal field theory. The analysis and its conclusions are simpler than in the usual circledvertex formalism. The relationship to Cutkoskylike cutting rules is explained. In a recent paper, Bedaque, Das ..."
Abstract
 Add to MetaCart
A firstprinciples derivation is given of the imaginary part of a Green’s function in realtime thermal field theory. The analysis and its conclusions are simpler than in the usual circledvertex formalism. The relationship to Cutkoskylike cutting rules is explained. In a recent paper, Bedaque
Results 1  10
of
610,284