English
Related papers

Related papers: Deducibility in the full Lambek calculus with weak…

200 papers

In addition to their limpid interface with semantics, categorial grammars enjoy another important property: learnability. This was first noticed by Buskowsky and Penn and further studied by Kanazawa, for Bar-Hillel categorial grammars. What…

Machine Learning · Computer Science 2013-10-03 Roberto Bonato , Christian Retoré

We prove that every finite lattice L can be embedded in a three-generated finite lattice K. We also prove that every algebraic lattice with accessible cardinality is a complete sublattice of an appropriate algebraic lattice K such that K is…

Rings and Algebras · Mathematics 2015-12-15 Gábor Czédli

We investigate the partitioning of partial orders into a minimal number of heapable subsets. We prove a characterization result reminiscent of the proof of Dilworth's theorem, which yields as a byproduct a flow-based algorithm for computing…

Combinatorics · Mathematics 2023-06-22 János Balogh , Cosmin Bonchiş , Diana Diniş , Gabriel Istrate , Ioan Todinca

By adapting the iterative yardstick construction of Stockmeyer, we show that the reachability problem for vector addition systems with a stack does not have elementary complexity. As a corollary, the same lower bound holds for the…

Formal Languages and Automata Theory · Computer Science 2013-10-08 Ranko Lazic

We prove a general categorical theorem that enables us to state that under certain conditions, the range of a functor is large. As an application, we prove various results of which the following is a prototype: If every diagram, indexed by…

General Mathematics · Mathematics 2007-05-23 Friedrich Wehrung

Universal continuous calculi are defined and it is shown that for every finite tuple of pairwise commuting Hermitian elements of a Su*-algebra (an ordered *-algebra that is symmetric, i.e. "strictly" positive elements are invertible, and…

Functional Analysis · Mathematics 2020-12-01 Matthias Schötz

We present a proof-theoretic analysis of the logic NL$\lambda$ (Barker \& Shan 2014, Barker 2019). We notably introduce a novel calculus of proof nets and prove it is sound and complete with respect to the sequent calculus for the logic. We…

Computation and Language · Computer Science 2020-10-26 Richard Moot

We show that if $\lambda_1,\ldots,\lambda_k$ are algebraic numbers, then $$|A+\lambda_1\cdot A+\dots+\lambda_k\cdot A|\geq H(\lambda_1,\ldots,\lambda_k)|A|-o(|A|)$$ for all finite subsets $A$ of $\mathbb{C}$, where…

Combinatorics · Mathematics 2025-08-27 David Conlon , Jeck Lim

A gradual semantics takes a weighted argumentation framework as input and outputs a final acceptability degree for each argument, with different semantics performing the computation in different manners. In this work, we consider the…

Artificial Intelligence · Computer Science 2023-02-09 Nir Oren , Bruno Yun

We prove, via transfinite recursion, the existence, inside any linearly ordered set of appropriate regular cardinality $\lambda$, of a particular kind of well-ordered subsets characterized by the property of $\lambda$-fullness. Let $H$ be a…

Logic · Mathematics 2024-03-26 Gabriele Gullà

We develop a theory of Lagrangian reduction on loop groups for completely integrable systems after having exchanged the role of the space and time variables in the multi-time interpretation of integrable hierarchies. We then insert the…

Exactly Solvable and Integrable Systems · Physics 2016-05-25 Alexis Arnaudon

We prove an extension of Yuan's Lemma to more than two matrices, as long as the set of matrices has rank at most 2. This is used to generalize the main result of [A. Baccari and A. Trad. On the classical necessary second-order optimality…

Optimization and Control · Mathematics 2017-07-20 Gabriel Haeser

We show that the set of codes for Ramsey positive analytic sets is $\mathbf{\Sigma}^1_2$-complete. This is a one projective-step higher analogue of the Hurewicz theorem saying that the set of codes for uncountable analytic sets is…

Logic · Mathematics 2010-04-01 Marcin Sabok

Let B be the Lie algebra with basis {L_{i,j},C|i,j\in Z} and relations [L_{i,j},L_{k,l}]=((j+1)k-i(l+1))L_{i+k,j+l}+i\delta_{i,-k}\delta_{j+l,-2}C, [C,L_{i,j}]=0. It is proved that an irreducible highest weight B-module is quasifinite if…

Representation Theory · Mathematics 2007-05-23 Qifen Jiang , Yuezhu Wu

The downward closure of a language is the set of all (not necessarily contiguous) subwords of its members. It is well-known that the downward closure of every language is regular. Moreover, recent results show that downward closures are…

Formal Languages and Automata Theory · Computer Science 2016-05-11 Georg Zetzsche

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…

Logic · Mathematics 2017-08-03 Almudena Colacito , George Metcalfe

This paper is devoted to rejective sampling. We provide an expansion of joint inclusion probabilities of any order in terms of the inclusion probabilities of order one, extending previous results by H\'ajek (1964) and H\'ajek (1981) and…

Statistics Theory · Mathematics 2012-07-25 Hélène Boistard , Hendrik P. Lopuhaä , Anne Ruiz-Gazen

We show that the vanishing of higher derived limits of the system $\mathbf{A}_\kappa$ implies the additivity of strong homology on the class of locally compact metric spaces of weight at most $\kappa$, thereby establishing a converse to a…

Logic · Mathematics 2025-10-01 Nathaniel Bannister

We prove an infinite family of Hecke-like congruences for the overpartition function modulo powers of 2. Starting from a recent identity of Garvan and Morrow and iterating Atkin's $U_2$ operator, we determine lower bounds on the 2-adic…

Number Theory · Mathematics 2025-10-24 Zhumagali Shomanov , Frank Garvan

The following thesis contains results on the combinatorial representation theory of the finite Hecke algebra $H_n(q)$. In Chapter 2 simple combinatorial descriptions are given which determine when a Specht module corresponding to a…

Combinatorics · Mathematics 2009-06-09 Chris Berg