Add to ORKGA 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. Equationality is a strengthening of stability. In this short note, we prove that theory of proper extension of algebraically closed fields of some fixed characteristic is equational
Roughly speaking, an equational problem is a first order formula whose only predicatesymbol is =. We...
Abstract. Birkhoff (quasi-)variety categorical axiomatizability results have fascinated many scienti...
AbstractWe propose a set of transformation rules for first order formulae whose atoms are either equ...
A complete first-order theory is equational if every definable set is a Boolean combination of insta...
Summary. Equational theories of an algebra, i.e. the equivalence relation closed under translations ...
Abstract. Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-t...
We prove the following completeness theorem: If the fixed point operation over a category is defined...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
In any recursive algebraic language, I find an interval of the lattice of equational theories, every...
International audienceWe give a general method for producing various effective Null and Positivstell...
summary:We find several large classes of equations with the property that every automorphism of the ...
This thesis assembles some new results in the field arithmetic of various classes of fields, includi...
We give a general method for producing various effective Null and Positivstellensätze, and getting n...
In the literature, there are two ways to show that the equational theory of relations over a given s...
AbstractWe introduce a necessary and sufficient condition for the ω-extensionality rule of higher-or...
Roughly speaking, an equational problem is a first order formula whose only predicatesymbol is =. We...
Abstract. Birkhoff (quasi-)variety categorical axiomatizability results have fascinated many scienti...
AbstractWe propose a set of transformation rules for first order formulae whose atoms are either equ...
A complete first-order theory is equational if every definable set is a Boolean combination of insta...
Summary. Equational theories of an algebra, i.e. the equivalence relation closed under translations ...
Abstract. Birkhoff’s completeness theorem of equational logic asserts the coincidence of the model-t...
We prove the following completeness theorem: If the fixed point operation over a category is defined...
AbstractWe prove the following completeness theorem: If the fixed point operation over a category is...
In any recursive algebraic language, I find an interval of the lattice of equational theories, every...
International audienceWe give a general method for producing various effective Null and Positivstell...
summary:We find several large classes of equations with the property that every automorphism of the ...
This thesis assembles some new results in the field arithmetic of various classes of fields, includi...
We give a general method for producing various effective Null and Positivstellensätze, and getting n...
In the literature, there are two ways to show that the equational theory of relations over a given s...
AbstractWe introduce a necessary and sufficient condition for the ω-extensionality rule of higher-or...
Roughly speaking, an equational problem is a first order formula whose only predicatesymbol is =. We...
Abstract. Birkhoff (quasi-)variety categorical axiomatizability results have fascinated many scienti...
AbstractWe propose a set of transformation rules for first order formulae whose atoms are either equ...