English
Related papers

Related papers: Preservation Theorems in Semiring Semantics

200 papers

A class of structures is said to have the homomorphism-preservation property just in case every first-order formula that is preserved by homomorphisms on this class is equivalent to an existential-positive formula. It is known by a result…

Logic in Computer Science · Computer Science 2009-03-08 Anuj Dawar

Symmetries are defined in histories-based generalized quantum mechanics paying special attention to the class of history theories admitting quasitemporal structure (a generalization of the concept of `temporal sequences' of `events' using…

General Relativity and Quantum Cosmology · Physics 2007-05-23 Tulsi Dass , Yogesh N. Joglekar

We present a general relational semantics framework which, by varying the axiomatization and components of the relational structures, provides a uniform semantics for sentential logics, classical and non-classical alike. The approach we…

Logic in Computer Science · Computer Science 2025-11-25 Chrysafis Hartonas

In this paper we state and prove ad hoc "Separation Theorems" of the so-called Smooth Commutative Algebra, the Commutative Algebra of \(\mathcal{C}^{\infty}-\)rings. These results are formally similar to the ones we find in (ordinary)…

Commutative Algebra · Mathematics 2021-10-27 Jean Cerqueira Berni , Hugo Luiz Mariano

Logical relations are one of the most powerful techniques in the theory of programming languages, and have been used extensively for proving properties of a variety of higher-order calculi. However, there are properties that cannot be…

Programming Languages · Computer Science 2020-02-21 Gilles Barthe , Raphaëlle Crubillé , Ugo Dal Lago , Francesco Gavazzo

Recursive queries have been traditionally studied in the framework of datalog, a language that restricts recursion to monotone queries over sets, which is guaranteed to converge in polynomial time in the size of the input. But modern big…

Databases · Computer Science 2024-01-26 Mahmoud Abo Khamis , Hung Q. Ngo , Reinhard Pichler , Dan Suciu , Yisu Remy Wang

The integration of lexical semantics and pragmatics in the analysis of the meaning of natural lan- guage has prompted changes to the global framework derived from Montague. In those works, the original lexicon, in which words were assigned…

Computation and Language · Computer Science 2013-09-05 Bruno Mery , Christian Retoré

For every semilattice $\mathcal{S}=(S,+)$, the set $\mathrm{End}(\mathcal{S})$ of its endomorphisms forms a semiring under point-wise addition and composition. We prove that the semiring of all endomorphisms of the 3-element chain has no…

Group Theory · Mathematics 2026-05-05 Sergey V. Gusev , Mikhail V. Volkov

We survey theory developed over the past 10 years of semirings which need not be additively cancellative. The main feature is a specified ``null ideal'' $\mcA_0$ of a semiring $\mcA,$ taking the place of a zero element, which permits…

Rings and Algebras · Mathematics 2026-03-17 Louis Halle Rowen

To represent anything from mathematical concepts to real-world objects, we have to resort to an encoding. Encodings, such as written language, usually assume a decoder that understands a rich shared code. A semantic embedding is a form of…

Discrete Mathematics · Computer Science 2022-05-26 Fernando Martin-Maroto , Gonzalo G. de Polavieja

Let $R\subset F$ be an extension of real closed fields and ${\mathcal S}(M,R)$ the ring of (continuous) semialgebraic functions on a semialgebraic set $M\subset R^n$. We prove that every $R$-homomorphism $\varphi:{\mathcal S}(M,R)\to F$ is…

Algebraic Geometry · Mathematics 2015-09-16 Jose F. Fernando

In this work we prove the undecidability (and $\Sigma^0_1$-completeness) of several theories of semirings with fixed points. The generality of our results stems from recursion theoretic methods, namely the technique of effective…

Logic · Mathematics 2025-12-23 Anupam Das , Abhishek De , Stepan L. Kuznetsov

Sandqvist's base-extension semantics for intuitionistic propositional logic defines a support relation parametrised by atomic bases, with validity identified as support in every base. Sandqvist's completeness theorem answers the global…

Logic in Computer Science · Computer Science 2026-03-16 Alexander V. Gheorghiu

In several different settings, one comes across situations in which the objects of study are locally consistent but globally inconsistent. Earlier work about probability distributions by Vorob'ev (1962) and about database relations by…

Databases · Computer Science 2020-09-22 Albert Atserias , Phokion G. Kolaitis

We show that every finite semilattice can be represented as an atomized semilattice, an algebraic structure with additional elements (atoms) that extend the semilattice's partial order. Each atom maps to one subdirectly irreducible…

Rings and Algebras · Mathematics 2021-02-17 Fernando Martin-Maroto , Gonzalo G. de Polavieja

Generating vector representations (embeddings) of OWL ontologies is a growing task due to its applications in predicting missing facts and knowledge-enhanced learning in fields such as bioinformatics. The underlying semantics of OWL…

Logic in Computer Science · Computer Science 2024-11-07 Fernando Zhapa-Camacho , Robert Hoehndorf

We develop the representation theory of a finite semigroup over an arbitrary commutative semiring with unit, in particular classifying the irreducible and minimal representations. The results for an arbitrary semiring are as good as the…

Rings and Algebras · Mathematics 2010-04-13 Zur Izhakian , John Rhodes , Benjamin Steinberg

Formal Semantics and Distributional Semantics are two important semantic frameworks in Natural Language Processing (NLP). Cognitive Semantics belongs to the movement of Cognitive Linguistics, which is based on contemporary cognitive…

Computation and Language · Computer Science 2017-09-26 Kun Xing

We show that, contrary to the commonly held view, there is a natural and optimal compactness theorem for $\mathrm{L}_{\infty\infty}$ which generalizes the usual compactness theorem for first order logic. The key to this result is the switch…

Logic · Mathematics 2025-07-29 Juan M Santiago Suárez , Matteo Viale

We investigate endomorphism semirings of a finite semilattice with one least element and one greatest element such that all the other elements form an antichain. We construct some new finite simple semirings. Keywords: endomorphism…

Rings and Algebras · Mathematics 2013-01-15 Ivan Trendafilov