42 search results - page 3 / 9 » Towards a Canonical Classical Natural Deduction System |
CSR
2008
Springer
14 years 11 months ago
2008
Springer
An (n, k)-ary quantifier is a generalized logical connective, binding k variables and connecting n formulas. Canonical systems with (n, k)-ary quantifiers form a natural class of G...
IANDC
2006
14 years 11 months ago
2006
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...
110
Voted
JAR
2010
14 years 10 months ago
2010
Meta-logics and type systems based on intuitionistic logic are commonly used for specifying natural deduction proof systems. We shall show here that linear logic can be used as a m...
109
click to vote
UML
2005
Springer
15 years 5 months ago
2005
Springer
In this paper we describe a framework for robust system maintenance that addresses specific challenges of data-centric applications. We show that for data-centric applications, cl...
LADS
2007
Springer
15 years 5 months ago
2007
Springer
Robustness, through fault tolerance, is a property often put forward in order to advocate MAS. The question is: What is the first step to be fault tolerant? Obviously the answer i...