Related papers: Non-elementary proper forcing
We construct, using mild combinatorial hypotheses, a real Menger set that is not Scheepers, and two real sets that are Menger in all finite powers, with a non-Menger product. By a forcing-theoretic argument, we show that the same holds in…
We consider the class of crossed products of noetherian domains with universal enveloping algebras of Lie algebras. For algebras from this class we give a sufficient condition for the existence of projective non-free modules. This class…
Structural causal models are the basic modelling unit in Pearl's causal theory; in principle they allow us to solve counterfactuals, which are at the top rung of the ladder of causation. But they often contain latent variables that limit…
This paper investigates under which conditions instantiation-based proof procedures can be combined in a nested way, in order to mechanically construct new instantiation procedures for richer theories. Interesting applications in the field…
Non-forking is one of the most important notions in modern model theory capturing the idea of a generic extension of a type (which is a far-reaching generalization of the concept of a generic point of a variety). To a countable first-order…
A quantitative model of concurrent interaction is introduced. The basic objects are linear combinations of partial order relations, acted upon by a group of permutations that represents potential non-determinism in synchronisation. This…
In my PhD thesis a version of Shelah's Presentation Theorem in the setting of Metric Abstract Elementary Classes was proved, where we claimed that the new function symbols are not necessarily uniformly continuous. In this paper we provide a…
To improve word representation learning, we propose a probabilistic prior which can be seamlessly integrated with word embedding models. Different from previous methods, word embedding is taken as a probabilistic generative model, and it…
We firstly show that due to their resplendency ordered henselian valued fields admit relative field quantifier elimination in the Denef--Pas language expanded by linear orders in the field and residue field sort. Secondly, we deduce from a…
Nen verbal morphology is remarkably complex; a transitive verb can take up to 1,740 unique forms. The combined effect of having a large combinatoric space and a low-resource setting amplifies the need for NLP tools. Nen morphology utilises…
We introduce a hierarchy of fast-growing complexity classes and show its suitability for completeness statements of many non elementary problems. This hierarchy allows the classification of many decision problems with a non-elementary…
Negation is poorly captured by current language models, although the extent of this problem is not widely understood. We introduce a natural language inference (NLI) test suite to enable probing the capabilities of NLP methods, with the aim…
In this work, we explore proof theoretical connections between sequent, nested and labelled calculi. In particular, we show a general algorithm for transforming a class of nested systems into sequent calculus systems, passing through linear…
This is an expository paper about several sophisticated forcing techniques closely related to standard finite support iterations of ccc partial orders. We focus on the four topics of ultrapowers of forcing notions, iterations along…
With the recent success of pre-trained models in NLP, a significant focus was put on interpreting their representations. One of the most prominent approaches is structural probing (Hewitt and Manning, 2019), where a linear projection of…
Quasiminimal structures play an important role in non-elementary categoricity. In this paper we explore possibilities of constructing quasiminimal models of a given first-order theory. We present several constructions with increasing…
Informal lecture notes with examples on sheaf theory and the derived category of sheaves; sheaves and Morse theory; perverse sheaves, and some applications to representation theory. Added Oct 2021: cellular perverse sheaves. Proofs are…
The class of abelian $p$-groups are an example of some very interesting phenomena in computable structure theory. We will give an elementary first-order theory $T_p$ whose models are each bi-interpretable with the disjoint union of an…
We provide an algebraic framework to describe renormalization in regularity structures based on multi-indices for a large class of semi-linear stochastic PDEs. This framework is ``top-down", in the sense that we postulate the form of the…
In this paper, we introduce a translation that combines the $j$-translation with Kripke forcing in the internal logic of an elementary topos. First, we show that our translation is sound for intuitionistic first-order logic and Heyting…