Sciweavers

1128 search results - page 6 / 226
» Classical Natural Deduction
Sort
View
IANDC
2006
93views more  IANDC 2006»
13 years 8 months ago
Automation for interactive proof: First prototype
Interactive theorem provers require too much effort from their users. We have been developing a system in which Isabelle users obtain automatic support from automatic theorem prov...
Jia Meng, Claire Quigley, Lawrence C. Paulson
IGPL
2007
113views more  IGPL 2007»
13 years 8 months ago
Pandora: A Reasoning Toolbox using Natural Deduction Style
Pandora is a tool for supporting the learning of first order natural deduction. It includes a help window, an interactive context sensitive tutorial known as the ‘‘e-tutor’...
Krysia Broda, Jiefei Ma, Gabrielle Sinnadurai, Ale...
CORR
2008
Springer
148views Education» more  CORR 2008»
13 years 7 months ago
Efficiently Simulating Higher-Order Arithmetic by a First-Order Theory Modulo
In deduction modulo, a theory is not represented by a set of axioms but by a congruence on propositions modulo which the inference rules of standard deductive systems--such as for ...
Guillaume Burel
ISMVL
1993
IEEE
140views Hardware» more  ISMVL 1993»
14 years 20 days ago
Systematic Construction of Natural Deduction Systems for Many-Valued Logics
A construction principle for natural deduction systems for arbitrary finitely-many-valued first order logics is exhibited. These systems are systematically obtained from sequent...
Matthias Baaz, Christian G. Fermüller, Richar...
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
14 years 28 days ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...