In this note the equivalence among Well-ordering Principle, Principle of Finite Induction and certain natural conditions concerning set integers is discussed, thereby clarifying facts encountered in literature.

This paper introduces and studies the leximin Paretian ordering, which refines the consensual leximin ordering by adding the Pareto principle to the concept of lexicographic egalitarianism. We also provide an alternative characterization of the consensual Rawlsian ordering. We introduce several new axioms, including the Permutation Pareto Principle and Internal Dominance, and study their logica...

The ordering principle states that every finite linear order has a least element. We show that, in the relativized setting, the surjective weak pigeonhole principle for polynomial time functions does not prove a Herbrandized version of the ordering principle over T 2 . This answers an open question raised in [Buss, Ko lodziejczyk and Thapen, 2012] and completes their program to compare the stre...

This paper deals with a new family of (A, N)-implications that derived from fuzzy negation and continuous monotone function, and some properties, like the left neutrally, the exchange principle, the ordering property and the laws of contraposition, of the proposed family of (A, N)-implications are studied. Moreover, the T-conditionality and the Modus tollens for the new family of (A, N)-i...

Inspired by the recent proposal by Feldman and Cousins [1] of a “unified approach to the classical statistical analysis of small signals” based on a choice of ordering in Neyman’s construction of classical confidence intervals, I propose a new ordering principle for the classical statistical analysis of Poisson processes with background which minimizes the effect on the resulting confidence int...

By using a modified argument, we prove an improvement of our former Altman type generalization of the Brézis–Browder ordering principle which yields a stronger maximum principle.