Doubly strongly first order dependencies

DOI10.1007/978-3-030-88853-4_4OpenAlexW3211313999MaRDI QIDQ2148777

Pietro Galliani

Publication date: 24 June 2022

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

zbMATH Keywords

dependence logicteam semanticssecond order logic

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items (1)

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

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
• From IF to BI. A tale of dependence and separation
• Upwards closed dependencies in team semantics
• Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
• Dependence and independence
• Epistemic operators in dependence logic
• Safe dependency atoms and possibility operators in team semantics
• Generalized quantifiers in dependence logic
• The expressive power of \(k\)-ary exclusion logic
• Logics for first-order team properties
• Hierarchies in Inclusion Logic with Lax Semantics
• Hierarchies in independence logic
• Compositional semantics for a language of imperfect information
• Decidability of predicate logics with team semantics
• On the complexity of team logic and its two-variable fragment
• CHARACTERIZING DOWNWARDS CLOSED, STRONGLY FIRST-ORDER, RELATIVIZABLE DEPENDENCIES
• On Strongly First-Order Dependencies
• Team Logic and Second-Order Logic

This page was built for publication: Doubly strongly first order dependencies