Related papers: Truth values algebras and proof normalization
A complete first-order theory is equational if every definable set is a Boolean combination of instances of equations, that is, of formulae such that the family of finite intersections of instances has the descending chain condition.…
We describe a sufficient condition for the localization functor to be a categorical equivalence. Using this result we explain how to simplify the test for projectivity. This leads to a description of the strictly simple algebras which are…
We prove that in the varieties where every compact congruence is a factor congruence and every nontrivial algebra contains a minimal subalgebra, a finitely presented algebra is projective if and only if it has every minimal algebra as its…
A question is proposed whether or not set theory is consistent.
We consider the untyped lambda calculus with constructors and recursively defined constants. We construct a domain-theoretic model such that any term not denoting bottom is strongly normalising provided all its `stratified approximations'…
We establish axiomatic characterizations of $K$-theory and $KK$-theory for real C*-algebras. In particular, let $F$ be an abelian group-valued functor on separable real C*-algebras. We prove that if $F$ is homotopy invariant, stable, and…
Totally positive matrices are related with the shape preserving representations of a space of functions. The normalized B-basis of the space has optimal shape preserving properties. B-splines and rational Bernstein bases are examples of…
A system of quantum reasoning for a closed system is developed by treating non-relativistic quantum mechanics as a stochastic theory. The sample space corresponds to a decomposition, as a sum of orthogonal projectors, of the identity…
A major problem in the consistent-histories approach to quantum theory is contending with the potentially large number of consistent sets of history propositions. One possibility is to find a scheme in which a unique set is selected in some…
We give a self-contained treatment of the theory of persistence modules indexed over the real line. We give new proofs of the standard results. Persistence diagrams are constructed using measure theory. Linear algebra lemmas are simplified…
Two first-order logic theories are definitionally equivalent if and only if there is a bijection between their model classes that preserves isomorphisms and ultraproducts (Theorem 2). This is a variant of a prior theorem of van Benthem and…
In a finite dimensional Hilbert space, each normalized vector (state) can be chosen as a member of an orthonormal basis of the space. We give a proof of this statement in a manner that seems to be more comprehensible for physics students…
We assign a relational structure to any finite algebra in a canonical way, using solution sets of equations, and we prove that this relational structure is polymorphism-homogeneous if and only if the algebra itself is…
We prove normalization for MTT, a general multimodal dependent type theory capable of expressing modal type theories for guarded recursion, internalized parametricity, and various other prototypical modal situations. We prove that deciding…
What are the criteria that a measure of statistical evidence should satisfy? It is argued that a measure of evidence should be consistent. Consistency is an asymptotic criterion: the probability that if a measure of evidence in data…
To determine whether a number is congruent or not is an old and difficult topic and progress is slow. The paper presents a new theorem when a prime number is a congruent number or not. The proof is not necessarily any simpler or shorter…
For every algebraically closed field $\boldsymbol k$ of characteristic different from $2$, we prove the following: (1) Generic finite dimensional (not necessarily associative) $\boldsymbol k$-algebras of a fixed dimension, considered up to…
Given a normal matrix $A$ and an arbitrary square matrix $B$ (not necessarily of the same size), what relationships between $A$ and $B$, if any, guarantee that $B$ is also a normal matrix? We provide an answer to this question in terms of…
We prove that the $L_1$-norms associated with a positive element $a$ of a unital C*-algebra are equivalent to the norm of C*-algebra if and only if $a$ is invertible.
The Holant theorem is a powerful tool for studying the computational complexity of counting problems in the Holant framework. Due to the great expressiveness of the Holant framework, a converse to the Holant theorem would itself be a very…