
We study the first-order axiomatisability of finite semiring interpretations or, equivalently, the question whether elementary equivalence and isomorphism coincide for valuations of atomic facts over a finite universe into a commutative semiring. Contrary to the classical case of Boolean semantics, where every finite structure can obviously be axiomatised up to isomorphism by a first-order sentence, the situation in semiring semantics is rather different, and strongly depends on the underlying semiring. We prove that for a number of important semirings, including min-max semirings, and the semirings of positive Boolean expressions, there exist finite semiring interpretations that are elementarily equivalent but not isomorphic. The same is true for the polynomial semirings that are universal for the classes of absorptive, idempotent, and fully idempotent semirings, respectively. On the other side, we prove that for other, practically relevant, semirings such as the Viterby semiring, the tropical semiring, the natural semiring and the universal polynomial semiring N[X], all finite semiring interpretations are first-order axiomatisable (and thus elementary equivalence implies isomorphism), although some of the axiomatisations that we exhibit use an infinite set of axioms.
21 pages
Semiring semantics, elementary equivalence, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Databases (cs.DB), Mathematics - Logic, Theory of computation → Finite Model Theory, 004, Logic in Computer Science (cs.LO), Computer Science - Databases, 03C13, FOS: Mathematics, F.4.1, Theory of computation ? Finite Model Theory, Logic (math.LO), axiomatisability, ddc: ddc:004
Semiring semantics, elementary equivalence, FOS: Computer and information sciences, Computer Science - Logic in Computer Science, Databases (cs.DB), Mathematics - Logic, Theory of computation → Finite Model Theory, 004, Logic in Computer Science (cs.LO), Computer Science - Databases, 03C13, FOS: Mathematics, F.4.1, Theory of computation ? Finite Model Theory, Logic (math.LO), axiomatisability, ddc: ddc:004
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 0 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
