Jansana, Ramon2025-01-202025-01-202023-06-120039-3215https://hdl.handle.net/2445/217688A propositional logic, taken as a consequence relation ⊢, is weakly implicative if its language has a binary connective (primitive or defined) →, named weak implication, that satisfies for all formulas φ,ψ, δ the following four conditions: 1. ⊢ φ → φ, 2. φ,φ → ψ ⊢ ψ, 3. φ → ψ,ψ → δ ⊢ φ → δ, 4. φ → ψ,ψ → φ ⊢ ⋆(δ1 . . . , δi, φ, δi+2, . . . , δn) → ⋆(δ0 . . . , δi,ψ, δi+2, . . . , δn), for every connective ⋆ of the language, every 1 ≤ i ≤ n where n is the arity of ⋆ and all formulas δ0 . . . , δn. The concept was introduced by P. Cintula in [1] and since then it has been extensively studied by the authors of Logic and Implication. It is a weakening of Rasiowa’s concept [5] of implicative logic in that weakly implicative logics do not need to satisfy the condition φ ⊢ ψ → φ that in addition to 1–4 above characterize Rasiowa’s notion.7 p.application/pdfengcc-by (c) Jansana, Ramon, 2023http://creativecommons.org/licenses/by/3.0/es/Ressenyes (Documents)Reviews (Documents)Cintula, Petr and Noguera, Carles. Logic and Implication. An Introduction to the General Algebraic Study of Non-classical Logicsinfo:eu-repo/semantics/article7518102025-01-20info:eu-repo/semantics/openAccess