COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
From MaRDI portal
Abstract: In this paper, we introduce a logic based on team semantics, called FOT, whose expressive power is elementary, i.e., coincides with first-order logic both on the level of sentences and (possibly open) formulas, and we also show that a sublogic of FOT, called FOT, captures exactly downward closed elementary (or first-order) team properties. We axiomatize completely the logic FOT, and also extend the known partial axiomatization of dependence logic to dependence logic enriched with the logical constants in FOT.
Recommendations
- Logics for first-order team properties
- Axiomatizations of team logics
- Axiomatizations for propositional and modal team logic
- Propositional team logics
- Decidability of predicate logics with team semantics
- Logics with multiteam semantics
- Propositional union closed team logics
- Complexity of propositional logics in team semantic
- Enumerating teams in first-order team logics
- Separation logic and logics with team semantics
Cites work
- A finite axiomatization of conditional independence and inclusion dependencies
- A logical approach to context-specific independence
- A simple logic of functional dependence
- An interpolation theorem in the predicate calculus
- An introduction to recursively saturated and resplendent models
- Axiomatizations of team logics
- Axiomatizing first order consequences in inclusion logic
- Axiomatizing first-order consequences in dependence logic
- Axiomatizing first-order consequences in independence logic
- Axioms and algorithms for inferences involving probabilistic independence
- Coherence and computational complexity of quantifier-free dependence logic formulas
- Completeness for the classical antecedent fragment of inquisitive first-order logic
- Compositional semantics for a language of imperfect information
- Dependence and independence
- Dependence and Independence in Social Choice: Arrow’s Theorem
- Dependence logic with generalized quantifiers: axiomatizations
- Dependence logic. A new approach to independence friendly logic
- Dependency as question entailment
- Epistemic operators in dependence logic
- Erratum to: ``On definability in dependence logic
- Facets of distribution identities in probabilistic team semantics
- Finite partially-ordered quantification
- Finite Partially‐Ordered Quantifiers
- From IF to BI. A tale of dependence and separation
- Functional Dependencies in a Relational Database and Propositional Logic
- Hierarchies in independence logic
- scientific article; zbMATH DE number 6680142 (Why is no real title available?)
- scientific article; zbMATH DE number 3464827 (Why is no real title available?)
- scientific article; zbMATH DE number 1086489 (Why is no real title available?)
- scientific article; zbMATH DE number 3196255 (Why is no real title available?)
- Inclusion and exclusion dependencies in team semantics -- on some logics of imperfect information
- Inclusion dependencies and their interaction with functional dependencies
- Logics for first-order team properties
- On natural deduction in dependence logic
- On strongly first-order dependencies
- Propositional inquisitive logic: a survey
- Propositional logics of dependence
- Quantum team logic and Bell's inequalities
- Questions and dependency in intuitionistic logic
- Team logic and second-order logic
Cited in
(9)- On definability of team relations with \(k\)-invariant atoms
- Enumerating teams in first-order team logics
- Logics with probabilistic team semantics and the Boolean negation
- Compactness in team semantics
- Functional dependence in uniform dependence model
- Counting of teams in first-order team logics
- Logics with probabilistic team semantics and the Boolean negation
- Connecting state-based and team-based inquisitive logic
- On the model theory of second-order objects
This page was built for publication: COMPLETE LOGICS FOR ELEMENTARY TEAM PROPERTIES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6103455)
