Three characterizing numbers of partition logics
From MaRDI portal
Partition logics are a family of newly proposed extended logics. They possess quite strong expressibility as well as rather good model-theoretic features. The background of introducing partition quantifiers is mathematical; however, they have found themselves in applications to computer science. We further study in the framework of model-theoretic logics some fundamental properties, such as the well-ordering number, Hanf number and Löwenheim number, of their representatives: \(L(P^{1.1})\) and \(L(Q^{1.1})\).
Recommendations
- Partial and paraconsistent three-valued logics
- An introduction to partition logic
- scientific article; zbMATH DE number 1775473
- scientific article; zbMATH DE number 3912284
- scientific article; zbMATH DE number 847011
- scientific article; zbMATH DE number 2020144
- scientific article; zbMATH DE number 4049618
- Three-valued paraconsistent propositional logics
- Three aspects of partitions
- Three-valued Kleene logics and three-element chains
Cited in
(7)- Partitions of F(S) and properties of upgrade algorithms in the logic systems W,W,W_k
- A general treatment of equivalent modalities
- The logic of partitions: introduction to the dual of the logic of subsets
- scientific article; zbMATH DE number 1545072 (Why is no real title available?)
- scientific article; zbMATH DE number 1841815 (Why is no real title available?)
- Monadic partition logics and finite automata
- Elementary equivalence of partition lattices
This page was built for publication: Three characterizing numbers of partition logics
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1909437)
