Related papers: A first-order completeness result about characteri…
There are several ways to define program equivalence for functional programs with algebraic effects. We consider two complementing ways to specify behavioural equivalence. One way is to specify a set of axiomatic equations, and allow proof…
Results about the following classes of finite-dimensional Lie algebras over a field of characteristic zero are presented: anisotropic (i.e., Lie algebras for which each adjoint operator is semisimple), regular (i.e., Lie algebras in which…
In this dissertation we provide mathematical evidence that the concept of learning can be used to give a new and intuitive computational semantics of classical proofs in various fragments of Predicative Arithmetic. First, we extend Kreisel…
We compare some algebras appeared in the recent attempts to prove resolution of singularities in positive characteristic. We also construct an algebra which encodes the same information and it is equivalent, up to integral closure, to the…
We prove the result in the title. We infer, that unlike cylindric algebras, there is a first order axiomatization of the class of completely representable polyadic algebras of infinite dimension, though the one we obtain is infinite; in…
We obtain a necessary and sufficient condition for an algebraic set in a group to have a fully characteristic radical. As a result, we see that if the radical of a system of equation $S$ over a group $G$ is fully characteristic, then there…
One of the benefit properties implied by the extensionality axiom of Hilbert's epsilon calculus is that the calculus becomes complete with respect to the choice structures as semantics. Another implication of the axiom, discussed in the…
An early result in the theory of Natural Dualities is that an algebra with a near unanimity (NU) term is dualizable. A converse to this is also true: if V(A) is congruence distributive and A is dualizable, then A has an NU term. An…
Let f: Y -> CP^2 be a birational morphism of non-singular (rational) surfaces. We give an effective (necessary and sufficient) criterion for algebraicity of the surfaces resulting from contraction of the union of the strict transform of a…
In this short note we relate some known properties of propositional calculus to purely algebraic considerations of a Boolean algebra. Classes of formulas of propositional calculus are considered as elements of a Boolean algebra. As such…
We present news proofs of the additivity, resolution and cofinality theorems for the algebraic $K$-theory of exact categories. These proofs are entirely algebraic, based on Grayson's presentation of higher algebraic $K$-groups via binary…
Given a reflexive sheaf on a mildly singular projective variety, we prove a flatness criterion under certain stability conditions. This implies the algebraicity of leaves for sufficiently stable foliations with numerically trivial canonical…
Besides recalling the basic definitions of Realizability Lattices, Abstract Krivine Structures, Ordered Combinatory Algebras and Tripos and reviewing its relationships, we propose a new foundational framework for realizability. Motivated by…
The concept of determinism for a classical system is interpreted as the requirement that the solution to the Cauchy problem for the equations of motion governing this system be unique. This requirement is generally assumed to hold for all…
We show that the theory of De Morgan algebras has a model completion and axiomatise it. Then we prove that it is $\aleph_0$-categorical and describe definable and algebraic closures in that theory. We also obtain similar results for…
Runtime efficiency and termination are crucial properties in the studies of program verification. Instead of dealing with these issues in an ad hoc manner, it would be useful to develop a robust framework in which such properties are…
In this note we study associative dialgebras proving that the most interesting such structures arise precisely when the algebra is not semiprime. In fact the presence of some "perfection" property (simpleness, primitiveness, primeness or…
It is proved that any polynomial vector field in two complex variables which is complete on a non-algebraic trajectory is complete.
We study systems of $n \geq 1$ discrete differential equations of order $k\geq1$ in one catalytic variable and provide a constructive and elementary proof of algebraicity of their solutions. This yields effective bounds and a systematic…
We present a criterion that provides an easy sufficient condition in order that a collection of Abelian integrals has the Chebyshev property. This condition involves the functions in the integrand of the Abelian integrals and can be…