Related papers: Scott analysis, linear orders and almost periodic …
Let $K$ be a finitely generated field of characteristic zero. We study, for fixed $m \geq 2$, the rational functions $\phi$ defined over $K$ that have a $K$-orbit containing infinitely many distinct $m$th powers. For $m \geq 5$ we show the…
We prove some results on the Wadge order on the space of sets of natural numbers endowed with Scott topology, and more generally, on omega-continuous domains. Using alternating decreasing chains we characterize the property of Wadge…
We present several equivalent conditions of the continuity of the supremum function from the square of the Scott space of $C(X)$ to itself under mild assumptions, where $C(X)$ denotes the lattice of closed subsets of a $\mathbf{T_0}$…
We investigate the complexity of the partial order relation of Young's lattice. The definable relations are characterized by establishing the maximal definability property modulo the single automorphism given by conjugation; consequently,…
We consider a specific class of tree structures that can represent basic structures in linguistics and computer science such as XML documents, parse trees, and treebanks, namely, finite node-labeled sibling-ordered trees. We present…
We try to build, provably in ZFC, for a first order T a model in which any isomorphism between two Boolean algebras is definable. The problem, compared to [Sh:384], is with pseudo-finite Boolean algebras. A side benefit is that we do not…
We address the question regarding the structure of the Mitchell order on normal measures. We show that every well founded order can be realized as the Mitchell order on a measurable cardinal $\kappa$ from some large cardinal assumption.
It is, by now, classical that lattices in higher rank semisimple groups have various rigidity properties. In this work, we add another such rigidity property to the list: uniform stability with respect to the family of unitary operators on…
We present a process semantics for the purely additive fragment of linear logic in which formulas denote protocols and (equivalence classes of) proofs denote multi-channel concurrent processes. The polycategorical model induced by this…
We introduce a new invariant of Borel reducibility, namely the notion of thickness; this associates to every sentence $\Phi$ of $\mathcal{L}_{\omega_1 \omega}$ and to every cardinal $\lambda$, the thickness $\tau(\Phi, \lambda)$ of $\Phi$…
We consider the non-deterministic extension of the call-by-value lambda calculus, which corresponds to the additive fragment of the linear-algebraic lambda-calculus. We define a fine-grained type system, capturing the right linearity…
Let $\Gamma<\mathrm{PSL}_2(\mathbb{C})\simeq \mathrm{Isom}^+(\mathbb{H}^3)$ be a finitely generated non-Fuchsian Kleinian group whose ordinary set $\Omega=\mathbb{S}^2-\Lambda$ has at least two components. Let $\rho : \Gamma \to…
Despite the conceptual simplicity of sequential consistency (SC), the semantics of SC atomic operations and fences in the C11 and OpenCL memory models is subtle, leading to convoluted prose descriptions that translate to complex axiomatic…
With a view towards models of quantum computation and/or the interpretation of linear logic, we define a functional language where all functions are linear operators by construction. A small step operational semantic (and hence an…
We introduce a variant of linear logic with second order quantifiers and type fixpoints, both restricted to purely linear formulas. The Church encodings of binary words are typed by a standard non-linear type `Church,' while the Scott…
Years ago Zeev Rudnick defined the ${\lambda}$-Poisson generic sequences as the infinite sequences of symbols in a finite alphabet where the number of occurrences of long words in the initial segments follow the Poisson distribution with…
The formal system lambda-delta is a typed lambda calculus that pursues the unification of terms, types, environments and contexts as the main goal. lambda-delta takes some features from the Automath-related lambda calculi and some from the…
We show that lambda calculus is a computation model which can step by step simulate any sequential deterministic algorithm for any computable function over integers or words or any datatype. More formally, given an algorithm above a family…
Dependently typed lambda calculi such as the Logical Framework (LF) are capable of representing relationships between terms through types. By exploiting the "formulas-as-types" notion, such calculi can also encode the correspondence between…
We present a method to iterate finitely splitting lim-sup tree forcings along non-wellfounded linear orders. We apply this method to construct a forcing (without using an inaccessible or amalgamation) that makes all definable sets of reals…