Properties of the logical consequence operation and its relationship with the independence of propositional logic
From MaRDI portal
Publication:2274565
Recommendations
- On the computational consequences of independence in propositional logic
- Propositional logics of dependence
- Logics for propositional determinacy and independence
- Some remarks on axiomatizing logical consequence operations
- A logical notion of conditional independence: properties and applications
- scientific article; zbMATH DE number 849963
- Independence logic and abstract independence relations
- Conditional independence in propositional logic.
- Conditionals and Independence in Many-Valued Logics
- Axiomatizing propositional dependence logics
Cites work
- A shared framework for consequence operations and abstract model theory
- scientific article; zbMATH DE number 2048516 (Why is no real title available?)
- scientific article; zbMATH DE number 3230232 (Why is no real title available?)
- Independence of countable sets of formulas of the propositional logic.
- Independent axiomatizability of sets of sentences
- Proceedings of the 8th annual conference on Computational learning theory (COLT '95). Santa Cruz, CA, USA, July 5--8, 1995
- Some theorems on structural consequence operations
- Theory of logical calculi. Basic theory of consequence operations
This page was built for publication: Properties of the logical consequence operation and its relationship with the independence of propositional logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2274565)