package logtk
sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page
Core types and algorithms for logic
Install
dune-project
Dependency
Authors
Maintainers
Sources
2.0.tar.gz
md5=7a8e57388083ed763d12d18324c8a086
sha512=5c5ac312ada6b42907d1e91e349454a8375f7bf8165d3459721a40b707a840a3d6b3dc968a66f1040cb4de7aedf5c1c13f3e90b51337eae5ea6de41651d7bd63
doc/logtk.proofs/Logtk_proofs/LLProver/index.html
Module Logtk_proofs.LLProver
Low Level Prover
A small theorem prover that checks entailment of ground formulas, with higher order terms and some theories
type form = LLTerm.Form.tval can_check : LLProof.tag list -> boolIs this set of tags accepted by the tableau prover?
val prove : form list -> form -> res * final_stateprove a b returns R_ok if a => b is a tautology.
val pp_stats : final_state CCFormat.printerval pp_dot : final_state CCFormat.printer sectionYPositions = computeSectionYPositions($el), 10)"
x-init="setTimeout(() => sectionYPositions = computeSectionYPositions($el), 10)"
>
On This Page