English
Related papers

Related papers: Second order conservative languages with a Maltsev…

200 papers

Multilingual sentence representations from large models encode semantic information from two or more languages and can be used for different cross-lingual information retrieval and matching tasks. In this paper, we integrate contrastive…

Computation and Language · Computer Science 2023-05-02 Weiting Tan , Kevin Heffernan , Holger Schwenk , Philipp Koehn

We introduce several classes of array languages obtained by generalising Angluin's pattern languages to the two-dimensional case. These classes of two-dimensional pattern languages are compared with respect to their expressive power and…

Formal Languages and Automata Theory · Computer Science 2017-07-14 Henning Fernau , Markus L. Schmid , K. G. Subramanian

Languages of the world vary concerning the order of subject, object and verb. The most frequent dominant orders are SOV and SVO, and researchers have tailored models to this fact. However, there are still languages whose dominant order does…

Computation and Language · Computer Science 2026-04-30 Jairo Rios-El-Yazidi , Ramon Ferrer-i-Cancho

Large Language Models (LLMs) have demonstrated remarkable capabilities in various NLP tasks. However, previous works have shown these models are sensitive towards prompt wording, and few-shot demonstrations and their order, posing…

Computation and Language · Computer Science 2023-08-23 Pouya Pezeshkpour , Estevam Hruschka

The dynamics of the solutions to a class of conservative SPDEs are analysed from two perspectives: Firstly, a probabilistic construction of a corresponding random dynamical system is given for the first time. Secondly, the existence and…

Probability · Mathematics 2022-06-30 Benjamin Fehrman , Benjamin Gess , Rishabh S. Gvalani

Factor complexity $\mathcal{C}$ and palindromic complexity $\mathcal{P}$ of infinite words with language closed under reversal are known to be related by the inequality $\mathcal{P}(n) + \mathcal{P}(n+1) \leq 2 +…

Combinatorics · Mathematics 2015-03-12 Edita Pelantová , Štěpán Starosta

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

Logic · Mathematics 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

We characterize binary words that have exactly two unbordered conjugates and show that they can be expressed as a product of two palindromes.

Formal Languages and Automata Theory · Computer Science 2019-12-18 Štěpán Holub , Mike Müller

We prove a multiplicity result for a class of strongly indefinite nonlinear second order asymptotically linear systems with Dirichlet boundary conditions. The key idea for the proof is to bring together the classical shooting method and the…

Classical Analysis and ODEs · Mathematics 2009-06-02 Anna Capietto , Francesca Dalbono , Alessandro Portaluri

We investigate two notions about descriptions of groups using first-order language: quasi-finite axiomatizability, concerning infinite groups, and polylogarithmic compressibility, concerning classes of finite groups.

Group Theory · Mathematics 2013-05-02 Yuki Maehara

According to a theorem of Courcelle monadic second-order logic and guarded second-order logic (where one can also quantify over sets of edges) have the same expressive power over the class of all countable $k$-sparse hypergraphs. In the…

Logic in Computer Science · Computer Science 2015-07-01 Achim Blumensath

We introduce layer systems for proving generalizations of the modularity of confluence for first-order rewrite systems. Layer systems specify how terms can be divided into layers. We establish structural conditions on those systems that…

Logic in Computer Science · Computer Science 2015-02-10 Bertram Felgenhauer , Aart Middeldorp , Harald Zankl , Vincent van Oostrom

The investigations on higher-order type theories and on the related notion of parametric polymorphism constitute the technical counterpart of the old foundational problem of the circularity (or impredicativity) of second and higher order…

Logic · Mathematics 2018-04-30 Paolo Pistone

We study an invariant, the secondary trace, attached to two commuting endomorphisms of a 2-dualizable object in a symmetric monoidal higher category. We establish a secondary trace formula which encodes the natural symmetries of this…

Algebraic Geometry · Mathematics 2013-06-04 David Ben-Zvi , David Nadler

A variety is a class of algebraic structures axiomatized by a set of equations. An equation is linear if there is at most one occurrence of an operation symbol on each side. We show that a variety axiomatized by linear equations has the…

Logic · Mathematics 2024-08-28 Paolo Lipparini

Various concepts of grammatical compositionality arise in many theories of both natural and artificial languages, and often play a key role in accounts of the syntax-semantics interface. We propose that many instances of compositionality…

Computation and Language · Computer Science 2022-01-17 Norman E. Trushaev

This paper presents an approach to spelling correction in agglutinative languages that is based on two-level morphology and a dynamic programming based search algorithm. Spelling correction in agglutinative languages is significantly…

cmp-lg · Computer Science 2008-02-03 Kemal Oflazer

Permutations can be viewed as pairs of linear orders, or more formally as models over a signature consisting of two binary relation symbols. This approach was adopted by Albert, Bouvel and F\'eray, who studied the expressibility of…

Combinatorics · Mathematics 2025-11-05 Vít Jelínek , Michal Opler

Maltese is often described as having a hybrid morphological system resulting from extensive contact between Semitic and Romance language varieties. Such a designation reflects an etymological divide as much as it does a larger tradition in…

Computation and Language · Computer Science 2023-05-23 Sara Court , Andrea D. Sims , Micha Elsner

The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…

Formal Languages and Automata Theory · Computer Science 2025-02-12 Pranshu Gaba , Arnab Sur