Related papers: Countable Support Iteration Revisited
As inductive inference and machine learning methods in computer science see continued success, researchers are aiming to describe ever more complex probabilistic models and inference algorithms. It is natural to ask whether there is a…
In this paper, we prove that every iterative differential embedding problem over an algebraic function field in positive characteristic with an algebraically closed field of constants has a proper solution.
Various concepts of grammatical compositionality arise in many theories of both natural and artificial languages, and often play a key role in accounts of the syntax-semantics interface. We propose that many instances of compositionality…
We introduce a notion of realizability with ordinal Turing machines based on recognizability rather than computability, i.e., the ability to uniquely identify an object. We show that the arising concept of $r$-realizabilty has the property…
Given a presilting object in a triangulated category, we find necessary and sufficient conditions for the existence of a complement. This is done both for classic (pre)silting objects and for large (pre)silting objects. The key technique is…
Constructive type theory combines logic and programming in one language. This is useful both for reasoning about programs written in type theory, as well as for reasoning about other programming languages inside type theory. It is…
We describe and classify countable Boolean rings (which may or may not have a multiplicative identity) with finitely many distinguished ideals whose elementary theory is countably categorical. This extends the description by Macintyre and…
We formalize the theory of forcing in the set theory framework of Isabelle/ZF. Under the assumption of the existence of a countable transitive model of ZFC, we construct a proper generic extension and show that the latter also satisfies…
A finite collection $P$ of finite sets tiles the integers iff the integers can be expressed as a disjoint union of translates of members of $P$. We associate with such a tiling a doubly infinite sequence with entries from $P$. The set of…
Like the notion of computation via (strong) monads serves to classify various flavours of impurity, including exceptions, non-determinism, probability, local and global store, the notion of guardedness classifies well-behavedness of cycles…
We characterize completely the Gneiting class of space-time covariance functions and give more relaxed conditions on the involved functions. We then show necessary conditions for the construction of compactly supported functions of the…
We show pro-definability of spaces of definable types in various classical complete first order theories, including complete o-minimal theories, Presburger arithmetic, $p$-adically closed fields, real closed and algebraically closed valued…
We consider here Easton support iterations of Prikry type forcing notions. New ways of constructing normal ultrafilters in extensions are presented. It turns out that, in contrast with other supports, seemingly unrelated measures or…
Let V be a set of number-theoretical functions. We define a notion of V -realizability for predicate formulas in such a way that the indices of functions in V are used for interpreting the implication and the universal quantifier. In this…
This work presents a new classifier that is specifically designed to be fully interpretable. This technique determines the probability of a class outcome, based directly on probability assignments measured from the training data. The…
We study an extension of the Distributive Full Non-associative Lambek Calculus with iterative division operators. The iterative operators can be seen as representing iterative composition of linguistic resources or of actions. A complete…
We extend Choiceless Polynomial Time (CPT), the currently only remaining promising candidate in the quest for a logic capturing PTime, so that this extended logic has the following property: for every class of structures for which…
Natural language processing has greatly benefited from the introduction of the attention mechanism. However, standard attention models are of limited interpretability for tasks that involve a series of inference steps. We describe an…
We present counting methods for some special classes of multivariate polynomials over a finite field, namely the reducible ones, the s-powerful ones (divisible by the s-th power of a nonconstant polynomial), and the relatively irreducible…
We prove that multiple-recurrence and polynomial-recurrence of invertible infinite measure preserving transformations are both properties which pass to extensions.