相关论文: Undecidability of theories of semirings with fixed…

We introduce a first-order theory of finite full binary trees and then identify decidable and undecidable fragments of this theory. We show that the analogue of Hilbert`s 10th Problem is undecidable by constructing a many-to-one reduction…

The main purpose of this paper is to investigate the zero-divisors of semigroups with zero and semirings and in particular, to discuss eversible and reversible semigroups and semirings. We also introduce a new ring-like algebraic structure…

We consider first-order logics of sequences ordered by the subsequence ordering, aka sequence embedding. We show that the \Sigma_2 theory is undecidable, answering a question left open by Kuske. Regarding fragments with a bounded number of…

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…

In this paper, we investigate zero-divisor, nilpotent, idempotent, unit, small, and irreducible elements in semiring extensions such as amount, content, and monoid semialgebras. We also introduce new concepts such as the prime avoidance…

We prove undecidability for every positive relevant logic extending the system axiomatized by hypothetical syllogism, prefixing, and suffixing and contained in the logic of the semilattice frame $(P_{\mathrm{fin}}(\mathbb{N}), \cup,…

In the paper we apply some of the results from the theory of ball spaces in the semimetric spaces. This allowed us to obtain some fixed point theorems which we believe to be unknown to this day. We also show the limitations of the ball…

In the second section, we introduce hemiring-valued pseudonormed rings and generalize Albert's result which states that every finite-dimensional algebra can be normed. Next, we introduce shrinkable hemirings and prove that dense division…

Idempotents yield much insight in the structure of finite semigroups and semirings. In this article, we obtain some results on (multiplicatively) idempotents of the endomorphism semiring of a finite chain. We prove that the set of all…

We prove that arithmetic is interpretable in any indecomposable polynomial ring (in any set of variables), and in addition we provide an alternative uniform proof of undecidability for all members in this class of rings.

We argue that Godel's completeness theorem is equivalent to completability of consistent theories, and Godel's incompleteness theorem is equivalent to the fact that this completion is not constructive, in the sense that there are some…

We prove that the problems of representing a finite ordered complemented semigroup or finite lattice-ordered semigroup as an algebra of binary relations over a finite set are undecidable. In the case that complementation is taken with…

We give a quick survey of the various fixed point theorems in computability theory, partial combinatory algebra, and the theory of numberings, as well as generalizations based on those. We also point out several open problems connected to…

Our main result states that a finite semiring of order >2 with zero which is not a ring is congruence-simple if and only if it is isomorphic to a `dense' subsemiring of the endomorphism semiring of a finite idempotent commutative monoid. We…

Commutative semirings with divisible additive semigroup are studied. We show that an additively divisible commutative semiring is idempotent, provided that it is finitely generated and torsion. In case that a one-generated additively…

We consider first-order logic over the subword ordering on finite words, where each word is available as a constant. Our first result is that the $\Sigma_1$ theory is undecidable (already over two letters). We investigate the decidability…

We investigate infinitary wellfounded systems for linear logic with fixed points, with transfinite branching rules indexed by some closure ordinal $\alpha$ for fixed points. Our main result is that provability in the system for some…

Classical results due to Ingham and Paley-Wiener characterize the existence of nonzero functions supported on certain subsets of the real line in terms of the pointwise decay of the Fourier transforms. Viewing these results as uncertainty…

We show that the word problem for an amalgam $[S_1,S_2;U,\omega_1,\omega_2]$ of inverse semigroups may be undecidable even if we assume $S_1$ and $S_2$ (and therefore $U$) to have finite $\mathcal{R}$-classes and $\omega_1,\omega_2$ to be…

These lecture notes cover classical undecidability results in number theory, Hilbert's 10th problem and recent developments around it, also for rings other than the integers. It also contains a sketch of the authors result that the integers…