Strongly first order, domain independent dependencies: the union-closed case

DOI10.1007/978-3-031-15298-6_17arXiv2205.06466OpenAlexW4297809199MaRDI QIDQ6160748

Pietro Galliani

Publication date: 2 June 2023

Published in: Logic, Language, Information, and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2205.06466

zbMATH Keywords

dependence logicteam semanticsfirst order logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A double team semantics for generalized quantifiers
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Upwards closed dependencies in team semantics
• Probabilistic team semantics
• Dependence and independence
• Safe dependency atoms and possibility operators in team semantics
• Doubly strongly first order dependencies
• Logics for first-order team properties
• Compositional semantics for a language of imperfect information
• Decidability of predicate logics with team semantics
• Logics with Multiteam Semantics
• CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES
• On Strongly First-Order Dependencies
• On Dependence Logic

This page was built for publication: Strongly first order, domain independent dependencies: the union-closed case