Related papers: Splitting stationary sets from weak forms of Choic…

We introduce notions of stationarily ordered types and theories; the latter generalizes weak o-minimality and the first is a relaxed version of weak o-minimality localized at the locus of a single type. We show that forking, as a binary…

In S. 1 we deal with amalgamation bases, e.g., we define when an a.e.c. $k$ has $(\lambda,\kappa)$-amalgamation which means "many" M in $K^k_\lambda$ are amalgamation bases. We then consider what happens for the class of lf groups. In S. 2…

We consider compactness characterizations of large cardinals. Based on results of Benda \cite{b-sccomp}, we study compactness for omitting types in various logics. In $\bL_{\kappa, \kappa}$, this allows us to characterize any large cardinal…

We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…

This paper illustrates the richness of the concept of regular sets of time bounds and demonstrates its application to problems of computational complexity. There is a universe of bounds whose regular subsets allow to represent several time…

Answering a question by Honsell and Plotkin, we show that there are two equations between lambda terms, the so-called subtractive equations, consistent with lambda calculus but not simultaneously satisfied in any partially ordered model…

We show that, given some lacunary sequence of angles $\mathbf{\theta}=(\theta_j)_{j\in\N}$ not converging too fast to zero, it is possible to build a rare differentiation basis $\mathcal{B}$ of rectangles parallel to the axes that…

In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…

Sets with atoms serve as an alternative to ZFC foundations for mathematics, where some infinite, though highly symmetric sets, behave in a finitistic way. Therefore, one can try to carry over analysis of the classical algorithms from finite…

We introduce a framework for ordinal notation systems, present a family of strong yet simple systems, and give many examples of ordinals in these systems. While much of the material is conjectural, we include systems with conjectured…

We consider the problem of deciding the satisfiability of quantifier-free formulas in the theory of finite sets with cardinality constraints. Sets are a common high-level data structure used in programming; thus, such a theory is useful for…

We prove several results giving lower bounds for the large cardinal strength of a failure of the singular cardinal hypothesis. The main result is the following theorem: Theorem: Suppose $\kappa$ is a singular strong limit cardinal and…

Aggregating the preferences of individuals into a collective decision is the core subject of study of social choice theory. In 2006, Procaccia and Rosenschein considered a utilitarian social choice setting, where the agents have explicit…

We consider the "limiting behavior" of *discriminants*, by which we mean informally the locus in some parameter space of some type of object where the objects have certain singularities. We focus on the space of partially labeled points on…

We force $2^\lambda$ to be large and for many pairs in the interval $(\lambda,2^\lambda)$ a stronger version of the polarized partition relations hold. We apply this toproblem in general topology

We define a fragment of monadic infinitary second-order logic corresponding to an abstract separation property. We use this to define the concept of a separation subclass. We use model theoretic techniques and games to show that separation…

The application of the approximation-operational approach to solving linear differential equations of fractional order with variable coefficients is considered. It is shown that the method can also be applied to solving differential…

Let \alpha be a countable ordinal and \P(\alpha) the collection of its subsets isomorphic to \alpha. We show that the separative quotient of the set \P (\alpha) ordered by the inclusion is isomorphic to a forcing product of iterated reduced…

We prove existence and up to the boundary regularity estimates in $L^{p}$ and H\"{o}lder spaces for weak solutions of the linear system $$ \delta \left( A d\omega \right) + B^{T}d\delta \left( B\omega \right) = \lambda B\omega + f \text{ in…

Minimal varying $\Lambda$ theories are defined by an action built from the Einstein-Cartan-Holst first order action for gravity with the cosmological constant $\Lambda$ as an independent scalar field, and supplemented by the Euler and…