Related papers: Un Crit{\`E}Re Simple
We present a soundness theorem for a dependent type theory with context constants with respect to an indexed category of (finite, abstract) simplical complexes. The point of interest for computer science is that this category can be seen to…
We propose a framework for model-theoretic stability and simplicity in an approximate first-order setting and generalize some classical results.
Many proofs of the Fundamental Theorem of Algebra, including various proofs based on the theory of analytic functions of a complex variable, are known. To the best of our knowledge, this proof is different from the existing ones.
A countable group is C*-simple if its reduced C*-algebra is simple. It is well known that C*-simplicity implies that the amenable radical of the group must be trivial. We show that the converse does not hold by constructing explicit…
In this note we give a numerical criterion that expresses the condition that an abelian variety be simple in terms of an invariant that is closely related to the s-invariant of Ein-Cutkosky-Lazarsfeld. The criterion yields new examples…
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 study the implications of model completeness of a theory for the effectiveness of presentations of models of that theory. It is immediate that for a computable model $\mathcal A$ of a computably enumerable, model complete theory, the…
Regular groups and fields are common generalizations of minimal and quasi-minimal groups and fields, so the conjectures that minimal or quasi-minimal fields are algebraically closed have their common generalization to the conjecture that…
Safe first-order formulas generalize the concept of a safe rule, which plays an important role in the design of answer set solvers. We show that any safe sentence is equivalent, in a certain sense, to the result of its grounding -- to the…
We define a sound and complete proof system for affine beta-eta-retractions in simple types built over many atoms, and we state simple necessary conditions for arbitrary beta-eta-retractions in simple and polymorphic types.
The idea of this approach towards proving the consistency of Quine's New Foundations set theory is to go in a completely untyped manner. So no contemplation about types is utilized here. All conceptualization pivots around proving a handful…
Adapting a proof of Bouscaren and Delon, we show that every type-definable connected group in a given stable theory of fields embeds into an algebraic group, under a condition on the definable closure. We also present general hypotheses…
We illustrate the use of intersection types as a semantic tool for showing properties of the lattice of lambda theories. Relying on the notion of easy intersection type theory we successfully build a filter model in which the interpretation…
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 prove that the group $\mathrm{SAut}_{\mathrm{k}}(\mathbb{A}^2)$ is simple as an algebraic group of infinite dimension, over any infinite field $\mathrm{k}$, by proving that any closed normal subgroup is either trivial or the whole group.…
In the context of continuous first-order logic, special attention is often given to theories that are somehow continuous in an 'essential' way. A common feature of such theories is that they do not interpret any infinite discrete…
We give an elementary proof of the theorem which states that a finite unramified algebra over a discrete field is tracically \'etale. -- Nous donnons une d\'emonstration \'el\'ementaire du th\'eor\`eme selon lequel toute alg\`ebre nette sur…
Let $R$ be a finite-dimensional algebra over an algebraically closed field $F$ graded by an arbitrary group $G$. We prove that $R$ is a graded division algebra if and only if it is isomorphic to a twisted group algebra of some finite…
Axiomatic set theory is almost universally accepted as the basic theory which provides the foundations of mathematics, and in which the whole of present day mathematics can be developed. As such, it is the most natural framework for…
We introduce the notion of confined subalgebras in the context of the group von Neumann algebra. We also define Uniformly Recurrent States -- an operator-algebraic analog of Uniformly Recurrent Subgroups. Using this framework, we show that…