Related papers: Finite models for positive combinatorial and expon…
This paper extends previous work on linear correlations of representation functions of positive definite binary quadratic forms to allow indefinite forms.
There are 13 equivalence classes of 2D second order quantum and classical superintegrable systems with nontrivial potential, each associated with a quadratic algebra of hidden symmetries. We study the finite and infinite irreducible…
The paper is devoted to modal properties of the ternary strict betweenness relation as used in the development of various systems of geometry. We show that such a relation is non-definable in a basic similarity type with a binary operator…
The main result of this paper is to show that all binomial identities are orderable. This is a natural statement in the combinatorial theory of finite sets, which can also be applied in distributed computing to derive new strong bounds on…
We uncover a close relationship between combinatorial and syntactic proofs for first-order logic (without equality). Whereas syntactic proofs are formalized in a deductive proof system based on inference rules, a combinatorial proof is a…
In this paper it is stressed that there is no {\em physical} reason for symmetries to be linear and that Lie group theory is therefore too restrictive. We illustrate this with some simple examples. Then we give a readable review on the…
In this paper we prove undecidability of finite systems of equations in free Lie algebras of rank at least three over an arbitrary field. We show that the ring of integers $\mathbb{Z}$ is interpretable by positive existential formulas in…
A partial algebra construction of Gr\"atzer and Schmidt from "Characterizations of congruence lattices of abstract algebras" (Acta Sci. Math. (Szeged) 24 (1963), 34-59) is adapted to provide an alternative proof to a well-known fact that…
We prove that (additive) ordered group reducts of nonstandard models of the bounded arithmetical theory $\mathsf{VTC^0}$ are recursively saturated in a rich language with predicates expressing the integers, rationals, and logarithmically…
Given an integral indefinite binary Hermitian form f over an imaginary quadratic number field, we give a precise asymptotic equivalent to the number of nonequivalent representations, satisfying some congruence properties, of the rational…
In this paper, we consider infinite words that arise as fixed points of primitive substitutions on a finite alphabet and finite colorings of their factors. Any such infinite word exhibits a "hierarchal structure" that will allow us to…
We give a simpler proof of a result of Hodkinson in the context of a blow and blur up construction argueing that the idea at heart is similar to that adopted by Andr\'eka et all \cite{sayed}. The idea is to blow up a finite structure,…
A longstanding open problem is whether there exists a non-syntactical model of untyped lambda-calculus whose theory is exactly the least equational lambda-theory (=Lb). In this paper we make use of the Visser topology for investigating the…
We revisit evaluation of logical formulas that allow both uninterpreted relations, constrained to be finite, as well as an interpreted vocabulary over an infinite domain. This formalism was denoted embedded finite model theory in the past.…
In traditional justification logic, evidence terms have the syntactic form of polynomials, but they are not equipped with the corresponding algebraic structure. We present a novel semantic approach to justification logic that models…
In a former paper we introduced partial infinitary noncommutative semigroups and showed, among other, that significant differences arise in comparison with the commutative case, previously studied in the literature. For example, in the…
The behavior of factorization properties in various ring extensions is a central theme in commutative algebra. Classically, the UFDs are (completely) integrally closed and tend to behave well in standard ring extensions, with the notable…
Prolog's ability to return multiple answers on backtracking provides an elegant mechanism to derive reversible encodings of combinatorial objects as Natural Numbers i.e. {\em ranking} and {\em unranking} functions. Starting from a…
To every finite-dimensional $\mathbb C$-algebra $\Lambda$ of finite representation type we associate an affine variety. These varieties are a large generalization of the varieties defined by "$u$ variables" satisfying "$u$-equations", first…
Interest in anti-unification, the dual problem of unification, is on the rise due to applications within the field of software analysis and related areas. For example, anti-unification-based techniques have found uses within clone detection…