We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean algebras, with special attention to quantifier-eliminations, complete axiomatizations and decidability. A classical example is the enrichment by a predicate for the ideal of finite sets, and a novel one involves predicates giving congruence conditions on the cardinality of finite sets. We focus on three examples, and classify them by expressive power
AbstractWe describe computably categorical Boolean algebras whose language is enriched by one-place ...
A Boolean algebra is a structure which behaves very much like first order propositional logic. In th...
We establish several first- or second-order properties of models of first-order theories by consider...
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean al...
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean al...
AbstractWe describe computably categorical Boolean algebras whose language is enriched by one-place ...
This article consists of two parts.First,we study boolean algebras.Boolean algebras are famous mat...
International audienceWe prove the following completeness result about classical realizability: give...
International audienceWe prove the following completeness result about classical realizability: give...
The investigation of theoretical-model properties of Boolean algebras with indicated ideals: simple,...
This bachelor thesis is dealing with complete Boolean algebras and its use in semantics of first-ord...
We are interested in applying constructive methods in (classical and intuitionistic) model theory. W...
It is shown how axiomatic specifications of Boolean Algebras with extra functions as well as proposi...
A typical (nontrivial) first order theory is undecidable. According to an early result of Tarski [15...
We prove the following completeness result about classical realizability: given any Boolean algebra ...
AbstractWe describe computably categorical Boolean algebras whose language is enriched by one-place ...
A Boolean algebra is a structure which behaves very much like first order propositional logic. In th...
We establish several first- or second-order properties of models of first-order theories by consider...
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean al...
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean al...
AbstractWe describe computably categorical Boolean algebras whose language is enriched by one-place ...
This article consists of two parts.First,we study boolean algebras.Boolean algebras are famous mat...
International audienceWe prove the following completeness result about classical realizability: give...
International audienceWe prove the following completeness result about classical realizability: give...
The investigation of theoretical-model properties of Boolean algebras with indicated ideals: simple,...
This bachelor thesis is dealing with complete Boolean algebras and its use in semantics of first-ord...
We are interested in applying constructive methods in (classical and intuitionistic) model theory. W...
It is shown how axiomatic specifications of Boolean Algebras with extra functions as well as proposi...
A typical (nontrivial) first order theory is undecidable. According to an early result of Tarski [15...
We prove the following completeness result about classical realizability: given any Boolean algebra ...
AbstractWe describe computably categorical Boolean algebras whose language is enriched by one-place ...
A Boolean algebra is a structure which behaves very much like first order propositional logic. In th...
We establish several first- or second-order properties of models of first-order theories by consider...