Login / Signup
A Simple Proof of Completeness and Cut-admissibility for Propositional Gödel Logic.
Arnon Avron
Published in:
J. Log. Comput. (2011)
Keyphrases
</>
probabilistic logic
relational databases
theorem prover
automated reasoning
asynchronous circuits