On finitely based consequence operations
From MaRDI portal
Cites work
- A representation theorem for the lattice of standard consequence operations
- A strongly finite logic with infinite degree of maximality
- Concerning the method of logical schemes, the notion of logical calculus and the role of consequence relations
- scientific article; zbMATH DE number 3150809 (Why is no real title available?)
- Some theorems on structural consequence operations
- The logics stronger than Lukasiewicz's three valued sentential calculus. The notion of degree of maximality versus the notion of degree of completeness
Cited in
(7)- The logic of algebraic rules as a generalization of equational logic
- Remarks on a survey article on many valued logic by A. Urquhart
- Finite structural axiomatization of every finite-valued propositional calculus
- An example of strongly finite consequence operation with \(2^ (\aleph_ 0)\) standard strengthenings
- The lattice of strengthenings of a strongly finite consequence operation
- Three-element nonfinitely axiomatizable matrices
- Key notions of Tarski's methodology of deductive systems
This page was built for publication: On finitely based consequence operations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1245930)