Propositional logics of dependence (Q278765): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(5 intermediate revisions by 4 users not shown) | |||
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 | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2285760602 / rank | |||
Normal rank | |||
Property / arXiv ID | |||
Property / arXiv ID: 1412.7998 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: From IF to BI. A tale of dependence and separation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4050122 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Some combinatorics of imperfect information / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dependency as Question Entailment / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Inquisitive logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Extended Modal Dependence Logic $\mathcal{EMDL}$ / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity of Model Checking for Modal Dependence Logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Model Checking for Modal Intuitionistic Dependence Logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: General models and entailment semantics for independence logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Doxastic Interpretation of Team Semantics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Dependence and independence / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Expressive Power of Modal Dependence Logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4362727 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: QUANTUM TEAM LOGIC AND BELL’S INEQUALITIES / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On definability in dependence logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Axiomatizing first-order consequences in dependence logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Eine Unableitbarkeitsbeweismethode für den Intuitionistischen Aussagenkalkül / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Complexity results for modal dependence logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On maximal intermediate logics with the disjunction property / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4774021 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Lower bounds for multiplayer noncooperative games of incomplete information / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Axiomatizing Propositional Dependence Logics / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3446107 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4599513 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4995356 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Expressing second-order sentences in intuitionistic dependence logic / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 22:33, 11 July 2024
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