Related papers: Predicates and terms from non-standard sequences
A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a…
We present in this paper a universal method of constructing left-continuous triangular norms (l.-c. t-norms). The starting point is an arbitrary, possibly finite, totally ordered monoid fulfilling the conditions that are characteristic for…
A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are…
The definitional equality of an intensional type theory is its test of type compatibility. Today's systems rely on ordinary evaluation semantics to compare expressions in types, frustrating users with type errors arising when evaluation…
We consider ideals in a polynomial ring that are generated by regular sequences of homogeneous polynomials and are stable under the action of the symmetric group permuting the variables. In previous work, we determined the possible…
Process theories combine a graphical language for compositional reasoning with an underlying categorical semantics. They have been successfully applied to fields such as quantum computation, natural language processing, linear dynamical…
It is well known that ZFC, despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the…
These lecture notes, to be completed in a later version, offer a short and rigorous introduction to Nostandard Analysis, mainly aimed to reach to a presentation of the basics of Loeb integration, and in particular, Loeb measures. The…
The compositionality degree of multiword expressions indicates to what extent the meaning of a phrase can be derived from the meaning of its constituents and their grammatical relations. Prediction of (non)-compositionality is a task that…
Motivated by potential applications to theoretical computer science, in particular those areas where the Curry-Howard correspondence plays an important role, as well as by the ongoing search in pure mathematics for feasible approaches to…
This paper proposes a definition of recognizable transducers over monads and comonads, which bridges two important ongoing efforts in the current research on regularity. The first effort is the study of regular transductions, which extends…
Someone knowledgeable in nonstandard analysis may get the feeling that in the nonlinear theory of generalized functions, too often one works directly on the nets and spends effort to obtain results that should be clear from general…
A new construction is given of non-standard uniserial modules over certain valuation domains; the construction resembles that of a special Aronszajn tree in set theory. A consequence is the proof of a sufficient condition for the existence…
A pattern of a sequence is a sequence of integer indices with each index describing the order of first occurrence of the respective symbol in the original sequence. In a recent paper, tight general bounds on the block entropy of patterns of…
We introduce and investigate the category $\mathsf{AtoMon}$ of atomic monoids and atom-preserving monoid homomorphisms, which is a (non-full) subcategory of the usual category of monoids. In particular, we compute all limits and colimits,…
The purpose of this article is to present a new approach for the discovery and labelling of the implicit conceptual schema of texts through the application of the Thematic Progression theory. The underlying conceptual schema is the core…
In this paper, we consider the monoid $\mathcal{PIO}_{n}$, of all partial order-preserving transformations on a chain with $n$ elements whose domains and ranges are intervals, along with its submonoid $\mathcal{PIO}_{n}^-$ of…
The purpose of this article is to present ideas towards obtaining a model category structure on the category of small strict n-categories, generalizing the one obtained by Thomason on ordinary categories. Following ideas of Grothendieck and…
Let $G$ be a group and $G_0 \subseteq G$ be a subset. A sequence over $G_0$ means a finite sequence of terms from $G_0$, where the order of elements is disregarded and the repetition of elements is allowed. A product-one sequence is a…
In this article, we discuss a novel approach to solving number sequence problems, in which sequences of numbers following unstated rules are given, and missing terms are to be inferred. We develop a methodology of decomposing test sequences…