Several methods for checking admissibility of rules in the modal logic S4 are presented in [1], [15]. These methods determine admissibility of rules in S4, but they don’t determine or give substitutions rejecting inadmissible rules. In this paper, we investigate some relations between one of the above methods, based on the reduced normal form rules, and sets of substitutions which reject them. ...

In this paper we study the relationship between the notion of coherence for conditional prevision assessments on a family of finite conditional random quantities and the notion of admissibility with respect to bounded strictly proper scoring rules. Our work extends recent results given by the last two authors of this paper on the equivalence between coherence and admissibility for conditional p...

We give new and very general characterizations for uniform exponential dichotomy of variational difference equations in terms of the admissibility of pairs of sequence spaces over N with respect to an associated control system. We establish in the variational case the connections between the admissibility of certain pairs of sequence spaces over N and the admissibility of the corresponding pair...

In the article author, using comparative as well other methods of scientific research, analyses issues related to admissibility illegally obtained evidence in civil proceedings. The author intends answer question whether doctrine “fruits poisonous tree” is applied Lithuania and, if so, what extent.

Best-first search is a general search technique that uses an evaluation function to determine what nodes to expand. A* is a well-known best-first search algorithm for finding leastcost solution paths on search problems where the cost of a solution path is the sum of the edge costs. In this paper, we focus on search problems where the cost of a solution path is the maximum edge cost. We present ...

Hubbard trees are invariant trees connecting the points of the critical orbits of postcritically finite polynomials. Douady and Hubbard [DH1] introduced these trees and showed that they encode the essential information of Julia sets in a combinatorial way. The itinerary of the critical orbit within the Hubbard tree is encoded by a (pre)periodic sequence on {0, 1} called kneading sequence. We pr...

We identify two wide families of propositional sequent calculi for which cut-admissibility is a corollary of the subformula property. While the subformula property is often a simple consequence of cutadmissibility, our results shed light on the converse direction, and may be used to simplify cut-admissibility proofs in various propositional sequent calculi. In particular, the results of this pa...

This paper discusses the admissibility of agglomerative hierarchical clustering algorithms with respect to space distortion and monotonicity, as defined by Yadohisa et al. and Batagelj, respectively. Several admissibilities and their properties are given for selecting a clustering algorithm. Necessary and sufficient conditions for an updating formula, as introduced by Lance and Williams, are pr...