Related papers: On $\lam$-existence over a predicate
Given the family $P$ of all nonempty subsets of a set $U$ of alternatives, a choice over $U$ is a function $c \colon \Omega \to P$ such that $\Omega \subseteq P$ and $c(B) \subseteq B$ for all menus $B \in \Omega$. A choice is total if…
We present a new proof of descent for stably dominated types in any theory, dropping the hypothesis of the existence of global invariant extensions. Additionally, we give a much simpler proof of descent for stably dominated types in…
We establish several results regarding dividing and forking in NTP2 theories. We show that dividing is the same as array-dividing. Combining it with existence of strictly invariant sequences we deduce that forking satisfies the chain…
We characterize when the elementary diagram of a mutually algebraic structure has a model complete theory, and give an explicit description of a set of existential formulas to which every formula is equivalent. This characterization yields…
Let $k$ be a field, $K/k$ finitely generated and $L/K$ a finite, separable extension. We show that the existence of a $k$-valuation on $L$ which ramifies in $L/K$ implies the existence of a normal model $X$ of $K$ and a prime divisor $D$ on…
We prove a generalised super-adiabatic theorem for extended fermionic systems assuming a spectral gap only in the bulk. More precisely, we assume that the infinite system has a unique ground state and that the corresponding GNS-Hamiltonian…
The main aim of this work is to show, in the absence of the Axiom of Choice, fundamental results on $\mathbf{E}$-compact extensions of $\mathbf{E}$-completely regular spaces, in particular, on Hewitt realcompactifications and Banaschewski…
We introduce the notions of a mutually algebraic structures and theories and prove many equivalents. A theory $T$ is mutually algebraic if and only if it is weakly minimal and trivial if and only if no model $M$ of $T$ has an expansion…
We prove a general version of the "Stability Theorem": if $K$ is a valued field such that the ramification theoretical defect is trivial for all of its finite extensions, and if $F|K$ is a finitely generated (transcendental) extension of…
We define am axiomatic timeless framework for asynchronous distributed systems, together with well-formedness and consistency axioms, which unifies and generalizes the expressive power of current approaches. 1) It combines classic…
The randomization of a complete first order theory T is the complete continuous theory T^R with two sorts, a sort for random elements of models of T, and a sort for events in an underlying probability space. We give necessary and sufficient…
Given a base point free linear system on an algebraic variety, many classes of singularities are stable under taking suitable members after enlarging the base field. We establish analogous results when the base ring is an excellent ring.
We prove the adiabatic theorem for quantum evolution without the traditional gap condition. All that this adiabatic theorem needs is a (piecewise) twice differentiable finite dimensional spectral projection. The result implies that the…
We introduce the notion of saturated sets of primes of an algebraic number field and prove an analogue of Riemann's existence theorem for the decomposition groups of infinite stably saturated sets of primes.
In the present paper, the existence and multiplicity problems of extensions are addressed. The focus is on extension of the stable type. The main result of the paper is an elegant characterization of the existence and multiplicity of…
We study a well-known technique of using absoluteness for giving choice-free proofs to some statements which are known to be provable with the axiom of choice. The idea is to reduce the problem to an inner model where the axiom of choice…
By Solovay's celebrated completeness result on formal provability we know that the provability logic $\mathrm GL$ describes exactly all provable structural properties for any sound and strong enough arithmetical theory with a decidable…
In this paper we address a problem posed by Shelah in 1999 to find a suitable notion for superstability for abstract elementary classes in which limit models of cardinality $\mu$ are saturated. Theorem 1. Suppose that $\mathcal{K}$ is a…
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSPACE-complete, and it is EXPTIME-complete in the presence of unrestricted axioms. Several fragments of ALC, notably logics in the FL, EL, and…
The purpose of this paper is to clarify the relationship between various conditions implying essential undecidability: our main result is that there exists a theory $T$ in which all partially recursive functions are representable, yet $T$…