In a system of sequents for intuitionistic predicate logic a theorem, which corresponds to Prawitz’s Normal Form Theorem for natural deduction, are proved. In sequent derivations a special kind of cuts, maximum cuts, are defined. Maximum cuts from sequent derivations are connected with maximum segments from natural deduction derivations, i.e., sequent derivations without maximum cuts correspond...

The notions of directed distances, quasi-metrics and oriented multi-cuts are generalizations of the notions of distances, metrics and cuts, which are central objects in graph theory and combinatorial optimization. Define a quasi-semi-metric on X as a function d from X2 to R+, such that for all x, y, z ∈ X , d(x, y) ≥ 0, d(x, x) = 0, and d(x, y) ≤ d(x, z) + d(z, y). If the first inequality is st...

CutRes is a system which takes as input an LK-proof with arbitrary cuts and skolemized end-sequent and gives as output an LKproof with atomic cuts only. The elimination of cuts is performed in the following way: An unsatisfiable set of clauses C is assigned to a given LK-proof Π. Any resolution refutation ψ of C then serves as a skeleton for an LK-proof Σ of the original end-sequent, containing...

In the early 1980s, Balas and Jeroslow presented monoidal disjunctive cuts exploiting the integrality of variables. This article investigates the relation of monoidal cut strengthening to other classes of cutting planes for general two-term disjunctions. We introduce a generalization of mixed-integer rounding cuts and show equivalence to monoidal disjunctive cuts. Moreover, we demonstrate the e...

This paper tests the ‘morale’ theory of downward nominal wage rigidity. This theory relies on workers disliking nominal pay cuts: cuts should make workers less happy. We investigate this using panel data on individual employees’ pay and satisfaction. We confirm that nominal cuts do make workers less happy than if their pay had not fallen. But we find no difference in the effect on happiness of ...

Given a connected graph, in many cases it is possible to construct a structure tree that provides information about the ends of the graph or its connectivity. For example Stallings’ theorem on the structure of groups with more than one end can be proved by analyzing the action of the group on a structure tree and Tutte used a structure tree to investigate finite 2-connected graphs, that are not...

1 Minimum Cuts In this lecture we will describe an algorithm that computes the minimum cut (or simply mincut) in an undirected graph. A cut is deened as follows.

The daytime net ecosystem exchange of CO2 (NEE) was measured in an even-aged slash pine plantation in northern Florida from 1999 to 2001 using the eddy covariance technique. In August 2000, two clear-cuts were formed approximately 1 km west of the study site. A statistical approach was used to determine whether the clear-cuts induced changes in CO2 concentration, wind direction, horizontal and ...

A large number of problems in computer vision can be modelled as energy minimization problems in a Markov Random Field (MRF) or Conditional Random Field (CRF) framework. Graph-cuts based α-expansion is a standard movemaking method to minimize the energy functions with submodular pairwise terms. However, certain problems require more complex pairwise terms where the α-expansion method is general...