The relative expressive power of a sentential operator U]o~ is compared to that of a syntactical predicate L('c~') in the setting of first-order logics. Despite results by Montague and by Thomason that claim otherwise, any of the so-called CCmodal" logics of knowledge and belief can be translated into classical first-order logics that have a corresponding predicate on sentences.

We identify in this paper two conditions that characterize the domain of single-peaked preferences on the line in the following sense: a preference profile satisfies these two properties if and only if there exists a linear order L over the set of alternatives such that these preferences are single-peaked with respect L. The first property states that for any subset of alternatives the set of a...

Equality in first-order logic is represented in the language by means of a logical symbol and so it is interpreted uniformly; the semantics says that its interpretation in any structure is the identity relation. This is the absolute notion of identity however, and in fact the only one deserving this name. But there is a related relation: the relation of indiscernibility. Given a structure for a...

The adaptation of Lactobacillus sakei to a meat environment is reflected in its metabolic potential. For instance, the ability to utilize arginine through the arginine deiminase (ADI) pathway, resulting in additional ATP, represents a competitive benefit. In L. sakei CTC 494, the arc operon (arcABCTDR) shows the same gene order and organization as that in L. sakei 23K, the genome sequence of wh...

in this paper, we investigate the l-fuzzy proximities and the relationships betweenl-fuzzy topologies, l-fuzzy topogenous order and l-fuzzy uniformity. first, we show that the category of-fuzzy topological spaces can be embedded in the category of l-fuzzy quasi-proximity spaces as a coreective full subcategory. second, we show that the category of l -fuzzy proximity spaces is isomorphic to the ...

The relative worst order ratio is a measure for the quality of online algorithms. Unlike the competitive ratio, it compares algorithms directly without involving an optimal offline algorithm. The measure has been successfully applied to problems like paging and bin packing. In this paper, we apply it to machine scheduling. We show that for preemptive scheduling, the measure separates multiple p...

This paper addresses the estimation of Relative Transfer Function (RTF) between microphones from noisy recordings. We utilize an incomplete initial measurement of the RTF, which is known for only several frequency bins. The measurement is completed by finding its sparsest representation in the time domain. We propose to perform this reconstruction by solving a Second-Order Cone Program (SOCP). ...

For two subsetsW and V of a normed space X. The relative Kolmogorov n-width ofW relative to V in X is defined by Kn(W,V )X := inf Ln sup f∈W inf g∈V∩Ln ‖f − g‖X , where the infimum is taken over all n-dimensional subspaces Ln of X. For ∈ R+, defineW p (1 p ∞) to be the collection of 2 -periodic and continuous functions f representable as a convolution f (t)= c + (B ∗ g)(t), where g ∈ Lp(T ), T ...