681 search results - page 6 / 137 » Parsing as Natural Deduction |
CSL
2000
Springer
14 years 9 months ago
2000
Springer
Abstract. We investigate the possibility of giving a computational interpretation of an involutive negation in classical natural deduction. We first show why this cannot be simply ...
106
click to vote
CADE
2008
Springer
14 years 11 months ago
2008
Springer
It is well known how to use an intuitionistic meta-logic to specify natural deduction systems. It is also possible to use linear logic as a meta-logic for the specification of a va...
107
click to vote
TYPES
1995
Springer
15 years 1 months ago
1995
Springer
Natural Deduction style presentations of program logics are useful in view of the implementation of such logics in interactive proof development environments, based on type theory,...
LFCS
2009
Springer
15 years 4 months ago
2009
Springer
We give a sound and complete labeled natural deduction system for an interesting fragment of CTL∗ , namely the until-free version of BCTL∗ . The logic BCTL∗ is obtained by re...
LANMR
2007
14 years 11 months ago
2007
Teaching engineering students courses such as computer science theory, automata theory and discrete mathematics took us to realize that introducing basic notions of logic, especial...