Related papers: Coherent Adequate Sets and Forcing Square
In this paper we present a theoretical framework for studying coherent acceptability indices in a dynamic setup. We study dynamic coherent acceptability indices and dynamic coherent risk measures, and we establish a duality between them. We…
We show that there exist two proper creature forcings having a simple (Borel) definition, whose product is not proper. We also give a new condition ensuring properness of some forcings with norms.
Based on works of Saharon Shelah, Jakob Kellner, and Anda T\u{a}nasie for controlling the cardinal characteristics of the continuum in ccc forcing extensions, in the author's master's thesis was introduced a new combinatorial notion: the…
We show how definite extended logic programs can be used for defining and reasoning with rough sets. Moreover, a rough-set-specific query language is presented and an answering algorithm is outlined. Thus, we not only show a possible…
Weight constraint and aggregate programs are among the most widely used logic programs with constraints. In this paper, we relate the semantics of these two classes of programs, namely the stable model semantics for weight constraint…
A homogenizable structure $\mathcal{M}$ is a structure where we may add a finite amount of new relational symbols to represent some $\emptyset-$definable relations in order to make the structure homogeneous. In this article we will divide…
Answer Set Programming (ASP) is a well-established formalism for nonmonotonic reasoning. An ASP program can have no answer set due to cyclic default negation. In this case, it is not possible to draw any conclusion, even if this is not…
We propose a new perspective for the evaluation of matching procedures by considering the complexity of the function class they belong to. Under this perspective we provide theoretical guarantees on post-matching covariate balance through a…
A convex relaxation of a quadratically constrained quadratic program (QCQP) is called exact if it has a rank-$1$ optimal solution that corresponds to an optimal solution of the QCQP. Given a QCQP whose convex relaxation is exact, this paper…
We develop the notion of coherent ultrafilters (extenders without normality or well-foundedness). We then use definable coherent ultraproducts to characterize any extension of a model $M$ in any fragment of $\mathbb{L}_{\infty, \omega}$…
The forcing number of a perfect matching of a graph was introduced by Harary et al., which originated from Klein and Randi\'{c}'s ideal of innate degree of freedom of Kekul\'{e} structure in molecular graph. On the opposite side in some…
In this paper will be introduced large, probably complete family of complex base systems, which are 'proper' - for each point of the space there is a representation which is unique for all but some zero measure set. The condition defining…
This paper provides a model theoretic semantics to feature terms augmented with set descriptions. We provide constraints to specify HPSG style set descriptions, fixed cardinality set descriptions, set-membership constraints, restricted…
A convex sequential effect algebra (COSEA) is an algebraic system with three physically motivated operations, an orthogonal sum, a scalar product and a sequential product. The elements of a COSEA correspond to yes-no measurements and are…
Autoregressive models are a class of time series models that are important in both applied and theoretical statistics. Typically, inferential devices such as confidence sets and hypothesis tests for time series models require nuanced…
Stemming from de Finetti's work on finitely additive coherent probabilities, the paradigm of coherence has been applied to many uncertainty calculi in order to remove structural restrictions on the domain of the assessment. Three possible…
We give necessary and sufficient conditions for an orthogonal series to converge in the mean-squares to a nonnegative function. We present many examples and applications, in analysis and probability. In particular, we give necessary and…
We propose a general definition of perfect equilibrium which is applicable to a wide class of games. A key feature is the concept of completely mixed nets of strategies, based on a more detailed notion of carrier of a strategy. Under…
This paper investigates the convexity of the solution set of the linear complementarity problems over tensor spaces (TLCPs). We introduce the notion of a $T$-column sufficient tensor and study its properties and relationships with several…
For a 4th order 3-dimensional cyclic symmetric tensor, a sufficient and necessary condition is bulit for its positive semi-definiteness. A sufficient and necessary condition of positive definiteness is showed for a 4th order $n$-dimensional…