Related papers: On fresh sets in iterations of Prikry type forcing…
Dynamical Systems theory generally deals with fixed point iterations of continuous functions. Computation by Turing machine although is a fixed point iteration but is not continuous. This specific category of fixed point iterations can only…
Here it is shown that standard set theory can be interpreted in a theory about order. The ordering here is about non-extensional flat classes, i.e. classes that are not elements of classes. So, stipulating a nearly well order over all those…
This dissertation aims to provide a comprehensive account of set theory with urelements. In Chapter 1, I present mathematical and philosophical motivations for studying urelement set theory and lay out the necessary technical preliminaries.…
Factorization, in the sense defined for inclusive hard scattering, is discussed for diffractive hard scattering. A factorization theorem similar to its inclusive counterpart is presented for diffractive DIS. For hadron-hadron diffractive…
This paper is a contribution to the study of extensions of arbitrary models of ZF (Zermelo-Fraenkel set theory), with no regard to countability or well-foundedness of the models involved. We present some new constructions of certain types…
A new class of critical points, termed as perpetual points, where acceleration becomes zero but the velocity remains non-zero, are observed in dynamical systems. The velocity at these points is either maximum or minimum or of inflection…
We give arguments for and prove the consistency of some internal forcing axioms.
We explore the enumeration of some natural classes of graded posets, including all graded posets, (2+2)- and (3+1)-avoiding graded posets, (2+2)-avoiding graded posets, and (3+1)-avoiding graded posets. We obtain enumerative and structural…
Vladimir Kanovei \cite{zbMATH01335192} developed the technique of geometric iteration and used it to prove that the perfect set forcing can be iterated with countable supports along any partial order, while preserving $\aleph_1$. In…
In this paper, we prove some new thickness theorems with partial derivatives. We give some applications. First, we give a simple criterion that can judge whether two scaled Cantor sets have non-empty intersection. Second, we prove under…
David Aspero asks on the possibility of having Forcing axiom FA_{aleph_2}(K), where K is the class of forcing notions preserving stationarity of subsets of aleph_1 and of aleph_2. We answer negatively, in fact we show the negative result…
Impulsive dynamical systems is a well-established area of dynamical systems theory, and it is used in this work to analyze several basic properties of reset control systems: existence and uniqueness of solutions, and continuous dependence…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
We present a construction of a certain infinite complete partial order (CPO) that differs from the standard construction used in Scott's denotational semantics. In addition, we construct several other infinite CPO's. For some of those, we…
Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…
In previous papers on this project a general static logical framework for formalizing and mechanizing set theories of different strength was suggested, and the power of some predicatively acceptable theories in that framework was explored.…
We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time more general and simpler. We introduce the concept of a…
In this paper we discuss and prove some new strong convergence theorems for partial sums and Fej\'er means with respect to the Vilenkin system.
On the retention problem, we study the case of a functional constraint on the set of disturbances. A construction of resolving quasistrategy based on the method of programmed iterations is proposed.
Based on the work of Shelah, Kellner, and T\u{a}nasie (Fund. Math., 166(1-2):109-136, 2000 and Comment. Math. Univ. Carolin., 60(1):61-95, 2019), and the recent developments in the third author's master's thesis, we develop a general theory…