There is no statutory requirement that formal logic be adhered to during examination of patent claims. Examiners and patent practitioners are free to use a wide variety of discussion and argument ...

Modal logic, an extension of classical logic, investigates the modes of truth such as necessity and possibility. Its development has been closely intertwined with advances in proof theory, a field ...

Girard introduced phase semantics as a complete set-theoretic semantics of linear logic, and Okada modified phase-semantic completeness proofs to obtain normalform theorems. On the basis of these ...

We present a dynamic approach to Peirce's original construal of abductive logic as a logic of conjecture making, and provide a new decidable, contraction-free and cut-free proof system for the dynamic ...

A mathematical problem more than 300 years old gets a formal proof with the help of computer formal verification. A team led by mathematician Thomas Hales has delivered a formal proof of the Kepler ...

Computer-assisted of mathematical proofs are not new. For example, computers were used to confirm the so-called 'four color theorem.' In a short release, 'Proof by computer,' the American Mathematical ...