Propositional logics of dependence (Q278765): Difference between revisions
From MaRDI portal
Created a new Item |
Changed an Item |
||
Property / review text | |||
The paper studies propositional downward closed team logic (\(\mathsf{PT}_0\)), propositional dependence logic (\(\mathsf{PD}\)), propositional dependence logic with intuitionistic disjunction (\(\mathsf{PD}^\lor\)), propositional intuitionistic dependence logic (\(\mathsf{PID}\)), and propositional inquisitive logic (\(\mathsf{InqL}\)) are studied. \(\mathsf{PD}\) and \(\mathsf{PID}\) are the propositional counterparts of known first-order logics of dependence. The sound and strongly complete deductive systems for logics \(\mathsf{PD}\), \(\mathsf{PD}^\lor\) and \(\mathsf{PID}\) have been constructed. It is proven that all of the logics \(\mathsf{PT}_0\), \(\mathsf{PD}\), \(\mathsf{PD}^\lor\), \(\mathsf{InqL}\) and \(\mathsf{PID}\) are expressively complete, expressively equivalent and compact. | |||
Property / review text: The paper studies propositional downward closed team logic (\(\mathsf{PT}_0\)), propositional dependence logic (\(\mathsf{PD}\)), propositional dependence logic with intuitionistic disjunction (\(\mathsf{PD}^\lor\)), propositional intuitionistic dependence logic (\(\mathsf{PID}\)), and propositional inquisitive logic (\(\mathsf{InqL}\)) are studied. \(\mathsf{PD}\) and \(\mathsf{PID}\) are the propositional counterparts of known first-order logics of dependence. The sound and strongly complete deductive systems for logics \(\mathsf{PD}\), \(\mathsf{PD}^\lor\) and \(\mathsf{PID}\) have been constructed. It is proven that all of the logics \(\mathsf{PT}_0\), \(\mathsf{PD}\), \(\mathsf{PD}^\lor\), \(\mathsf{InqL}\) and \(\mathsf{PID}\) are expressively complete, expressively equivalent and compact. / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: Alex Citkin / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B60 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B70 / rank | |||
Normal rank | |||
Property / Mathematics Subject Classification ID | |||
Property / Mathematics Subject Classification ID: 03B65 / rank | |||
Normal rank | |||
Property / zbMATH DE Number | |||
Property / zbMATH DE Number: 6576271 / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
propositional dependence logic | |||
Property / zbMATH Keywords: propositional dependence logic / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
inquisitive logic | |||
Property / zbMATH Keywords: inquisitive logic / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
team semantics | |||
Property / zbMATH Keywords: team semantics / rank | |||
Normal rank | |||
Property / zbMATH Keywords | |||
non-classical logic | |||
Property / zbMATH Keywords: non-classical logic / rank | |||
Normal rank |
Revision as of 18:05, 27 June 2023
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Propositional logics of dependence |
scientific article |
Statements
Propositional logics of dependence (English)
0 references
2 May 2016
0 references
The paper studies propositional downward closed team logic (\(\mathsf{PT}_0\)), propositional dependence logic (\(\mathsf{PD}\)), propositional dependence logic with intuitionistic disjunction (\(\mathsf{PD}^\lor\)), propositional intuitionistic dependence logic (\(\mathsf{PID}\)), and propositional inquisitive logic (\(\mathsf{InqL}\)) are studied. \(\mathsf{PD}\) and \(\mathsf{PID}\) are the propositional counterparts of known first-order logics of dependence. The sound and strongly complete deductive systems for logics \(\mathsf{PD}\), \(\mathsf{PD}^\lor\) and \(\mathsf{PID}\) have been constructed. It is proven that all of the logics \(\mathsf{PT}_0\), \(\mathsf{PD}\), \(\mathsf{PD}^\lor\), \(\mathsf{InqL}\) and \(\mathsf{PID}\) are expressively complete, expressively equivalent and compact.
0 references
propositional dependence logic
0 references
inquisitive logic
0 references
team semantics
0 references
non-classical logic
0 references