Add to ORKGWe formalize equational propositional logic, prove that it is sound and complete, and compare the equational-proof style with the more traditional Hilbert style
We formally assessed four different algebraic descriptions of classical propositional logic. We defi...
The proof of completeness for propositional logic is a constructive one, so a computer program is su...
It is the purpose of this note to show that the question of whether a given propositional formula is...
We present two dierent formalizations of Equational Predicate Logic, that is, rst order logic that ...
Equational type logic is an extension of (conditional) equational logic, that enables one to deal in...
AbstractWe introduce an abstract general notion of system of equations between terms, called Term Eq...
This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of t...
Equational hybrid propositional type theory (EHPTT) is a combination of propositional type theory, e...
: This paper is part of a long-term effort to increase expressiveness of algebraic specification lan...
Abstract: This paper is part of a long-term effort to increase expressiveness of algebraic specifica...
Abstract. We propose and study a logic able to state and reason about equational constraints, by com...
AbstractEquational type logic is an extension of (conditional) equational logic, that enables one to...
We provide a mathematical theory and methodology for synthesising equationallogics from algebraic me...
AbstractThere are currently no fewer than four dedicated logics for equality reasoning over nominal ...
This thesis proposes a general framework for equational logic programming, called category-based equ...
We formally assessed four different algebraic descriptions of classical propositional logic. We defi...
The proof of completeness for propositional logic is a constructive one, so a computer program is su...
It is the purpose of this note to show that the question of whether a given propositional formula is...
We present two dierent formalizations of Equational Predicate Logic, that is, rst order logic that ...
Equational type logic is an extension of (conditional) equational logic, that enables one to deal in...
AbstractWe introduce an abstract general notion of system of equations between terms, called Term Eq...
This article introduces propositional logic as a formal system ([14], [10], [11]). The formulae of t...
Equational hybrid propositional type theory (EHPTT) is a combination of propositional type theory, e...
: This paper is part of a long-term effort to increase expressiveness of algebraic specification lan...
Abstract: This paper is part of a long-term effort to increase expressiveness of algebraic specifica...
Abstract. We propose and study a logic able to state and reason about equational constraints, by com...
AbstractEquational type logic is an extension of (conditional) equational logic, that enables one to...
We provide a mathematical theory and methodology for synthesising equationallogics from algebraic me...
AbstractThere are currently no fewer than four dedicated logics for equality reasoning over nominal ...
This thesis proposes a general framework for equational logic programming, called category-based equ...
We formally assessed four different algebraic descriptions of classical propositional logic. We defi...
The proof of completeness for propositional logic is a constructive one, so a computer program is su...
It is the purpose of this note to show that the question of whether a given propositional formula is...