-categoricity of products of 1-unary algebras
-Boolean spectrum, and stability
Si dimostra che la conoscenza delle algebre di Boole dei definibili di modelli di cardinità di una teoria elementare è sufficiente per decidere il suo tipo di stabilità.
-категоричные коммутативные кольца
-embedding, Amalgamation and -elementary equivalence
Ogni logica genera canonicamente la -equivalenza e la -immersione proprio come la logica del primo ordine genera l’equivalenza elementare e l’immersione elementare . Astraendo da , è interessante studiare in sè relazioni d’equivalenza e di immersione generali tra strutture. Mostriamo che esiste una corrispondenza biunivoca tra relazioni d’equivalenza con la proprietà di Robinson e relazioni d’immersione con la proprietà di Amalgamazione Forte (). Caratterizziamo algebricamente quelle...
-groups and pseudo-bad groups.
-model and distributivity in Boolean algebras
-theories of Boolean algebras
-Spaces and injective locally convex spaces [Book]
-purity and orthogonality.
-свободные группы.
A characterization of expandability of models for ZF to models for KM
A characterization of Ext(G,ℤ) assuming (V = L)
We complete the characterization of Ext(G,ℤ) for any torsion-free abelian group G assuming Gödel’s axiom of constructibility plus there is no weakly compact cardinal. In particular, we prove in (V = L) that, for a singular cardinal ν of uncountable cofinality which is less than the first weakly compact cardinal and for every sequence of cardinals satisfying (where Π is the set of all primes), there is a torsion-free abelian group G of size ν such that equals the p-rank of Ext(G,ℤ) for every...
A characterization of quasivarieties of partial algebras by means of limits and products.
A Completenes Theorem for an Infinitary Intutionistic Logic With Both Ordinary and Probability Quantifiers
A completeness theorem in the modal logic of programs
A Completness Theorem For One Class Of The Propositional Calculi
A decidable -categorical theory with a non-recursive Ryll-Nardzewski function
A decomposability criterion for elementary theories.
A decomposition of a set definable in an o-minimal structure into perfectly situated sets
A definable subset of a Euclidean space X is called perfectly situated if it can be represented in some linear system of coordinates as a finite union of (graphs of) definable 𝓒¹-maps with bounded derivatives. Two subsets of X are called simply separated if they satisfy the Łojasiewicz inequality with exponent 1. We show that every closed definable subset of X of dimension k can be decomposed into a finite family of closed definable subsets each of which is perfectly situated and such that any...
A deductive calculus for conditional equational systems with built-in predicates as premises.