Related papers: Definiteness properties of first-order schemes
We show that any first order ordinary differential equation with a known Lie point symmetry group can be discretized into a difference scheme with the same symmetry group. In general, the lattices are not regular ones, but must be adapted…
Based on Gandy's principles for models of computation we give category-theoretic axioms describing locally deterministic updates to finite objects. Rather than fixing a particular category of states, we describe what properties such a…
Can machines think? Since Alan Turing asked this question in 1950, nobody is able to give a direct answer, due to the lack of solid mathematical foundations for general intelligence. In this paper, we introduce a categorical framework…
We lay the ground for an Isabelle/ZF formalization of Cohen's technique of forcing. We formalize the definition of forcing notions as preorders with top, dense subsets, and generic filters. We formalize the definition of forcing notions as…
We completely describe a new domain for abstract interpretation of numerical programs. Fixpoint iteration in this domain is proved to converge to finite precise invariants for (at least) the class of stable linear recursive filters of any…
We contribute to the refined understanding of the language-logic-algebra interplay in the context of first-order properties of countable words. We establish decidable algebraic characterizations of one variable fragment of FO as well as…
We study the notion of boundedness in the context of positive existential rules, that is, whether there exists an upper bound to the depth of the chase procedure, that is independent from the initial instance. By focussing our attention on…
We introduce INDUCTION, a benchmark for finite structure concept synthesis in first order logic. Given small finite relational worlds with extensionally labeled target predicates, models must output a single first order logical formula that…
The theory of finite term algebras provides a natural framework to describe the semantics of functional languages. The ability to efficiently reason about term algebras is essential to automate program analysis and verification for…
A new elementary proof of the prime number theorem presented recently in the framework of a scale invariant extension of the ordinary analysis is re-examined and clarified further. Both the formalism and proof are presented in a much more…
Let $\mathcal M=(M,<,...)$ be a linearly ordered first-order structure and $T$ its complete theory. We investigate conditions for $T$ that could guarantee that $\mathcal M$ is not much more complex than some colored orders (linear orders…
Four sets of necessary and sufficient conditions are obtained for the first-order rigidity of a periodic bond-node framework \C in R^d which is of crystallographic type. In particular, an extremal rank characterisation is obtained which…
Affine term structure models have gained significant attention in the finance literature, mainly due to their analytical tractability and statistical flexibility. The aim of this article is to present both theoretical foundations as well as…
As the prototypical category, $\mathbf{Set}$ has many properties which make it special amongst categories. From the point of view of mathematical logic, one such property is that $\mathbf{Set}$ has enough structure to "properly" formalise…
We consider graph properties that can be checked from labels, i.e., bit sequences, of logarithmic length attached to vertices. We prove that there exists such a labeling for checking a first-order formula with free set variables in the…
We introduce and prove the consistency of a new set theoretic axiom we call the \emph{Invariant Ideal Axiom}. The axiom enables us to provide (consistently) a full topological classification of countable sequential groups, as well as fully…
Based on our recent results, in this paper, a compact finite difference scheme is derived for a time fractional differential equation subject to the Neumann boundary conditions. The proposed scheme is second order accurate in time and…
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…
In this article, we study the complexity of weighted team definability for logics with team semantics. This problem is a natural analogue of one of the most studied problems in parameterized complexity, the notion of weighted…
We review some independence results in a finite axiom-schematization of classical first-order logic introduced by Norman Megill. We also prove that a certain axiom scheme of this system is independent although all of its instances are…