Related papers: Large continuum, oracles
Assuming the Continuum Hypothesis, there is a compact first countable connected space of weight aleph_1 with no totally disconnected perfect subsets. Each such space, however, may be destroyed by some proper forcing order which does not add…
We define a variant of realizability where realizers are pairs of a term and a substitution. This variant allows us to prove the normalization of a simply-typed call-by-need $$\lambda$-$calculus with control due to Ariola et al. Indeed, in…
We introduce the calculus of Classical Transitions (CT), which extends the research line on the relationship between linear logic and processes to labelled transitions. The key twist from previous work is registering parallelism in typing…
Motivated by recent results of Kapron and Steinberg (LICS 2018) we introduce new forms of iteration on length in the setting of applied lambda-calculi for higher-type poly-time computability. In particular, in a type-two setting, we…
We prove that the Sacks forcing collapses the continuum onto the dominating number d, answering the question of Carlson and Laver. Next we prove that if a proper forcing of the size at most continuum collapses omega_2 then it forces…
This paper constructs a cirquent calculus system and proves its soundness and completeness with respect to the semantics of computability logic (see http://www.cis.upenn.edu/~giorgi/cl.html). The logical vocabulary of the system consists of…
We present a polymorphic linear lambda-calculus as a proof language for second-order intuitionistic linear logic. The calculus includes addition and scalar multiplication, enabling the proof of a linearity result at the syntactic level.
Generalized numberings are an extension of Ershov's notion of numbering, based on partial combinatory algebra (pca) instead of the natural numbers. We study various algebraic properties of generalized numberings, relating properties of the…
We prove that the strong polarized relation for the continuum holds for $\aleph_0$ and for every supercompact cardinal. We use iteration of Mathias forcing.
Starting from a supercompact cardinal we build a model in which $2^{\aleph_{\omega_1}}=2^{\aleph_{\omega_1+1}}=\aleph_{\omega_1+3}$ but there is a jointly universal family of size $\aleph_{\omega_1+2}$ of graphs on $\aleph_{\omega_1+1}$.…
We introduce a linear infinitary $\lambda$-calculus, called $\ell\Lambda_{\infty}$, in which two exponential modalities are available, the first one being the usual, finitary one, the other being the only construct interpreted…
Ordering theorems, characterizing when partial orders of a group extend to total orders, are used to generate hypersequent calculi for varieties of lattice-ordered groups (l-groups). These calculi are then used to provide new proofs of…
We give a partial answer to a conjecture of A. Balog, concerning the size of AA+A, where A is a finite subset of real numbers. Also, we prove several new results on the cardinality of A:A+A, AA+AA and A:A + A:A.
Algebraic lambda-calculi have been studied in various ways, but their semantics remain mostly untouched. In this paper we propose a semantic analysis of a general simply-typed lambda-calculus endowed with a structure of vector space. We…
We examine the Zermelo Fraenkel set theory with Choice (ZFC) enhanced by one of the (structural) reflection principles down to a small cardinal and/or Recurrence Axioms defined below. The strongest forms of reflection principles spotlight…
An algebraic integer is said large if all its real or complex embeddings have absolute value larger than $1$. An integral ideal is said \emph{large} if it admits a large generator. We investigate the notion of largeness, relating it to some…
The combination of continuum Many-Body Quantum physics and Monte Carlo methods provide a powerful and well established approach to first principles calculations for large systems. Replacing the exact solution of the problem with a…
One aim of this work is to get a universe in which weak versions of Martin axioms holds for some forcing notions of cardinality aleph_0, aleph_1 and aleph_2 while on aleph_2 club, the ``small'' brother of diamond, holds. As a consequence we…
Many constructions in computability theory rely on "time tricks". In the higher setting, relativising to some oracles shows the necessity of these. We construct an oracle~$A$ and a set~$X$, higher Turing reducible to~$X$, but for which…
Generic absoluteness is the phenomenon that certain truths in the set-theoretic universe remain stable under forcing expansions. A classical result by Kripke asserts that every complete Boolean algebra completely embeds into a countably…