Related papers: The strength of countable saturation
We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.
The proof of Theorem 11 of the paper M. Scheepers, Remarks on countable tightness, Topology and its Applications 161 (2014), 407 - 432 relies on Lemma 10 of that paper. The offered proof of Lemma 10 had shortcomings, and I was recently…
We report about some results, interesting examples, problems and conjectures revolving around the parabolic Kostant partition functions, the parabolic Kostka polynomials and ``saturation'' properties of several generalizations of the…
A Markov chain approach is applied to determine the capacity of a general class of q-ary ICI-free constrained systems that satisfy an arbitrary count constraint.
The saturation-based reasoning methods are among the most theoretically developed ones and are used by most of the state-of-the-art first-order logic reasoners. In the last decade there was a sharp increase in performance of such systems,…
A method how to construct Boolean-valued models of some fragments of arithmetic was developed in Krajicek (2011), with the intended applications in bounded arithmetic and proof complexity. Such a model is formed by a family of random…
Although reasoning about equations over strings has been extensively studied for several decades, little research has been done for equational reasoning on general clauses over strings. This paper introduces a new superposition calculus…
We introduce the new notion of quotient-saturation as a measure of the immensity of the quotient structure of a group. We present a sufficient condition for a finitely presented group to be quotient-saturated, and use it to deduce that…
It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple…
We establish strong invariance principles for sums of stationary and ergodic processes with nearly optimal bounds. Applications to linear and some nonlinear processes are discussed. Strong laws of large numbers and laws of the iterated…
In the former article "Formal mathematical systems including a structural induction principle" we have presented a unified theory for formal mathematical systems including recursive systems closely related to formal grammars, including the…
Through a direct implementation of the saturation regime resulting from the unitarity limit in the impact parameter representation, we explore various possibilities for the energy dependence of hadronic scattering. We show that it is…
Individual choices often depend on the order in which the decisions are made. In this paper, we expose a general theory of measurable systems (an example of which is an individual's preferences) allowing for incompatible (non-commuting)…
This talk is an attempt to review all our knowledge on saturation at low $x$ both theoretical and experimental, to stimulate a search for saturation effects at THERA. The main goals of this presentation are 1. To discuss an intuitive…
Multi-stack pushdown systems are a well-studied model of concurrent computation using threads with first-order procedure calls. While, in general, reachability is undecidable, there are numerous restrictions on stack behaviour that lead to…
We introduce the class of unshreddable theories, which contains the simple and NIP theories, and prove that such theories have exactly saturated models in singular cardinals, satisfying certain set-theoretic hypotheses. We also give…
Inspired by nonstandard analysis, we define and study internal subsets and internal functions in algebras of Colombeau generalized functions. We prove a saturation principle for internal sets and provide applications to Colombeau algebras.
I prove preservation theorems for countable support iteration of proper forcing concerning certain classes of capacities and submeasures. New examples of forcing notions and connections with measure theory are included.
This survey paper examines the effective model theory obtained with the BSS model of real number computation. It treats the following topics: computable ordinals, satisfaction of computable infinitary formulas, forcing as a construction…
We study sequential measurement scenarios where the system is repeatedly subjected to the same measurement process. We first provide examples of such repeated measurements where further repetitions of the measurement do not increase our…