Related papers: Some notes on plump ordinals

On the torus group, on the group of p-adic integers and on the p-adic solenoid, we give a construction of an arbitrary weakly infinitely divisible probability measure using a random element with values in a product of (possibly infinitely…

A classification of weakly compact multiplication operators on L(L_p), $1<p<\infty$, is given. This answers a question raised by Saksman and Tylli in 1992. The classification involves the concept of $\ell_p$-strictly singular operators, and…

In this paper, we introduce and study the class of {\it enriched strictly pseudocontractive mappings} in Hilbert spaces and extend the corresponding convergence theorem (Theorem 12) in [Browder, F. E., Petryshyn, W. V., {\it Construction of…

We construct a univalent universe in the sense of Voevodsky in some suitable model categories for homotopy types (obtained from Grothendieck's theory of test categories). In practice, this means for instance that, appart from the homotopy…

We can look at a first-order (or propositional) intuitionistic Kripke model as an ordered set of classical models. In this paper, we show that for a finite-depth Kripke model in an arbitrary first-order language or propositional language,…

We present variants of Goodstein's theorem that are equivalent to arithmetical comprehension and to arithmetical transfinite recursion, respectively, over a weak base theory. These variants differ from the usual Goodstein theorem in that…

Inspired by Leivant's work on absolute predicativism, Bellantoni and Cook in 1992 introduced a structurally restricted form of recursion called predicative recursion. Using this recursion scheme on the inductive structures of natural…

The aim of this thesis is to give a concise introduction to homotopy type theory, to Aczel's constructive set theory and to simplicial sets and their homotopy theory in particular referring to their standard model structure, showing some of…

Suppose that $P$ is a forcing notion, $L$ is a language (in $V$), $\dot{\tau}$ a $P$-name such that $P\Vdash$ "$\dot{\tau}$ is a countable $L$-structure". In the product $P\times P$, there are names $\dot{\tau_{1}},\dot{\tau_{2}}$ such that…

Denote by $\continuum=2^{\aleph_0}$ the cardinal of continuum. We construct an intriguing family $(P_\alpha: \alpha\in\continuum)$ of prime $z$-ideals in $\C_0(\reals)$ with the following properties: If $f\in P_{i_0}$ for some…

Higher order set theory has been a topic of interest for some time, with recent efforts focused on the strength of second order set theories [KW16]. In this paper we strive to present one 'theory of collections' that allows for a formal…

We study abstract versions of G\"odel's second incompleteness theorem and formulate generalizations of L\"ob's derivability conditions that work for logics weaker than the classical one. We isolate the role of contraction rule in G\"odel's…

This article reformulates the theory of computable physical models, previously introduced by the author, as a branch of applied model theory in first-order logic. It provides a semantic approach to the philosophy of science that…

Let R be a discrete valuation ring of unequal characteristic with fraction field K which contains a primitive p^2-th root of unity. Let X be a faithfully flat R-scheme and G be a finite abstract group. Let us consider a G-torsor Y_K\to X_K…

As far as algebraic properties are concerned, the usual addition on the class of ordinal numbers is not really well behaved; for example, it is not commutative, nor left cancellative etc. In a few cases, the natural Hessemberg sum is a…

We develop the theory of cofinal types of ultrafilters over measurable cardinals and establish its connections to Galvin's property. We generalize fundamental results from the countable to the uncountable, but often in surprisingly…

We continue investigations of reasonable ultrafilters on uncountable cardinals defined in math.LO/0407498. We introduce stronger properties of ultrafilters and we show that those properties may be handled in lambda-support iterations of…

For an ordinal $\lambda>0$, we use the Erd\H{o}s--Rado partition theorem to prove the failure of strong completeness of $\mathsf{GL}$ for modal languages of cardinality $(2^{|\lambda|+\aleph_0})^{+}$ with respect to models on ordinals…

The method of reduction of a Fredholm integral equation to the linear system is generalized to construction of a complex potential --- an analytic function in an infinite multiply connected domain with a simple pole at infinity which maps…

A prefix grammar is a context-free grammar whose nonterminals generate prefix-free languages. A prefix grammar $G$ is an ordinal grammar if the language $L(G)$ is well-ordered with respect to the lexicographic ordering. It is known that…