Three characterizing numbers of partition logics
type: Item
instance of: scholarly article
title: Three characterizing numbers of partition logics
zbMATH Open document ID: 0839.03021
author: Enshao Shen
published in: Chinese Science Bulletin
publication date: 1996-06-19T00:00:00Z
review text: 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})\).
Mathematics Subject Classification ID: 03C80
zbMATH DE Number: 854920
zbMATH Keywords: partition logic
zbMATH Keywords: partition quantifiers
zbMATH Keywords: model-theoretic logics
zbMATH Keywords: well-ordering number
zbMATH Keywords: Hanf number
zbMATH Keywords: Löwenheim number
MaRDI profile type: Publication
Recommended article: Partial and paraconsistent three-valued logics
Recommended article: An introduction to partition logic
Recommended article: Q4542600
Recommended article: Q3689105
Recommended article: Q4864832
Recommended article: Q4440793
Recommended article: Q3786469
Recommended article: Three-Valued Paraconsistent Propositional Logics
Recommended article: Three aspects of partitions
Recommended article: Q3606930
description: scientific article; zbMATH DE number 854920