Related papers: Modeling the Dialectic
Monadic second order logic and linear temporal logic are two logical formalisms that can be used to describe classes of infinite words, i.e., first-order models based on the natural numbers with order, successor, and finitely many unary…
This paper deals with the Darcy-Forchheimer problem with two kinds of boundary conditions. We discretize the system by using the finite element methods and we propose two iterative schemes to solve the discrete problems. The well-posedness…
Recently, the construction of finite difference schemes from lattice Boltzmann schemes has been rigorously analyzed [Bellotti et al. (2022), Numer. Math. 152, pp. 1-40]. It is thus known that any lattice Boltzmann scheme can be expressed in…
A description is given of those sequences ${\Bbb S}= (S(0),S(1),\dots,S(l))$ of simple modules over a finite dimensional algebra for which there are only finitely many uniserial modules with consecutive composition factors…
This paper provides a gentle introduction to problem solving with the IDP3 system. The core of IDP3 is a finite model generator that supports first order logic enriched with types, inductive definitions, aggregates and partial functions. It…
Contrary to popular misconception, the question in the title is far from simple. It involves sets of numbers on the first level, sets of sets of numbers on the second level, and so on, endlessly. The infinite hierarchy of the levels…
In this paper we discuss three symbolic approaches for the generation of a finite difference scheme of a partial differential equation (PDE). We prove, that for a linear PDE with constant coefficients these three approaches are equivalent…
The schematic finite spaces are those finite ringed spaces where a theory of quasi-coherent modules can be developed with minimal natural conditions. We give various characterizations of these spaces and their natural morphisms. We show…
Numerical methods: mimetic finite differences and finite elements, are analyzed from a numerical point of view. It seeks to conclude on the efficiency, order of convergence and computational cost of these methods. The analysis is done in…
We study the question of whether a given regular language of finite trees can be defined in first-order logic. We develop an algebraic approach to address this question and we use it to derive several necessary and sufficient conditions for…
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…
Generalizations of linear numeration systems in which the set of natural numbers is recognizable by finite automata are obtained by describing an arbitrary infinite regular language following the lexicographic ordering. For these systems of…
By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…
Recent developments in termination analysis for declarative programs emphasize the use of appropriate models for the logical theory representing the program at stake as a generic approach to prove termination of declarative programs. In…
We define an abstract framework called {\it discrete finite differences embedding} which can be used to obtain discrete analogue of formal functional relations in the spirit of category theory. For ordinary differential equations we exhibit…
This is the first of a series of papers studying real algebraic threefolds using the minimal model program. The main results are outlined in Part II. The present part I. contains the necessary preliminary work concerning terminal…
It is shown that finite-index extensions and finite-index subgroups of $\omega$-stable groups can be model-theoretically wild. More precisely, there exists an $\omega$-stable group $G$ such that any given countable first-order structure in…
The ordered structures of natural, integer, rational and real numbers are studied in this thesis. The theories of these numbers in the language of order are decidable and finitely axiomatizable. Also, their theories in the language of order…
We count the number of occurrences of certain patterns in given words. We choose these words to be the set of all finite approximations of a sequence generated by a morphism with certain restrictions. The patterns in our considerations are…
We introduce a new class of "filtered" schemes for some first order non-linear Hamilton-Jacobi-Bellman equations. The work follows recent ideas of Froese and Oberman (SIAM J. Numer. Anal., Vol 51, pp.423-444, 2013). The proposed schemes are…