Countable Boolean algebras and decidability /
Saved in:
Author / Creator: | Goncharov, S. S. |
---|---|
Uniform title: | Schetnye bulevy algebry. English |
Imprint: | New York : Consultants Bureau, c1997. |
Description: | xii, 318 p. : ill. ; 24 cm. |
Language: | English |
Series: | Siberian school of algebra and logic Sibirskai͡a shkola algebry i logiki. English. |
Subject: | |
Format: | Print Book |
URL for this record: | http://pi.lib.uchicago.edu/1001/cat/bib/2619007 |
MARC
LEADER | 00000cam a2200000 a 4500 | ||
---|---|---|---|
001 | 2619007 | ||
003 | ICU | ||
005 | 20030523134400.0 | ||
008 | 970116s1997 nyua b 001 0 eng | ||
010 | |a 97002153 | ||
020 | |a 030611061X | ||
035 | |a (NhCcYBP)YBT 97002153 | ||
035 | |a (NhCcYBP)YBP97113101612 | ||
040 | |a DLC |c DLC |d DLC |d OrLoB-B |d OCoLC | ||
041 | 1 | |a eng |h rus | |
050 | 0 | 0 | |a QA10.3 |b .G6613 1997 |
082 | 0 | 0 | |a 511.3/24 |2 21 |
100 | 1 | |a Goncharov, S. S. |0 http://id.loc.gov/authorities/names/n87854790 |1 http://viaf.org/viaf/3996520 | |
240 | 1 | 0 | |a Schetnye bulevy algebry. |l English |
245 | 1 | 0 | |a Countable Boolean algebras and decidability / |c Sergei S. Goncharov. |
260 | |a New York : |b Consultants Bureau, |c c1997. | ||
300 | |a xii, 318 p. : |b ill. ; |c 24 cm. | ||
336 | |a text |b txt |2 rdacontent |0 http://id.loc.gov/vocabulary/contentTypes/txt | ||
337 | |a unmediated |b n |2 rdamedia |0 http://id.loc.gov/vocabulary/mediaTypes/n | ||
338 | |a volume |b nc |2 rdacarrier |0 http://id.loc.gov/vocabulary/carriers/nc | ||
490 | 1 | |a Siberian school of algebra and logic | |
504 | |a Includes bibliographical references (p. 303-313) and index. | ||
505 | 0 | 0 | |g Ch. 1. |t Algebraic Properties of Boolean Algebras. |g 1.1. |t Algebraic Systems and Constructions. |g 1.2. |t Definitions and the Simplest Properties of Boolean Algebras. |g 1.3. |t Ideals and Quotient Algebras of Boolean Algebras. |g 1.4. |t The Stone Theorem on Representations of Boolean Algebras. |g 1.5. |t The Vaught Criterion. |g 1.6. |t Linearly Ordered Generating Sets. |g 1.7. |t Generating Trees. |g 1.8. |t Ershov Algebras and The Isomorphism Problem -- |g Ch. 2. |t Elementary Classifications of Boolean Algebras. |g 2.1. |t Basic Notions and Methods of Model Theory. |g 2.2. |t Definable Ershov-Tarski Ideals and Elementary Characteristics of Boolean Algebras. |g 2.3. |t Countably Saturated Boolean Algebras and Elementary Classification. |g 2.4. |t Model-Complete Theories of Boolean Algebras. |g 2.5. |t Consistent Complete Theories of Boolean Algebras. |g 2.6. |t Restricted Theories of Boolean Algebras -- |g Ch. 3. |t Constructive Boolean Algebras. |g 3.1. |t Basic Notions of the Theory of Algorithms and Constructive Models. |g 3.2. |t Constructibility in Linear Orders and Boolean Algebras. |g 3.3. |t Trees Generating Constructive Boolean Algebras. |g 3.4. |t Decidable Boolean Algebras. |g 3.5. |t Restricted Fragments of the Theory of Boolean Algebras and Decidable Algebras. |g 3.6. |t Algorithmic Dimension of Boolean Algebras. |g 3.7. |t Algorithmic Properties of Subalgebras and Quotient Algebras of Constructive Boolean Algebras. |g 3.8. |t Automorphisms of Countable Boolean Algebras. |
650 | 0 | |a Algebra, Boolean. |0 http://id.loc.gov/authorities/subjects/sh85003429 | |
650 | 0 | |a Decidability (Mathematical logic) |0 http://id.loc.gov/authorities/subjects/sh85036191 | |
650 | 7 | |a Algebra, Boolean. |2 fast |0 http://id.worldcat.org/fast/fst00804924 | |
650 | 7 | |a Decidability (Mathematical logic) |2 fast |0 http://id.worldcat.org/fast/fst00888990 | |
830 | 0 | |a Sibirskai͡a shkola algebry i logiki. |l English. | |
901 | |a ToCBNA | ||
903 | |a HeVa | ||
035 | |a (OCoLC)36292849 | ||
929 | |a cat | ||
999 | f | f | |i 14398c7c-8e97-5fbf-82b1-c0773f58d06b |s 4e6e873d-cd25-5c07-9597-1f2518df3eea |
928 | |t Library of Congress classification |a QA10.3 .G6613 1997 |l Eck |c Eck-Eck |i 6063064 | ||
927 | |t Library of Congress classification |a QA10.3 .G6613 1997 |l Eck |c Eck-Eck |b 44812613 |i 4812422 |