Bare canonicity of representable cylindric and polyadic algebras (Q387126): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
A first order sentence is canonical if the class of its models, restricting it to Boolean algebras with operators, is canonical, i.e., the class is closed under taking canonical extension (e.g., Sahlqvist equations are canonical). The authors show that certain classes (representable \(n\)-dimensional cylindric algebras, \(n>2\), polyadic algebras, etc.) have no axiomatization consisting of canonical sentences only, i.e., there is no canonical axiomatization. Moreover, any axiomatization of these classes contains an infinite number of non-canonical formulas; such classes are said to be barely canonical. | |||
Property / review text: A first order sentence is canonical if the class of its models, restricting it to Boolean algebras with operators, is canonical, i.e., the class is closed under taking canonical extension (e.g., Sahlqvist equations are canonical). The authors show that certain classes (representable \(n\)-dimensional cylindric algebras, \(n>2\), polyadic algebras, etc.) have no axiomatization consisting of canonical sentences only, i.e., there is no canonical axiomatization. Moreover, any axiomatization of these classes contains an infinite number of non-canonical formulas; such classes are said to be barely canonical. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Miklós Ferenczi / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03G15 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03G27 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03C05 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 06E25 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 05C90 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6237520 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
Boolean algebras with operators | |||
Property / zbMATH Keywords: Boolean algebras with operators / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
canonical extensions | |||
Property / zbMATH Keywords: canonical extensions / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
canonical class | |||
Property / zbMATH Keywords: canonical class / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
cylindric algebras | |||
Property / zbMATH Keywords: cylindric algebras / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
polyadic algebras | |||
Property / zbMATH Keywords: polyadic algebras / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
random graphs | |||
Property / zbMATH Keywords: random graphs / rank | |||
Normal rank |
Revision as of 13:09, 29 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Bare canonicity of representable cylindric and polyadic algebras |
scientific article |
Statements
Bare canonicity of representable cylindric and polyadic algebras (English)
0 references
11 December 2013
0 references
A first order sentence is canonical if the class of its models, restricting it to Boolean algebras with operators, is canonical, i.e., the class is closed under taking canonical extension (e.g., Sahlqvist equations are canonical). The authors show that certain classes (representable \(n\)-dimensional cylindric algebras, \(n>2\), polyadic algebras, etc.) have no axiomatization consisting of canonical sentences only, i.e., there is no canonical axiomatization. Moreover, any axiomatization of these classes contains an infinite number of non-canonical formulas; such classes are said to be barely canonical.
0 references
Boolean algebras with operators
0 references
canonical extensions
0 references
canonical class
0 references
cylindric algebras
0 references
polyadic algebras
0 references
random graphs
0 references