Some remarks on the consequence operation in sentential logics
From MaRDI portal
Publication:5606564
DOI10.4064/fm-68-3-269-279zbMath0206.27401MaRDI QIDQ5606564
Publication date: 1970
Published in: Fundamenta Mathematicae (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/214226
03B22: Abstract deductive systems
Related Items
Data types over multiple-valued logics, Logical matrices and non-structural consequence operators, That SCI has the interpolation property, Problems of substitution and admissibility in the modal system Grz and in intuitionistic propositional calculus, Suszko's thesis, inferential many-valuedness, and the notion of a logical system, Multi-valued semantics: why and how, On the degree of complexity of sentential logics. II: An example of the logic with semi-negation, On the degree of complexity of sentential logics. III. An example of Johansson's minimal logic, Synonymy in sentential languages: A pragmatic view, The degrees of maximality of the intuitionistic propositional logic and of some of its fragments, The lattice of strengthenings of a strongly finite consequence operation, On the degree of complexity of sentential logics. A couple of examples, The logics stronger than Lukasiewicz's three valued sentential calculus. The notion of degree of maximality versus the notion of degree of completeness, Matrix approach in methodology of sentential calculi, Connections between some notions of completeness of structural propositional calculi, On three-valued implicative systems, The existence of matrices strongly adequate for E, R and their fragments, Key notions of Tarski's methodology of deductive systems
