167 search results - page 5 / 34 » Mathematical Logic and Deduction in Computer Science Educati... |
RTA
1999
Springer
14 years 24 days ago
1999
Springer
We present a modular proof of the strong normalisation of intuitionistic logic with permutation-conversions. This proof is based on the notions of negative translation and CPS-simu...
JIIS
2008
13 years 8 months ago
2008
We propose a natural framework, called NF, which supports development of formal proofs on a computer. NF is based on a theory of Judgments and Derivations. NF is designed by observ...
TIME
2007
IEEE
14 years 2 months ago
2007
IEEE
We present a proof searching technique for the natural deduction calculus for the propositional linear-time temporal logic and prove its correctness. This opens the prospect to ap...
STACS
1993
Springer
14 years 19 days ago
1993
Springer
Abduction is an important form of nonmonotonic reasoning allowing one to find explanations for certain symptoms or manifestations. When the application domain is described by a l...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
In predicate logic, the proof that a theorem P holds in a theory Th is typically conducted in natural deduction or in the sequent calculus using all the information contained in t...