Related papers: Exact saturation in pseudo-elementary classes for …
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We deal with several pcf problems; we characterize another version of exponentiation: number of kappa-branches in a tree with lambda nodes, deal with existence of independent sets in stable theories, possible cardinality of ultraproduct,…
We systematically investigate the vacuum stability and nuclear properties in the effective chiral model with higher order terms in $\sigma$. We evaluate the model parameters by considering the saturation properties of nuclear matter as well…
Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange…
For an abstract elementary class $\mathbf{K}$ and a cardinal $\lambda \geq LS(\mathbf{K})$, we prove under mild cardinal arithmetic assumptions, categoricity in two succesive cardinals, almost stability for $\lambda^+$-minimal types and…
We survey some recent topics on singularities, with a focus on their connection to the minimal model program. This includes the construction and properties of dual complexes, the proof of the ACC conjecture for log canonical thresholds and…
The tower number $\mathfrak t$ and the ultrafilter number $\mathfrak u$ are cardinal characteristics from set theory. They are based on combinatorial properties of classes of subsets of~$\omega$ and the almost inclusion relation…
We consider a theory of superselection sectors for infinite quantum spin systems, describing charges that can be approximately localized in cone-like regions. The primary examples we have in mind are the anyons (or charges) in topologically…
In this paper, we prove the number of countable models of a countable supersimple theory is either 1 or infinite. This result is an extension of Lachlan's theorem on a superstable theory.
We make two contributions to the study of theory combination in satisfiability modulo theories. The first is a table of examples for the combinations of the most common model-theoretic properties in theory combination, namely stable…
Scalar-tensor theories of gravity are extensions of General Relativity (GR) including an extra, nonminimally coupled scalar degree of freedom. A wide class of these theories, albeit indistinguishable from GR in the weak field regime,…
We study the computational complexity of several problems connected with finding a maximal distance-$k$ matching of minimum cardinality or minimum weight in a given graph. We introduce the class of $k$-equimatchable graphs which is an edge…
It is known that string theory compactifications leading to low energy effective theories with different chiral matter content ({\it e.g.} different numbers of standard model generations) are connected through phase transitions, described…
We survey results on the formalization and independence of mathematical statements related to major open problems in computational complexity theory. Our primary focus is on recent findings concerning the (un)provability of complexity…
It is an open question whether compositional truth with the principle of propositional soundness ,,all arithmetical sentences which are propositional tautologies are true'' is conservative over its arithmetical base theory. In this article,…
We study partition properties for uncountable regular cardinals that arise by restricting partition properties defining large cardinal notions to classes of simply definable colourings. We show that both large cardinal assumptions and…
While concepts and tools from Theoretical Computer Science are regularly applied to, and significantly support, software development for discrete problems, Numerical Engineering largely employs recipes and methods whose correctness and…
Suppose that $G$ is a graph of cardinality $\mu^+$ with chromatic number $\chi(G)\geq \mu^+$. One possible reason that this could happen is if $G$ contains a clique of size $\mu^+$. We prove that this is indeed the case when the edge…
In this paper we prove a strong nonstructure theorem for kappa (T)-saturated models of a stable theory T with dop.
We study the relations between a generalization of pseudocompactness, named $(\kappa, M)$-pseudocompactness, the countably compactness of subspaces of $\beta \omega$ and the pseudocompactness of their hyperspaces. We show, by assuming the…