Related papers: Quantifier-free induction for lists
We extend the model-free Data-Driven computing paradigm to solids and structures that are stochastic due to intrinsic randomness in the material behavior. The behavior of such materials is characterized by a likelihood measure instead of a…
Bi-intuitionistic logic is the extension of intuitionistic logic with a connective dual to implication. Bi-intuitionistic logic was introduced by Rauszer as a Hilbert calculus with algebraic and Kripke semantics. But her subsequent…
We give a sufficient condition for a model theoretic structure $B$ to 'inherit' quantifier elimination from another structure $A$. This yields an alternative proof of one of the main result from \cite{kle}, namely quantifier elimination for…
For a family of unital free *-algebras with a family of states on them, we construct a sequence of noncommutative probability spaces, which are tensor product algebras with tensor product states and which approximate the free product of…
Let G be a connected reductive group defined over a finite field F_q and let L be the Levi subgroup (defined over F_q) of a parabolic subgroup P of G. We define a linear map from class functions on L(F_q) to class functions on G(F_q). This…
We propose to consider non confluence with respect to implicit complexity. We come back to some well known classes of first-order functional program, for which we have a characterization of their intentional properties, namely the class of…
We study the quotient Q_i(A) of a free algebra A by the ideal M_i(A) generated by relation that the i-th commutator of any elements is zero. In particular, we completely describe such quotient for i=4 (for i<=3 this was done previously by…
Cut-elimination is the bedrock of proof theory. It is the algorithm that eliminates cuts from a sequent calculus proof that leads to cut-free calculi and applications. Cut-elimination applies to many logics irrespective of their semantics.…
Let $D$ be a non-empty effective divisor on $\mathbb{P}^1$. We show that when ordered by height, any set of $(D,S)$-integral points on $\mathbb{P}^1$ of bounded degree has relative density zero. We then apply this to arithmetic dynamics:…
Quantified formulas pose a significant challenge for Satisfiability Modulo Theories (SMT) solvers due to their inherent undecidability. Existing instantiation techniques, such as e-matching, syntax-guided, model-based, conflict-based, and…
A combination of program algebra with the theory of meadows is designed leading to a theory of computation in algebraic structures which use in addition to a zero test and copying instructions the instruction set $\{x \Leftarrow 0, x…
Let $K$ be a field and $F$ a free group. By a classical result of Cohn and Lewin, the free group algebra $K\left[F\right]$ is a free ideal ring (FIR): a ring over which the submodules of free modules are themselves free, and of a…
Multiple imputation (MI) inference handles missing data by imputing the missing values $m$ times, and then combining the results from the $m$ complete-data analyses. However, the existing method for combining likelihood ratio tests (LRTs)…
In this paper, we compare $(n,m)$-purities for different pairs of positive integers $(n,m)$. When $R$ is a commutative ring, these purities are not equivalent if $R$ doesn't satisfy the following property: there exists a positive integer…
We provide counterexamples to P. Olver's freeness conjecture for $C^\infty$ actions. In fact, we show that a counterexample exists for any connected real Lie group with noncompact center, as well as for the additive group of the integers.
We study induction on the program structure as a proof method for bisimulation-based compiler correctness. We consider a first-order language with mutually recursive function definitions, system calls, and an environment semantics. The…
Suppose we are given a graph and want to show a property for all its cycles (closed chains). Induction on the length of cycles does not work since sub-chains of a cycle are not necessarily closed. This paper derives a principle reminiscent…
In this article, we consider for the first time the operations of insertion and deletion working in a matrix controlled manner. We show that, similarly as in the case of context-free productions, the computational power is strictly…
In the recent paper A. Dimca proves that when one adds to or deletes a line from a free curve the resulting curve is either free or plus-one generated. We prove the converse statements, we give an additional insight into the original…
We present a first-order theorem proving framework for establishing the correctness of functional programs implementing sorting algorithms with recursive data structures. We formalize the semantics of recursive programs in many-sorted…