AbstractKripke's theorem on the embeddability of every Boolean algebra in a countably generated one is proved anew, supplemented by exact cardinality estimates and generalized to equational and other classes of partially ordered structures. Similar extensions of the Gaifman-Hales Theorem follow. The proofs use algebras of infinitary (L∞ω) formulas, and occasionally l évy's theorem on Σ1 formulas and the method of forcing
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean al...
A class of algebras has the finite embeddability property (FEP, for short) if every finite partial s...
We present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary ex...
AbstractKripke's theorem on the embeddability of every Boolean algebra in a countably generated one ...
We prove the following theorem. Theorem Let（Ｐ,≦）be an arbitrary partially ordered structure. Then, t...
AbstractIn 1970, K. Kunen, working in the context of Kelley–Morse set theory, showed that the existe...
Abstract. In 1970, K. Kunen, working in the context of Kelley-Morse set the-ory, showed that the exi...
Abstract. Given a Boolean algebra B and an embedding e: B → P(N) / fin we consider the possibility o...
Partial combinatory algebras are algebraic structures that serve as generalized models of computatio...
In this paper, we show that for each forcing notion P in a transitive model M of ZFC, if P satisfies...
We investigate the relation of countable closed linear orderings with respect to continuous monotone...
We present a systematic study of join-extensions and join-completions of ordered algebras, which na...
The Ordered conjecture of Kolaitis and Vardi asks whether fixed-point logic differs from first-order...
In their 1951-52 papers [8, 9], Jónsson and Tarski introduced the perfect extension of a Boolean al...
AbstractIt was proved few years ago that classes of Boolean functions definable by means of function...
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean al...
A class of algebras has the finite embeddability property (FEP, for short) if every finite partial s...
We present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary ex...
AbstractKripke's theorem on the embeddability of every Boolean algebra in a countably generated one ...
We prove the following theorem. Theorem Let（Ｐ,≦）be an arbitrary partially ordered structure. Then, t...
AbstractIn 1970, K. Kunen, working in the context of Kelley–Morse set theory, showed that the existe...
Abstract. In 1970, K. Kunen, working in the context of Kelley-Morse set the-ory, showed that the exi...
Abstract. Given a Boolean algebra B and an embedding e: B → P(N) / fin we consider the possibility o...
Partial combinatory algebras are algebraic structures that serve as generalized models of computatio...
In this paper, we show that for each forcing notion P in a transitive model M of ZFC, if P satisfies...
We investigate the relation of countable closed linear orderings with respect to continuous monotone...
We present a systematic study of join-extensions and join-completions of ordered algebras, which na...
The Ordered conjecture of Kolaitis and Vardi asks whether fixed-point logic differs from first-order...
In their 1951-52 papers [8, 9], Jónsson and Tarski introduced the perfect extension of a Boolean al...
AbstractIt was proved few years ago that classes of Boolean functions definable by means of function...
We give a unified treatment of the model theory of various enrichments of infinite atomic Boolean al...
A class of algebras has the finite embeddability property (FEP, for short) if every finite partial s...
We present a technique to extend a Kripke structure (for intuitionistic logic) into an elementary ex...
DOI
Add to ORKG