English
Related papers

Related papers: A note on powers of Boolean spaces with internal s…

200 papers

By using the abstract structures investigated in the first Part of this article, we develop a semantics for an epistemic language, which expresses sentences like "Alice knows that Bob does not understand that PI is irrational". One is…

In this note, we show that the algebraicity of the Fourier coefficients of half-integral weight modular forms can be determined by checking the algebraicity of the first few of them. We also give a necessary and sufficient condition for a…

Number Theory · Mathematics 2014-11-25 Narasimha Kumar , Soma Purkait

Laplacians associated with domains with singular boundary conditions and are considered together with semigroups on generalized Sobolev spaces, they generate. Applications are given to stochastic PDEs with singular boundary conditions.

Mathematical Physics · Physics 2025-05-20 Sergio Albeverio , Zdzisław Brzeźniak , Szymon Peszat

We construct a class of II_1 factors M that admit unclassifiably many Cartan subalgebras in the sense that the equivalence relation of being conjugate by an automorphism of M is complete analytic, in particular non Borel. We also construct…

Operator Algebras · Mathematics 2012-08-20 An Speelman , Stefaan Vaes

We study the Monadic Second Order (MSO) Hierarchy over colourings of the discrete plane, and draw links between classes of formula and classes of subshifts. We give a characterization of existential MSO in terms of projections of tilings,…

Discrete Mathematics · Computer Science 2013-03-07 Emmanuel Jeandel , Guillaume Theyssier

The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…

Logic in Computer Science · Computer Science 2023-08-30 Joshua Hirschbrunn , Yevgeny Kazakov

Computational effects are commonly modelled by monads, but often a monad can be presented by an algebraic theory of operations and equations. This talk is about monads and algebraic theories for languages for inference, and their…

Logic in Computer Science · Computer Science 2023-12-29 Cristina Matache , Sean Moss , Sam Staton , Ariadne Si Suo

In this mostly expository article, elements of higher category theory essential to the construction of a class of four dimensional quantum geometric models are reviewed. These models improve current state sum models for Quantum Gravity,…

General Relativity and Quantum Cosmology · Physics 2007-05-23 M. D. Sheppeard

In computer science, various logical languages are defined to analyze properties of systems. One way to pinpoint the essential differences between those logics is to compare their expressivity in terms of distinguishing power and expressive…

Logic in Computer Science · Computer Science 2009-05-28 Yanjing Wang , Francien Dechesne

Linguistic similarity is multi-faceted. For instance, two words may be similar with respect to semantics, syntax, or morphology inter alia. Continuous word-embeddings have been shown to capture most of these shades of similarity to some…

Computation and Language · Computer Science 2019-07-05 Ryan Cotterell , Hinrich Schütze

This is the second paper in a series on enumerative invariants counting self-dual objects in self-dual categories, and is a sequal to (arXiv:2302.00038). Ordinary enumerative invariants in abelian categories can be seen as invariants for…

Algebraic Geometry · Mathematics 2023-09-12 Chenjing Bu

We study the cohomology (cocycles) of Lie superalgebras for the generalised complex of forms: superforms, pseudoforms and integral forms. We argue that these cocycles might be interpreted in the light of a new brane scan as generators of…

High Energy Physics - Theory · Physics 2024-03-22 C. A. Cremonini , P. A. Grassi

The article proposes the description of internal spaces of fermion (quarks and leptons and antiquarks and antileptons) and boson (photons, weak bosons, gluons, gravitons and scalars) second quantized fields in a unique way if they all are…

General Physics · Physics 2025-02-26 N. S. Mankoč Borštnik

Beyond the great cognitive powers showcased by language models, it is crucial to scrutinize whether their reasoning capabilities stem from strong generalization or merely exposure to relevant data. As opposed to constructing increasingly…

Computation and Language · Computer Science 2024-01-02 Hongqiu Wu , Linfeng Liu , Hai Zhao , Min Zhang

Semigroup algebras admit certain `coherent' deformations which, in the special case of a path algebra, may associate a periodic function to an evolving path; for a particle moving freely on a straight line after an initial impulse, the wave…

Rings and Algebras · Mathematics 2016-12-21 Murray Gerstenhaber

We propose a novel topological perspective on data languages recognizable by orbit-finite nominal monoids. For this purpose, we introduce pro-orbit-finite nominal topological spaces. Assuming globally bounded support sizes, they coincide…

Computation and Language · Computer Science 2024-01-17 Fabian Birkmann , Stefan Milius , Henning Urbat

Gaussian binomial coefficients are q-analogues of the binomial coefficients of integers. On the other hand, binomial coefficients have been extended to finite words, i.e., elements of the finitely generated free monoids. In this paper we…

Combinatorics · Mathematics 2024-11-25 Antoine Renard , Michel Rigo , Markus A. Whiteland

In flowchart languages, predicates play an interesting double role. In the textual representation, they are often presented as conditions, i.e., expressions which are easily combined with other conditions (often via Boolean combinators) to…

Logic in Computer Science · Computer Science 2020-09-25 Robin Kaarsgaard

Semantic embeddings have advanced the state of the art for countless natural language processing tasks, and various extensions to multimodal domains, such as visual-semantic embeddings, have been proposed. While the power of visual-semantic…

Machine Learning · Computer Science 2021-02-23 Adam Dahlgren Lindström , Suna Bensch , Johanna Björklund , Frank Drewes

We introduce a new methodology for intrinsic evaluation of word representations. Specifically, we identify four fundamental criteria based on the characteristics of natural language that pose difficulties to NLP systems; and develop tests…

Computation and Language · Computer Science 2016-06-28 Yadollah Yaghoobzadeh , Hinrich Schütze