Related papers: Birkhoff's Completeness Theorem for Multi-Sorted A…
A weak version of Birkhoff's generalization of the Perron-Frobenius theorem states that every endomorphism of a finite-dimensional real vector that leaves invariant a non-degenerate closed convex cone has an eigenvector in that cone. Here,…
Let K be an algebraically bounded structure and T be its theory. If T is model complete, then the theory of K endowed with a derivation, denoted by $T^{\delta}$, has a model completion. Additionally, we prove that if the theory T is…
We show that for almost every map in a transversal one-parameter family of piecewise expanding unimodal maps the Birkhoff sum of suitable observables along the forward orbit of the turning point satisfies the law of iterated logarithm. This…
We show that the common theory of all modules over a tubular algebra (over a recursive algebraically closed field) is decidable. This result supports a long standing conjecture of Mike Prest which says that a finite-dimensional algebra…
We study a family of affine varieties arising from a version of an old problem due to Birkhoff asking for the classification of embeddings of finite abelian p-groups. We show that all of these varieties are irreducible and have a dense…
Although it is important both in theory as well as in applications, a theory of Birkhoff interpolation with main emphasis on the shape of the set of nodes is still missing. Although we will consider various shapes (e.g. we find all the…
The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…
We formalise the well-known rules of partial differentiation in a version of equational logic with function variables and binding constructs. We prove the resulting theory is complete with respect to polynomial interpretations. The proof…
We show that any analytically integrable Hamiltonian system near an equilibrium point admits a convergent Birkhoff normalization. The proof is based on a new, geometric approach to the problem.
Given an algebra $\mathbf{A}$, and terms $s(x_{1},x_{2},\dots x_{k})$ and $t(x_{1},x_{2},\dots x_{k})$ of the language of ${\mathbf A}$, we say that $s$ and $t$ are {\em separated} in ${\mathbf A}$ iff for all $a_{1},a_{2}\dots a_{k}\in A$,…
The definitional equality of an intensional type theory is its test of type compatibility. Today's systems rely on ordinary evaluation semantics to compare expressions in types, frustrating users with type errors arising when evaluation…
We prove theorems of the following form: if $A\subseteq {\mathbb R}^2$ is a big set, then there exists a big set $P\subseteq {\mathbb R}$ and a perfect set $Q\subseteq {\mathbb R}$ such that $P\times Q\subseteq A$. We discuss cases where…
In this paper, we prove a version of the typed B\"ohm theorem on the linear lambda calculus, which says, for any given types A and B, when two different closed terms s1 and s2 of A and any closed terms u1 and u2 of B are given, there is a…
G{\"o}del's completeness theorem for classical first-order logic is one of the most basic theorems of logic. Central to any foundational course in logic, it connects the notion of valid formula to the notion of provable formula.We survey a…
In 1978, Schaefer proved his famous dichotomy theorem for generalized satisfiability problems. He defined an infinite number of propositional satisfiability problems, showed that all these problems are either in P or NP-complete, and gave a…
We first present a modern simple proof of the classical ergodic Birkhoff's theorem and Bourgain's homogeneous bilinear ergodic theorem. This proof used the simple fact that the shift map on integers has a simple Lebesgue spectrum. As a…
We present a version of arithmetic in all finite types which allows for a definition of equality at higher types for which all congruence are derivable, for which the soundness of the Dialectica interpretation is provable inside the system…
We present algebraic semantics for the classical logic of proofs based on Boolean algebras. We also extend the language of the logic of proofs in order to have a Boolean structure on justification terms and equality predicate on terms. In…
We prove almost sure ergodic theorems for a class of systems called quasistatic dynamical systems. These results are needed, because the usual theorem due to Birkhoff does not apply in the absence of invariant measures. We also introduce…
We develop some basic results about full amalgamation classes with intrinsic trascendentals. These classes have generics whose models may have finite subsets whose intrinsic closure is not contained in its algebraic closure. We will show…