On finitely based consequence operations
From MaRDI portal
Publication:1245930
DOI10.1007/BF02123410zbMath0375.02012MaRDI QIDQ1245930
Publication date: 1976
Published in: Studia Logica (Search for Journal in Brave)
Related Items (7)
Three-element nonfinitely axiomatizable matrices ⋮ 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 ⋮ Key notions of Tarski's methodology of deductive systems ⋮ The logic of algebraic rules as a generalization of equational logic
Cites Work
- Unnamed Item
- The logics stronger than Lukasiewicz's three valued sentential calculus. The notion of degree of maximality versus the notion of degree of completeness
- Some theorems on structural consequence operations
- 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
This page was built for publication: On finitely based consequence operations
