Displaying similar documents to “Lexicographic combinations of preference relations in the context of Possibilistic Decision Theory.”

Bertrand’s Ballot Theorem

Karol Pąk (2014)

Formalized Mathematics

Similarity:

In this article we formalize the Bertrand’s Ballot Theorem based on [17]. Suppose that in an election we have two candidates: A that receives n votes and B that receives k votes, and additionally n ≥ k. Then this theorem states that the probability of the situation where A maintains more votes than B throughout the counting of the ballots is equal to (n − k)/(n + k). This theorem is item #30 from the “Formalizing 100 Theorems” list maintained by Freek Wiedijk at http://www.cs.ru.nl/F.Wiedijk/100/. ...

Strong normalization proofs for cut elimination in Gentzen's sequent calculi

Elias Bittar (1999)

Banach Center Publications

Similarity:

We define an equivalent variant L K s p of the Gentzen sequent calculus L K . In L K s p weakenings or contractions can be performed in parallel. This modification allows us to interpret a symmetrical system of mix elimination rules L K s p by a finite rewriting system; the termination of this rewriting system can be machine checked. We give also a self-contained strong normalization proof by structural induction. We give another strong normalization proof by a strictly monotone subrecursive interpretation;...

Algorithm for turnpike policies in the dynamic lot size model

Stanisław Bylka (1996)

Applicationes Mathematicae

Similarity:

This article considers optimization problems in a capacitated lot sizing model with limited backlogging. Nothing is assumed about the cost function in the case of finite restrictions of the size on the stock and backlogs. The holding and backlogging costs are functions assumed to be stationary or nearly stationary in time. In both cases, it is shown that there exists an optimal infinite inverse policy and a periodical turnpike policy. Some forward and backward procedures are adopted...

Beta-reduction as unification

A. Kfoury (1999)

Banach Center Publications

Similarity:

We define a new unification problem, which we call β-unification and which can be used to characterize the β-strong normalization of terms in the λ-calculus. We prove the undecidability of β-unification, its connection with the system of intersection types, and several of its basic properties.