Contents 1. Introduction. 2. Heirs. 3. The invariance group of a cut. 4. Review of T-convex valuation rings. 5. The invariance valuation ring of a cut. 6. A method for producing cuts with prescribed signature. 7. Existentially closed extensions. 1. Introduction. Let M be a totally ordered set. A (Dedekind) cut p of M is a couple (p L , p R) of subsets p L , p R of M such that p L ∪ p R = M and ...

A cut set is a collection of component failure modes that could lead to a system failure. Cut Set Analysis (CSA) is applied to critical systems to identify and rank system vulnerabilities at design time. Model checking tools have been used to automate the generation of minimal cut sets but are generally based on checking reachability of system failure states. This paper describes a new approach...

We consider a problem which occurs in testing for short circuits in printed circuit board components. This problem can be modeled as the covering of the edges of an undirected graph by cuts. In particular, we look for a family of cuts F = f(C1; C1) : : : ; (C; C)g with minimal cardi-nality , such that each edge belongs to at least one (Ci; Ci). We call this problem the Minimal Cut Cover problem...

The aim of this paper is to study the properties of t-cut set, strong t-cut set, t-quasi-cut set, strong t-quasi-cut set and ∈ ∨q-cut set of a fuzzy set μ. For any intuitionistic fuzzy A =< μA, νA > and α, β ∈ [0, 1], we define and study the properties of upper (α, β) cut setA(α,β), strong upper (α, β) cut setA(α, β) ̇ , lower (α, β) cut set A, strong lower (α, β) cut set A (α, β) ̇ , upper (α, β...

We consider the separation problem for sets X that are inverse images of a given set S by a linear mapping. Classical examples occur in integer programming, complementarity problems and other optimization problems. One would like to generate valid inequalities that cut off some point not lying in X , without reference to the linear mapping. Formulas for such inequalities can be obtained through...

Cut-elimination is usually presented as a set of local proof reduction steps together with a terminating strategy thus showing the existence of cut-free proofs for all provable sequents. Viewing cut-elimination as a transformation of mathematical proofs, not only the existence but also the structure and content of the cut-free proofs deserves investigation. In this paper we use proof skeletons ...

ion_map(BindMapDefn) --> bindings_map_definition(BindMapDefn). abstraction_map(Omd) --> other_map_definition(Omd). abstraction_map([]) --> []. property_s_list([Prop|PropL]) --> property_s(Prop), [token(’;’, misc)], property_s_list(PropL). property_s_list([Prop]) --> property_s(Prop), opt_semi. property_s_list([]) --> []. bindings_map_definition(bindings_map_definition(TypedId, BindL)) --> [toke...