Add to ORKGSubstitution-invariant consequence relations between sets of formulas and formulas are taken as the primary logical objects in Abstract Algebraic Logic (AAL). Logics so defined (see Section 2) may satisfy different replacement properties, the strongest of which says that for any set of formulas Γ, any formulas ϕ, ψ, δ and any propositiona
International audienceRelational descriptions have been used in formalizing diverse computational no...
We formally assessed four different algebraic descriptions of classical propositional logic. We defi...
Logical consequence in first-order predicate logic is defined substitutionally in set theory augment...
Wójcicki introduced in the late 1970s the concept of a referential semantics for propositional logic...
Usually, when deriving algebraizability conditions, semantical considerations are used explicitly [1...
An exposition of the approach to the algebraization of sentential logics developed by the Barcelona ...
Abstract. Substitution is fundamental to the theory of logic and computation. Is substitution someth...
The pure implicational and the multiplicative fragments of a range of propositional relevant (and ot...
A typical approach to semantics for relevance (and other) logics: specify a class of algebraic struc...
The general theory of abstract algebraic logic (AAL from now on) was first introduced in [1]. It aim...
We study formal logic as a mathematical tool for reasoning and as a medium for knowledge representat...
International audienceIn the present paper we develop algebraic semantics of refinement modal logic ...
In this paper we develop an abstract theory of adequacy. In the same way as the theory of consequenc...
A substitutional account of logical validity for formal first‐order languages is developed and defen...
Substitution is fundamental to the theory of logic and computation. Is substitution something that w...
International audienceRelational descriptions have been used in formalizing diverse computational no...
We formally assessed four different algebraic descriptions of classical propositional logic. We defi...
Logical consequence in first-order predicate logic is defined substitutionally in set theory augment...
Wójcicki introduced in the late 1970s the concept of a referential semantics for propositional logic...
Usually, when deriving algebraizability conditions, semantical considerations are used explicitly [1...
An exposition of the approach to the algebraization of sentential logics developed by the Barcelona ...
Abstract. Substitution is fundamental to the theory of logic and computation. Is substitution someth...
The pure implicational and the multiplicative fragments of a range of propositional relevant (and ot...
A typical approach to semantics for relevance (and other) logics: specify a class of algebraic struc...
The general theory of abstract algebraic logic (AAL from now on) was first introduced in [1]. It aim...
We study formal logic as a mathematical tool for reasoning and as a medium for knowledge representat...
International audienceIn the present paper we develop algebraic semantics of refinement modal logic ...
In this paper we develop an abstract theory of adequacy. In the same way as the theory of consequenc...
A substitutional account of logical validity for formal first‐order languages is developed and defen...
Substitution is fundamental to the theory of logic and computation. Is substitution something that w...
International audienceRelational descriptions have been used in formalizing diverse computational no...
We formally assessed four different algebraic descriptions of classical propositional logic. We defi...
Logical consequence in first-order predicate logic is defined substitutionally in set theory augment...