Related papers: Un Crit{\`E}Re Simple
We adapt a proof of Lascar in order to show the simplicity of the group of automorphisms fixing pointwise all non-generic elements for a class of uncountable models of suitable theories, encompassing both strongly minimal theories as well…
Simple type theory is formulated for use with the generic theorem prover Isabelle. This requires explicit type inference rules. There are function, product, and subset types, which may be empty. Descriptions (the eta-operator) introduce the…
We show that many nice properties of a theory $T$ follow from the corresponding properties of its reducts to finite subsignatures. If $\{ T_i \}_{i \in I}$ is a directed family of conservative expansions of first-order theories and each…
Promoting a theory with a finite number of terms into an effective field theory with an infinite number of terms worsens simplicity, predictability, falsifiability, and other attributes often favored in theory choice. However, the…
We show that an arbitrary algebra ${ A}$, (of arbitrary dimension, over an arbitrary base field and any identity is not suppose for the product), is semisimple if and only if it has zero annihilator and admits a semi-division linear basis.…
We generalize several recognizability theorems for free single-sorted algebras to the field of many-sorted algebras and provide, in a uniform way and without using neither regular tree grammars nor tree automata, purely algebraic proofs of…
A type analysable in one-based types in a simple theory is itself one-based.
A derived version of Maschke's theorem for finite groups is proved: the derived categories, bounded or unbounded, of all blocks of the group algebra of a finite group are simple, in the sense that they admit no nontrivial recollements. This…
Most of the assertions in the theory of well ordered sets are quite simple. However, one of its central statements, Zermelo's theorem, stands out of this rule, for its well-known proofs are rather complicated. The aim of the current paper…
A group is said to be C*-simple if its reduced C*-algebra is simple. We establish an intrinsic (group-theoretic) characterization of groups with this property. Specifically, we prove that a discrete group is C*-simple if and only if it has…
Groups definable in simple theories retain the chain conditions and decomposition properties known from stable groups, up to commensurability. In the small case, if a generic type of G is not foreign to some type q, there is a q-internal…
Let $K$ be a field of arbitrary characteristic, $\CA$ be a commutative $K$-algebra which is a domain of essentially finite type (eg, the algebra of functions on an irreducible affine algebraic variety), $\ga_r$ be its {\em Jacobian ideal},…
It is proved that any supersimple field has trivial Brauer group, and more generally that any supersimple division ring is commutative. As prerequisites we prove several results about generic types in groups and fields whose theory is…
Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…
A re-construction of the fundamentals of programming as a small mathematical theory (PRISM) based on elementary set theory. Highlights: $\bullet$ Zero axioms. No properties are assumed, all are proved (from standard set theory). $\bullet$ A…
Universality is one of the most important ideas in computability theory. There are various criteria of simplicity for universal Turing machines. Probably the most popular one is to count the number of states/symbols. This criterion is more…
A general simplicity problem in category theory is proposed. A particular example, the simplest choice of generators of an algebra is specified and illustrated by an example.
This paper investigates the conditions under which a given circular (synchronizing) DFA is \emph{simple} (sometimes referred to as \emph{primitive}) and when it is \emph{irreducible}. Our notion of irreducibility slightly differs from the…
Simple assumptions represent a decisive reason to prefer one theory to another in everyday scientific praxis. But this praxis has little philosophical justification, since there exist many notions of simplicity, and those that can be…
Justification theory is an abstract unifying formalism that captures semantics of various non-monotonic logics. One intriguing problem that has received significant attention is the consistency problem: under which conditions are…