THE LINDENBAUM ALGEBRA OF THE THEORY OF THE CLASS OF ALL FINITE MODELS

In this paper, we investigate the Lindenbaum algebra ℒ(T fin ) of the theory T fin = Th (M fin ) of the class M fin of all finite models of a finite rich signature. We prove that this algebra is an atomic Boolean algebra while its Gödel numeration γ is a [Formula: see text]-numeration. Moreover, the quotient algebra (ℒ(T fin )/ℱ, γ/ℱ) modulo the Fréchet ideal ℱ is a [Formula: see text]-algebra, which is universal over the class of all [Formula: see text] Boolean algebras. These conditions characterize uniquely the algebra ℒ(T fin ); moreover, these conditions characterize up to recursive isomorphism the numerated Boolean quotient algebra (ℒ(T fin )/ℱ, γ/ℱ). These results extend the work of Trakhtenbrot [17] and Vaught [18] on the first order theory of the class of all finite models of a finite rich signature.

Download Full-text

On the elementary equivalence of automorphism groups of Boolean algebras; downward Skolem Löwenheim theorems and compactness of related quantifiers

Journal of Symbolic Logic ◽

10.2307/2273187 ◽

1980 ◽

Vol 45 (2) ◽

pp. 265-283 ◽

Cited By ~ 7

Author(s):

Matatyahu Rubin ◽

Saharon Shelah

Keyword(s):

Boolean Algebra ◽

Automorphism Groups ◽

Order Logic ◽

Boolean Algebras ◽

First Order Logic ◽

Elementary Equivalence ◽

First Order ◽

Finite Models ◽

Countably Compact

AbstractTheorem 1. (◊ℵ1,) If B is an infinite Boolean algebra (BA), then there is B1, such that ∣ Aut (B1) ≤∣B1∣ = ℵ1 and 〈B1, Aut (B1)〉 ≡ 〈B, Aut(B)〉.Theorem 2. (◊ℵ1) There is a countably compact logic stronger than first-order logic even on finite models.This partially answers a question of H. Friedman. These theorems appear in §§1 and 2.Theorem 3. (a) (◊ℵ1) If B is an atomic ℵ-saturated infinite BA, Ψ Є Lω1ω and 〈B, Aut (B)〉 ⊨Ψ then there is B1, Such that ∣Aut(B1)∣ ≤ ∣B1∣ =ℵ1, and 〈B1, Aut(B1)〉⊨Ψ. In particular if B is 1-homogeneous so is B1. (b) (a) holds for B = P(ω) even if we assume only CH.

Download Full-text

On decidable varieties of Heyting algebras

Journal of Symbolic Logic ◽

10.2307/2275444 ◽

1992 ◽

Vol 57 (3) ◽

pp. 988-991 ◽

Cited By ~ 5

Author(s):

Devdatt P. Dubhashi

Keyword(s):

Order Theory ◽

Boolean Algebras ◽

Semantic Interpretation ◽

Structure Theory ◽

Heyting Algebras ◽

Quantitative Classification ◽

First Order ◽

First Order Theory ◽

Famous Result

In this paper we present a new proof of a decidability result for the firstorder theories of certain subvarieties of Heyting algebras. By a famous result of Grzegorczyk, the full first-order theory of Heyting algebras is undecidable. In contrast, the first-order theory of Boolean algebras and of many interesting subvarieties of Boolean algebras is decidable by a result of Tarski [8]. In fact, Kozen [6] gives a comprehensive quantitative classification of the complexities of the first-order theories of various subclasses of Boolean algebras (including the full variety).This stark contrast may be reconciled from the standpoint of universal algebra as arising out of the byplay between structure and decidability: A good structure theory entails positive decidability results. Boolean algebras have a well-developed structure theory [5], while the corresponding theory for Heyting algebras is quite meagre. Viewed in this way, we may hope to obtain decidability results if we focus attention on subclasses of Heyting algebras with good structural properties.K. Idziak and P. M. Idziak [4] have considered an interesting subvariety of Heyting algebras, , which is the variety generated by all linearly-ordered Heyting algebras. This variety is shown to be the largest subvariety of Heyting algebras with a decidable theory of its finite members. However their proof is rather indirect, proceeding via semantic interpretation into the monadic second order theory of trees. The latter is a powerful theory—it interprets many other theories—but is computationally highly infeasible. In fact, by a celebrated theorem of Rabin, its complexity is not bounded by any elementary recursive function. Consequently, the proof of [4], besides being indirect, also gives no information on the quantitative computational complexity of the theory of .Here we pursue the theme of structure and decidability. We isolate the indecomposable algebras in and use this to prove a theorem on the structure of if -algebras. This theorem relates the -algebras structurally to Boolean algebras. This enables us to bootstrap the known decidability results for Boolean algebras to the variety if .

Download Full-text

The first order theory of Boolean algebras with a distinguished group of automorphisms

Algebra Universalis ◽

10.1007/bf02483719 ◽

1982 ◽

Vol 15 (1) ◽

pp. 156-161 ◽

Cited By ~ 6

Author(s):

Stanley Burris

Keyword(s):

Order Theory ◽

Boolean Algebras ◽

Group Of Automorphisms ◽

First Order ◽

First Order Theory ◽

Distinguished Group

Download Full-text

Analysis without actual infinity

Journal of Symbolic Logic ◽

10.2307/2273760 ◽

1981 ◽

Vol 46 (3) ◽

pp. 625-633 ◽

Cited By ~ 20

Author(s):

Jan Mycielski

Keyword(s):

Natural Science ◽

Order Theory ◽

Finite Part ◽

Consistency Proof ◽

Actual Infinity ◽

First Order ◽

Finite Models ◽

First Order Theory ◽

Potential Applications

AbstractWe define a first-order theory FIN which has a recursive axiomatization and has the following two properties. Each finite part of FIN has finite models. FIN is strong enough to develop that part of mathematics which is used or has potential applications in natural science. This work can also be regarded as a consistency proof of this hitherto informal part of mathematics. In FIN one can count every set; this permits one to prove some new probabilistic theorems.

Download Full-text

A remark on Martin's Conjecture

Journal of Symbolic Logic ◽

10.2307/2694929 ◽

2001 ◽

Vol 66 (1) ◽

pp. 401-406

Author(s):

Su Gao

Keyword(s):

Order Theory ◽

Boolean Algebras ◽

First Order ◽

First Order Theory ◽

Elementary Theories

AbstractWe prove that the strong Martin conjecture is false. The counterexample is the first-order theory of infinite atomic Boolean algebras. We show that for this class of Boolean algebras, the classification of their (ω + ω)-elementary theories can be reduced to the classification of the elementary theories of their quotient algrbras modulo the Frechét ideals.

Download Full-text

An Example of a Complete First-Order Theory with All Models Algorithmically Trivial but Without Locally Finite Models

Fundamenta Informaticae ◽

10.3233/fi-1982-53-406 ◽

1982 ◽

Vol 5 (3-4) ◽

pp. 313-318

Author(s):

Paweł Urzyczyn

Keyword(s):

Order Theory ◽

Complete Theory ◽

Prime Model ◽

Program Schema ◽

Locally Finite ◽

First Order ◽

Finite Models ◽

First Order Theory

We show an example of a first-order complete theory T, with no locally finite models and such that every program schema, total over a model of T, is strongly equivalent in that model to a loop-free schema. For this purpose we consider the notion of an algorithmically prime model, what enables us to formulate an analogue to Ryll-Nardzewski Theorem.

Download Full-text

Quantifier-Elimination for the First-Order Theory of Boolean Algebras with Linear Cardinality Constraints

Advances in Databases and Information Systems - Lecture Notes in Computer Science ◽

10.1007/978-3-540-30204-9_1 ◽

2004 ◽

pp. 1-21 ◽

Cited By ~ 6

Author(s):

Peter Revesz

Keyword(s):

Quantifier Elimination ◽

Order Theory ◽

Boolean Algebras ◽

Cardinality Constraints ◽

First Order ◽

First Order Theory

Download Full-text

A decidable variety that is finitely undecidable

Journal of Symbolic Logic ◽

10.2307/2586491 ◽

1999 ◽

Vol 64 (2) ◽

pp. 651-677

Author(s):

Joohee Jeong

Keyword(s):

Finite Type ◽

Order Theory ◽

First Order ◽

Finite Models ◽

First Order Theory

AbstractWe construct a decidable first-order theory T such that the theory of its finite models is undecidable. Moreover, T will be equationally axiomatizable and of finite type.

Download Full-text