Related papers: The Morris model

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

A method is given for quantitatively rating the social acceptance of different options which are the matter of a complete preferential vote. Completeness means that every voter expresses a comparison (a preference or a tie) about each pair…

We introduce the family of axioms, denoted $\operatorname{Slice}_\kappa$, that claim the existence of strictly increasing decompositions of the form $$2^{\delta}=\bigcup_{\alpha<\kappa} 2^{\delta}\cap M_\alpha,$$ where $\delta<\kappa$, and…

We prove (ZF+DC) e.g. : if mu =|H(mu)| then mu^+ is regular non measurable. This is in contrast with the results for mu = aleph_{omega} on measurability see Apter Magidor [ApMg]

A set $A\subseteq\mathbb N$ is called $complete$ if every sufficiently large integer can be written as the sum of distinct elements of $A$. In this paper we present a new method for proving the completeness of a set, improving results of…

Let $\Gamma$ be a compact Polish group of finite topological dimension. For a countably infinite subset $S\subseteq \Gamma$, a domatic $\aleph_0$-partition (for its Schreier graph on $\Gamma$) is a partial function…

Let $L$ be a countable language. We characterize, in terms of definable closure, those countable theories $\Sigma$ of $\mathcal{L}_{\omega_1, \omega}(L)$ for which there exists an $S_\infty$-invariant probability measure on the collection…

The famous partition theorem of Euler states that partitions of $n$ into distinct parts are equinumerous with partitions of $n$ into odd parts. Another famous partition theorem due to MacMahon states that the number of partitions of $n$…

Distributed signal processing algorithms have become a hot topic during the past years. One class of algorithms that have received special attention are particles filters (PFs). However, most distributed PFs involve various heuristic or…

In this paper I introduce a new and intuitive first-order foundational theory (where the concept of set is not primitive) and use it to show that the power set of an infinite set does not exist. In particular, proofs of uncountability of a…

We prove that there exists essentially one {\it minimal} differential algebra of distributions $\A$, satisfying all the properties stated in the Schwartz impossibility result [L. Schwartz, Sur l'impossibilit\'e de la multiplication des…

It is well known that in Zermelo-Fraenkel (ZF) set theory any finite set is decidable. In this paper we discuss an extension of ZF where this result is no longer valid. Such an extension is quasi-set theory and it has its origin on problems…

We provide a direct proof of Agafonov's theorem which states that finite state selection preserves normality. We also extends this result to the more general setting of shifts of finite type by defining selections which are compatible the…

A celebrated theorem of Marshall Hall Jr. implies that finitely generated free groups are subgroup separable and that all of their finitely generated subgroups are retracts of finite-index subgroups. We use topological techniques inspired…

A space $X$ has countable $(F)$-property if it has countable point network satisfying the Collins-Roscoe structuring mechanism. Some sufficient conditions for $C_p(X)$ having countable $(F)$-property are obtained. As a corollary, we prove…

We give a simple proof of the splitting lemma in singularity theory, also known as generalized Morse lemma, for formal power series over arbitrary fields. Our proof for the uniqueness of the residual part in any characteristic is new and…

A proof is reconstructed for a useful theorem on the zeros of derivatives of analytic functions due to H. M. Macdonald, which appears to be now little known. The Theorem states that, if a function $f(z)$ is analytic inside a bounded region…

The notion of multiplier Hopf monoid in any braided monoidal category is introduced as a multiplier bimonoid whose constituent fusion morphisms are isomorphisms. In the category of vector spaces over the complex numbers, Van Daele's…

Let \phi be a first order formula and M be a countable model. \phi^M denotes the set of all assignments that satisfy \phi in M. Let M, N be countable models. A formula \phi distinguishes these models if |\phi^M|\neq |\phi^N|. We show that…

In this paper we prove three theorems about the theory of Borel sets in models of ZF without any form of the axiom of choice. We prove that if B is a G-delta-sigma set, then either B is countable or B contains a perfect subset. Second, we…