English
Related papers

Related papers: Solution of a Problem of Barendregt on Sensible la…

200 papers

In the lambda calculus a term is solvable iff it is operationally relevant. Solvable terms are a superset of the terms that convert to a final result called normal form. Unsolvable terms are operationally irrelevant and can be equated…

Logic in Computer Science · Computer Science 2019-03-14 Á. García-Pérez , P. Nogueira

The Mandelbrot set is an extremely well-known mathematical object that can be described in a quite simple way but has very interesting and non-trivial properties. This paper surveys some results that are known concerning the…

Computational Complexity · Computer Science 2007-05-23 Petrus H. Potgieter

Generalised Probabilistic Theories (GPTs) provide a unifying framework encompassing classical theories, quantum theories, as well as hypothetical alternatives. We investigate the problem of extending a system with a finite set of…

Quantum Physics · Physics 2026-03-17 Serge Massar

Let H be a reductive subgroup of a reductive group G over an algebraically closed field k. We consider the action of H on G^n, the n-fold Cartesian product of G with itself, by simultaneous conjugation. We give a purely algebraic…

Group Theory · Mathematics 2010-06-30 M. Bate , B. Martin , G. Roehrle , R. Tange

While non-contextual hidden-variable theories are proved to be impossible, contextual ones are possible. In a contextual hidden-variable theory, an observable is called a beable if the hidden-variable assigns its value in a given…

Quantum Physics · Physics 2023-11-17 Masanao Ozawa

Let $S$ be a closed Shimura variety uniformized by the complex $n$-ball. The Hodge conjecture predicts that every Hodge class in $H^{2k} (S, \Q)$, $k=0, \ldots, n$, is algebraic. We show that this holds for all degree $k$ away from the…

Algebraic Geometry · Mathematics 2014-06-04 Nicolas Bergeron , John Millson , Colette Moeglin

The main observational equivalences of the untyped lambda-calculus have been characterized in terms of extensional equalities between B\"ohm trees. It is well known that the lambda-theory H*, arising by taking as observables the head normal…

Logic in Computer Science · Computer Science 2023-06-22 Benedetto Intrigila , Giulio Manzonetto , Andrew Polonsky

The Sinc convolution is an approximate formula for indefinite convolutions proposed by Stenger. The formula was derived based on the Sinc indefinite integration formula combined with the single-exponential transformation. Although its…

Numerical Analysis · Mathematics 2026-01-21 Tomoaki Okayama

We introduce the $\Sigma_1$-definable universal finite sequence and prove that it exhibits the universal extension property amongst the countable models of set theory under end-extension. That is, (i) the sequence is $\Sigma_1$-definable…

Logic · Mathematics 2020-11-11 Joel David Hamkins , Kameryn J. Williams

In this paper we show that every set $A \subset \mathbb{N}$ with positive density contains $B+C$ for some pair $B,C$ of infinite subsets of $\mathbb{N}$, settling a conjecture of Erd\H{o}s. The proof features two different decompositions of…

Combinatorics · Mathematics 2019-06-14 Joel Moreira , Florian Karl Richter , Donald Robertson

This paper introduces a model theory for resolution on Higher Order Hereditarily Harrop formulae (HOHH), the logic underlying the Lambda-Prolog programming language, and proves soundness and completeness of resolution. The semantics and the…

Programming Languages · Computer Science 2024-05-28 Gianluca Amato , Mary DeMarco , James Lipton

If X and Y are orthogonal hyperdefinable sets such that X is simple, then any group G interpretable in (X,Y) has a normal hyperdefinable X-internal subgroup N such that G/N is Y-internal; N is unique up to commensurability. In order to make…

Logic · Mathematics 2016-07-07 Frank Olaf Wagner

We address a special case of a conjecture of M. Talagrand relating two notions of "threshold" for an increasing family $\mathcal F$ of subsets of a finite set $V$. The full conjecture implies equivalence of the "Fractional…

Combinatorics · Mathematics 2021-05-25 Keith Frankston , Jeff Kahn , Jinyoung Park

We provide a proof of the union-closed sets conjecture, by means of a suitable refinement of the breakthrough entropy-approach introduced by Gilmer. The novelty here is to consider a convex combination of $A$ and $A\cup B$, where $A,B$ are…

Combinatorics · Mathematics 2023-02-09 Raffaele Scandone

The following refinement of the Higman embedding theorem is proved: A finitely generated group $R$ is recursively presented if and only if there exists a quasi-isometric malnormal embedding of $R$ into a finitely presented group $H$ such…

Group Theory · Mathematics 2026-03-05 Francis Wagner

We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…

Logic · Mathematics 2015-01-15 Boris Zilber

We study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…

Logic · Mathematics 2019-03-05 Jennifer Chubb , Russell Miller , Reed Solomon

We prove that, for every theory $T$ which is given by an ${\mathcal L}_{\omega_1,\omega}$ sentence, $T$ has less than $2^{\aleph_0}$ many countable models if and only if we have that, for every $X\in 2^\omega$ on a cone of Turing degrees,…

Logic · Mathematics 2013-06-07 Antonio Montalban

We collect here various conjectures on congruences made by the author in a series of papers, some of which involve binary quadratic forms and other advanced theories. Part A consists of 100 unsolved conjectures of the author while…

Number Theory · Mathematics 2015-03-13 Zhi-Wei Sun

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake