The simplest protoalgebraic logic
From MaRDI portal
Recommendations
Cites work
- \(C_ 1\) is not algebraizable
- A survey of abstract algebraic logic
- Admissibility of logical inference rules
- Algebraic semantics for deductive systems
- Algebraizable logics
- An algebraic approach to non-classical logics
- Beyond Rasiowa's algebraic approach to non-classical logics
- Contextual deduction theorems
- Fully adequate Gentzen systems and the deduction theorem
- scientific article; zbMATH DE number 5235521 (Why is no real title available?)
- Inconsistency lemmas in algebraic logic
- Leibniz interpolation properties
- On the closure properties of the class of full G-models of a deductive system
- On weakening the Deduction Theorem and strengthening Modus Ponens
- Some theorems about the sentential calculi of Lewis and Heyting
- Theory of logical calculi. Basic theory of consequence operations
Cited in
(10)- Simplified semantics for basic relevant logics
- Characterizing finite-valuedness
- Willem Blok's contribution to abstract algebraic logic
- Logic may be simple. Logic, congruence and algebra
- ON EQUATIONAL COMPLETENESS THEOREMS
- AN ABSTRACT ALGEBRAIC LOGIC STUDY OF DA COSTA’S LOGIC AND SOME OF ITS PARACONSISTENT EXTENSIONS
- Erratum to J. M. Font, The simplest protoalgebraic logic
- THE POSET OF ALL LOGICS II: LEIBNIZ CLASSES AND HIERARCHY
- Some more theorems on structural entailment relations and non-deterministic semantics
- Existence of simple propositional formulas
This page was built for publication: The simplest protoalgebraic logic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5396225)