Doubly strongly first order dependencies

DOI10.1007/978-3-030-88853-4_4MaRDI QIDQ2148777zbMATH OpenOpenAlexFDO

Authors Pietro Galliani

Publication date 24 June 2022

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

zbMATH Keywords

dependence logicsecond order logicteam semantics

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• Characterizing strongly first order dependencies: the non-jumping relativizable case
• On strongly first-order dependencies
• Strongly first order, domain independent dependencies: the union-closed case
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Upwards closed dependencies in team semantics

Cites work

• A double team semantics for generalized quantifiers
• Capturing \(k\)-ary existential second order logic with \(k\)-ary inclusion-exclusion logic
• Characterizing downwards closed, strongly first-order, relativizable dependencies
• Characterizing strongly first order dependencies: the non-jumping relativizable case
• Compositional semantics for a language of imperfect information
• Decidability of predicate logics with team semantics
• Dependence and independence
• Dependence logic. A new approach to independence friendly logic
• Epistemic operators in dependence logic
• From IF to BI. A tale of dependence and separation
• Generalized quantifiers in dependence logic
• Hierarchies in independence logic
• scientific article; zbMATH DE number 6680142 (Why is no real title available?)
• scientific article; zbMATH DE number 4118333 (Why is no real title available?)
• scientific article; zbMATH DE number 972408 (Why is no real title available?)
• Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
• Independence-friendly logic. A game-theoretic approach
• Logics for first-order team properties
• On strongly first-order dependencies
• On the complexity of team logic and its two-variable fragment
• Safe dependency atoms and possibility operators in team semantics
• Team logic
• Team logic and second-order logic
• The expressive power of \(k\)-ary exclusion logic
• Upwards closed dependencies in team semantics

Cited in

(6)

• Safe dependency atoms and possibility operators in team semantics
• Logics for first-order team properties
• Strongly dependent theories
• Characterizing strongly first order dependencies: the non-jumping relativizable case
• Strongly first order, domain independent dependencies: the union-closed case
• Doubly Strongly First Order Dependencies

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148777)