相关论文: Preservation Theorems in Semiring Semantics

The connection between symmetries and conservation laws as made by Noether's theorem is extended to the context of causal variational principles and causal fermion systems. Different notions of continuous symmetries are introduced. It is…

We revisit the work studying homomorphism preservation for first-order logic in sparse classes of structures initiated in [Atserias et al., JACM 2006] and [Dawar, JCSS 2010]. These established that first-order logic has the homomorphism…

This thesis investigates the central role of homomorphism problems (structure-preserving maps) in two complementary domains: database querying over finite, graph-shaped data, and constraint solving over (potentially infinite) structures.…

This note contains some material promised in our earlier papers on submodel preservation and the guarded fragment, along with some information on the current status of the problems mentioned in these papers. Section 1 contains an early…

In this paper, among other results, there are described (complete) simple - simultaneously ideal- and congruence-simple - endomorphism semirings of (complete) idempotent commutative monoids; it is shown that the concepts of simpleness,…

Given a first-order sentence, a model-checking computation tests whether the sentence holds true in a given finite structure. Data provenance extracts from this computation an abstraction of the manner in which its result depends on the…

In the theory of commutative semirings, the lack of additive inverses creates a structural divergence between ideals and congruences that does not exist in ring theory. The aim of this article is to restore critical ideal-theoretic…

A canonical result in model theory is the homomorphism preservation theorem (h.p.t.) which states that a first-order formula is preserved under homomorphisms iff it is equivalent to an existential-positive formula, standardly proved via a…

Preservation theorems provide a direct correspondence between the syntactic structure of first-order sentences and the closure properties of their respective classes of models. A line of work has explored preservation theorems relativised…

We introduce the notion of radical preservation and prove that a radical-preserving homomorphism of left artinian rings of finite projective dimension with superfluous kernel reflects the finiteness of the little finitistic, big finitistic…

We study possibilities of preservations for properties, their links and related connections between semantic and syntactic ones, both in general and as characterizations for subalgebras, congruence relations, Henkin construction,…

We present novel semiring semantics for abstract reduction systems (ARSs). More precisely, we provide a weighted version of ARSs, where the reduction steps induce weights from a semiring. Inspired by provenance analysis in database theory…

In this paper, we consider a question of sum-keeping about a multiplicative subsemigroup and its generator subsets in a semiring, and develop some elementary (collapse) process of the sum-keeping retraction through subsets until one minimal…

We present a new proof of the generalized {\L}o\'s-Tarski theorem ($\mathsf{GLT}(k)$) introduced in [1], over arbitrary structures. Instead of using $\lambda$-saturation as in [1], we construct just the "required saturation" directly using…

We study various notions of dependency in semiring team semantics. Semiring teams are essentially database relations, where each tuple is annotated with some element from a positive semiring. We consider semiring generalizations of several…

An ordered semiring is a commutative semiring equipped with a compatible preorder. Ordered semirings generalise both distributive lattices and commutative rings, and provide a convenient framework to unify certain aspects of lattice theory…

This work extends the Ibragimov's conservation theorem for partial differential equations [{\it J. Math. Anal. Appl. 333 (2007 311-328}] to under determined systems of differential equations. The concepts of adjoint equation and formal…

We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…

In a previous article by two of the present authors and S. Bonzio, \L ukasiewicz near semirings were introduced and it was proven that basic algebras can be represented (precisely, are term equivalent to) as near semirings. In the same work…

Tableaux originate as a decision method for a logical language. They can also be extended to obtain a structure that spells out all the information in a set of sentences in terms of truth value assignments to atomic formulas that appear in…