package coq-propcalc
- Overview
- No Docs
You can search for identifiers within the package.
in-package search v0.2.0
Propositional Calculus
Install
Dune Dependency
Authors
Maintainers
Sources
v8.5.0.tar.gz
md5=2043cc3cb1336535a92fc3a26379d50d
Description
Formalization of basic theorems about classical propositional logic. The main theorems are (1) the soundness and completeness of natural deduction calculus, (2) the equivalence between natural deduction calculus, Hilbert systems and sequent calculus and (3) cut elimination for sequent calculus. Keywords: propositional calculus, classical logic, completeness, natural deduction, sequent calculus, cut elimination.
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page