Related papers: Pseudo-countable models
The purpose of this paper is to investigate forcing as a tool to construct universal models. In particular, we look at theories of initial segments of the universe and show that any model of a sufficiently rich fragment of those theories…
Descriptive set theory is mainly concerned with studying subsets of the space of all countable binary sequences. In this paper we study the generalization where countable is replaced by uncountable. We explore properties of generalized…
Inference in expressive probabilistic models is generally intractable, which makes them difficult to learn and limits their applicability. Sum-product networks are a class of deep models where, surprisingly, inference remains tractable even…
We extend the definition of quasi-finite complexes by considering not necessarily countable complexes. We provide a characterization of quasi-finite complexes in terms of L-invertible maps and dimensional properties of compactifications.…
It is a striking fact from reverse mathematics that almost all theorems of countable and countably representable mathematics are equivalent to just five subsystems of second order arithmetic. The standard view is that the significance of…
In this paper we study admissible extensions of several theories T of reverse mathematics. The idea is that in such an extension the structure M = (N,S,\in) of the natural numbers N and collection of sets of natural numbers S has to obey…
Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…
We work in set-theory without choice $\ZF$. Given a closed subset $F$ of $[0,1]^I$ which is a bounded subset of $\ell^1(I)$ ({\em resp.} such that $F \subseteq \ell^0(I)$), we show that the countable axiom of choice for finite subsets of…
Solving the exact renormalisation group equation a la Wilson-Polchinski perturbatively, we derive a power-counting theorem for general matrix models with arbitrarily non-local propagators. The power-counting degree is determined by two…
A pseudogroup is a complete infinitely distributive inverse monoid. Such inverse monoids bear the same relationship to classical pseudogroups of transformations as frames do to topological spaces. The goal of this paper is to develop the…
In this short note, we introduce a generalization of the canonical base property, called transfer of internality on quotients. A structural study of groups definable in theories with this property yields as a consequence infinitely many new…
We generalize the dual notions of "expansion" and "collapse" so they can be applied to arbitrary metric spaces. We also expand the theory to allow for infinitely many such moves. Those tools are then employed to prove a variety of…
We introduce infinite time computable model theory, the computable model theory arising with infinite time Turing machines, which provide infinitary notions of computability for structures built on the reals R. Much of the finite time…
According to mathematical constructivism, a mathematical object can exist only if there is a way to compute (or "construct") it; so, what is non-computable is non-constructive. In the example of the quantum model, whose Fock states are…
We show that a hypersimple unidimensional theory that has a club of reducts, in the partial order of all countable reducts, that are coordinatized in finite rank, is supersimple.
The goal of this paper is twofold. In addition to the results stated in the next paragraph, we present some classical results on absoluteness relevant to functional analysis that are well known to logicians but not nearly as well advertised…
We use a generalization of a construction by Ziegler to show that for any field $F$ and any countable collection of countable subsets $A_i \subseteq F, i \in \calI \subset \Z_{>0}$ there exist infinitely many fields $K$ of arbitrary…
Continuous first-order logic is used to apply model-theoretic analysis to analytic structures (e.g. Hilbert spaces, Banach spaces, probability spaces, etc.). Classical computable model theory is used to examine the algorithmic structure of…
We propose an extension of Aczel's constructive set theory CZF by an axiom for inductive types and a choice principle, and show that this extension has the following properties: it is interpretable in Martin-Lof's type theory (hence…
We establish some similarities/analogies between uncountable cardinals or powersets and the class $V$ of all sets. They concern mainly the Boolean algebras ${\cal P}(\kappa)$, for a regular cardinal $\kappa$, and ${\cal C}(V)$ (the class of…