English
Related papers

Related papers: Doubly partially conservative sentences

200 papers

A forcing extension may create new isomorphisms between two models of a first order theory. Certain model theoretic constraints on the theory and other constraints on the forcing can prevent this pathology. A countable first order theory is…

Logic · Mathematics 2016-09-06 John T. Baldwin , Michael C. Laskowski , Saharon Shelah

Temporary syntactic ambiguities arise when the beginning of a sentence is compatible with multiple syntactic analyses. We inspect to which extent neural language models (LMs) exhibit uncertainty over such analyses when processing…

Computation and Language · Computer Science 2021-09-17 Laura Aina , Tal Linzen

A fundamental theme in automata theory is regular languages of words and trees, and their many equivalent definitions. Salvati has proposed a generalization to regular languages of simply typed $\lambda$-terms, defined using denotational…

Logic in Computer Science · Computer Science 2024-02-09 Vincent Moreau , Lê Thành Dũng Nguyên

The multivariate covering lemma states that given a collection of $k$ codebooks, each of sufficiently large cardinality and independently generated according to one of the marginals of a joint distribution, one can always choose one…

Information Theory · Computer Science 2016-01-22 Parham Noorzad , Michelle Effros , Michael Langberg

There have been several efforts to extend distributional semantics beyond individual words, to measure the similarity of word pairs, phrases, and sentences (briefly, tuples; ordered sets of words, contiguous or noncontiguous). One way to…

Machine Learning · Computer Science 2013-10-21 Peter D. Turney

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

This thesis discusses various aspects of duality in quantum field theory and string theory. In the first part we consider duality in topological quantum field theories, concentrating on the Donaldson and Seiberg-Witten theories as (dual)…

High Energy Physics - Theory · Physics 2007-05-23 Kasper Olsen

For a word $S$, let $f(S)$ be the largest integer $m$ such that there are two disjoints identical (scattered) subwords of length $m$. Let $f(n, \Sigma) = \min \{f(S): S \text{is of length} n, \text{over alphabet} \Sigma \}$. Here, it is…

Combinatorics · Mathematics 2012-04-11 Maria Axenovich , Yury Person , Svetlana Puzynina

What counts as evidence for syntactic structure? In traditional generative grammar, systematic contrasts in grammaticality such as subject-auxiliary inversion and the licensing of parasitic gaps are taken as evidence for an internal,…

Computation and Language · Computer Science 2025-12-12 Lars G. B. Johnsen

We establish the Subgradient Theorem for monotone correspondences -- a monotone correspondence is equal to the subdifferential of a potential if and only if it is conservative, i.e. its integral along a closed path vanishes irrespective of…

Theoretical Economics · Economics 2023-08-10 Nicholas C. Bedard , Jacob K. Goeree

The seminal theorem of Cobham has given rise during the last 40 years to a lot of works around non-standard numeration systems and has been extended to many contexts. In this paper, as a result of fifteen years of improvements, we obtain a…

Combinatorics · Mathematics 2010-10-21 Fabien Durand

A brief review of the status of duality symmetries in string theory is presented. The evidence is accumulating rapidly that an enormous group of duality symmetries, including perturbative T dualities and non-perturbative S-dualities,…

High Energy Physics - Theory · Physics 2007-05-23 John H. Schwarz

Let $\Gamma$ be a $Q$-polynomial distance-regular graph with diameter at least $3$. Terwilliger (1993) implicitly showed that there exists a polynomial, say $T(\lambda)\in \mathbb{C}[\lambda]$, of degree $4$ depending only on the…

Combinatorics · Mathematics 2014-03-18 Alexander L. Gavrilyuk , Jack H. Koolen

We investigate the unbalanced ordinary partition relations of the form $\lambda \rightarrow {(\lambda, \alpha)}^{2}$ for various values of the cardinal $\lambda$ and the ordinal $\alpha$. For example, we show that for every infinite…

Logic · Mathematics 2016-02-26 Dilip Raghavan , Stevo Todorcevic

A classical theorem in continued fractions due to Serret shows that for any two irrational numbers x and y related by a transformation $\gamma$ in PGL(2,Z) there exist s and t for which the complete quotients x_s and y_t coincide. In this…

Number Theory · Mathematics 2015-07-09 Paloma Bengoechea

It is easy to show that a pseudovariety which is reducible with respect to an implicit signature $\sigma$ for the equation $x=y$ can also be defined by $\sigma$-identities. We present several negative examples for the converse using…

Group Theory · Mathematics 2019-03-18 J. Almeida , O. Klíma

We confirm a conjecture of Guth concerning the maximal number of $\delta$-tubes, with $\delta$-separated directions, contained in the $\delta$-neighborhood of a real algebraic variety. Modulo a factor of $\delta^{-\varepsilon}$, we also…

Classical Analysis and ODEs · Mathematics 2018-07-24 Nets Hawk Katz , Keith M. Rogers

We first recall some basic notions on minimalist grammars and on categorial grammars. Next we shortly introduce partially commutative linear logic, and our representation of minimalist grammars within this categorial system, the so-called…

Computation and Language · Computer Science 2010-12-15 Maxime Amblard , Alain Lecomte , Christian Retoré

Random groups of density d<\frac{1}{2} are infinite hyperbolic, and of density d>\frac{1}{2} are finite. We prove that for any given system of equations \Sigma, all the solutions of \Sigma over a random group of density d<\frac{1}{2} are…

Group Theory · Mathematics 2024-08-13 Sobhi Massalha

In combinatorics on words, a word $w$ over an alphabet $\Sigma$ is said to avoid a pattern $p$ over an alphabet $\Delta$ of variables if there is no factor $f$ of $w$ such that $f=h(p)$ where $h:\Delta^*\to\Sigma^*$ is a non-erasing…

Discrete Mathematics · Computer Science 2016-10-14 Pascal Ochem , Matthieu Rosenfeld