Related papers: Cancellation Meadows: a Generic Basis Theorem and …
The grammar representation of a narrowing tree for a syntactically deterministic conditional term rewriting system and a pair of terms is a regular tree grammar that generates expressions for substitutions obtained by all possible…
In this paper we introduce a model theoretic construction for the theories of uniform layered domains and semifields introduced in the paper of Izhakian, Knebusch and Rowen. We prove that, for a given layering semiring L, the theory of…
I deal with two approaches to proof-theoretic semantics: one based on argument structures and justifications, which I call reducibility semantics, and one based on consequence among (sets of) formulas over atomic bases, called base…
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general term-orderings (instead of level mappings), like it is done in transformational approaches to logic program…
<p>We address the general problem of determining the validity of boolean combinations of equalities and inequalities between real-valued expressions. In particular, we consider methods of establishing such assertions using only restricted…
We present a new approach to termination analysis of logic programs. The essence of the approach is that we make use of general orderings (instead of level mappings), like it is done in transformational approaches to logic program…
We explain and generalise a construction due to Gromov to realise geometric small cancellation groups over graphs of groups as fundamental groups of non-positively curved 2-dimensional complexes of groups. We then give conditions so that…
We revisit some of the basic results of generic vanishing theory, as pioneered by Green and Lazarsfeld, in the context of constructible sheaves. Using the language of perverse sheaves, we give new proofs of some of the basic results of this…
We study the manifestation of local gauge anomalies of four- and six-dimensional field theories in the lower-dimensional Kaluza-Klein theory obtained after circle compactification. We identify a convenient set of transformations acting on…
We generalize the constructions of [17,19] to layered semirings, in order to enrich the structure and provide finite examples for applications in arithmetic (including finite examples). The layered category theory of [19] is extended…
We study the application of formal diffeomorphisms to scalar fields. We give a new proof that interacting tree amplitudes vanish in the resulting theories. Our proof is directly at the diagrammatic level, not appealing to the path integral,…
Tree sets are abstract structures that can be used to model various tree-shaped objects in combinatorics. Finite tree sets can be represented by finite graph-theoretical trees. We extend this representation theory to infinite tree sets.…
We study the arithmetic property which allows to sharpen number-theoretic estimates. Previous results on this property are, as a rule, quantitive. The application of our general qualitive theorems to generalized hypergeometric functions…
Let $K$ be a complete non-archimedean valuation field of characteristic $0$, with non-trivial valuation, equipped with (possibly multiple) commuting bounded derivations. We prove a decomposition theorem for finite differential modules over…
We prove quantifier elimination for the theory of quasi-real closed fields with a compatible valuation. This unifies the same known results for algebraically closed valued fields and real closed valued fields.
Many generalizations of continued fractions, where the reciprocal function has been replaced by a more general function, have been studied, and it is often asked whether such generalized expansions can have nice properties. For instance, we…
In this paper, we prove weak elimination of imaginaries for perfect bounded pseudo-algebraically closed fields equipped with finitely many independent valuations. Our approach combines an extension result for types to invariant types with…
The Cancellation Problem for Affine Spaces is settled affirmatively, that is, it is proved that : Let $ k $ be an algebraically closed field of characteristic zero and let $n, m \in \mathbb{N}$. If $R[Y_1,..., Y_m] \cong_k k[X_1,...,…
Completion is one of the most studied techniques in term rewriting and fundamental to automated reasoning with equalities. In this paper we present new correctness proofs of abstract completion, both for finite and infinite runs. For the…
We review a notion of completeness in QFT arising from the analysis of basic properties of the set of operator algebras attached to regions. In words, this completeness asserts that the physical observable algebras produced by local degrees…