Related papers: Modeling the Dialectic
In this paper, the author introduces the concept and basic properties of finite (commutative) hyperfields. Also, the author shows that, up to isomorphism, there are exactly 2 hyperfields of order 2; 5 hyperfields of order 3; 7 hyperfields…
A non-deterministic recursion scheme recognizes a language of finite trees. This very expressive model can simulate, among others, higher-order pushdown automata with collapse. We show decidability of the diagonal problem for schemes. This…
We study the rate of convergence of an explicit and an implicit-explicit finite difference scheme for linear stochastic integro-differential equations of parabolic type arising in non-linear filtering of jump-diffusion processes. We show…
We investigate the presence of twinlike models in theories described by several real scalar fields. We focus on the first-order formalism, and we show how to build distinct scalar field theories that support the same extended solution, with…
Sequences diverge either because they head off to infinity or because they oscillate. Part 1 constructs a non-Archimedean framework of infinite numbers that is large enough to contain asymptotic limit points for non-oscillating sequences…
We explore new interactions between finite model theory and classical streams of universal algebra and semigroup theory. A key result is an example of finite algebras whose variety is not finitely axiomatisable in first order logic, but…
In the first part of this paper we analyzed finite non-deterministic matrix semantics for propositional non-normal modal logics as an alternative to the standard Kripke's possible world semantics. This kind of modal systems characterized by…
We initiate the study of finite characterizations and exact learnability of modal languages. A finite characterization of a modal formula w.r.t. a set of formulas is a finite set of finite models (labelled either positive or negative) which…
We consider grammar-restricted exact learning of formulas and terms in finite variable logics. We propose a novel and versatile automata-theoretic technique for solving such problems. We first show results for learning formulas that…
This paper evaluates global-scale dialect identification for 14 national varieties of English as a means for studying syntactic variation. The paper makes three main contributions: (i) introducing data-driven language mapping as a method…
Plan of this report is given below: 1. Motivation from Physical and Mathematical Point of View; 2. Differential Calculi on Finite Groups; 3. Metrics; 4. Lagrangian Field Theory and Symplectic Structure; 5. Scalar Field Theory and Spectral…
In this paper, we prove the number of countable models of a countable supersimple theory is either 1 or infinite. This result is an extension of Lachlan's theorem on a superstable theory.
This a first step to develop a theory of smooth, etale and unramified morphisms between noetherian formal schemes. Our main tool is the complete module of differentials, that is a coherent sheaf whenever the map of formal schemes is of…
We consider the problem of counting the number of answers to a first-order formula on a finite structure. We present and study an extension of first-order logic in which algorithms for this counting problem can be naturally and conveniently…
Five algebraic notions of termination are formalised, analysed and compared: wellfoundedness or Noetherity, L\"ob's formula, absence of infinite iteration, absence of divergence and normalisation. The study is based on modal semirings,…
This paper concerns the construction and analysis of a numerical scheme for a mixed discrete-continuous fragmentation equation. A finite volume scheme is developed, based on a conservative formulation of a truncated version of the…
The twin primes conjecture is a very old problem. Tacitly it is supposed that the primes it deals with are finite. In the present paper we consider three problems that are not related to finite primes but deal with infinite integers. The…
This note discusses three examples given in the recent technical correspondence paper [1], which addresses the results presented in [2,3,4]. It is shown that the first example ([1], Section 3) is irrelevant to the results of [2]. The second…
We introduce perfect resolving algebras and study their fundamental properties. These algebras are basic for our theory of differential graded schemes, as they give rise to affine differential graded schemes. We also introduce etale…
A complete classification and character formulas for finite-dimensional irreducible representations of the rational Cherednik algebra of type A is given. Less complete results for other types are obtained. Links to the geometry of affine…