Results 1  10
of
3,666,422
Systematic Construction of Natural Deduction Systems for . . .
, 1993
"... We exhibit a construction principle for natural deduction systems for arbitrary finitelymanyvalued first order logics. These systems are systematically obtained from sequent calculi, which in turn can be extracted from the truth tables of the logics under consideration. Soundness and cutfree co ..."
Abstract

Cited by 17 (3 self)
 Add to MetaCart
We exhibit a construction principle for natural deduction systems for arbitrary finitelymanyvalued first order logics. These systems are systematically obtained from sequent calculi, which in turn can be extracted from the truth tables of the logics under consideration. Soundness and cut
Pedagogical Natural Deduction Systems: the Propositional Case
"... Abstract: This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a proof must be motivated by some example. It is established that such systems are negationless. The expressive po ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
Abstract: This paper introduces the notion of pedagogical natural deduction systems, which are natural deduction systems with the following additional constraint: all hypotheses made in a proof must be motivated by some example. It is established that such systems are negationless. The expressive
Intuitionistic and Classical Natural Deduction Systems with the Catch and the Throw Rules
 Theoretical Computer Science
, 1995
"... this paper, we introduce two natural deduction systems NJ c=t and NK c=t . NJ c=t is an extension of the intuitionistic natural deduction system NJ with the catch and the throw rules, and NK c=t is an extension of the classical natural deduction system ..."
Abstract

Cited by 11 (1 self)
 Add to MetaCart
this paper, we introduce two natural deduction systems NJ c=t and NK c=t . NJ c=t is an extension of the intuitionistic natural deduction system NJ with the catch and the throw rules, and NK c=t is an extension of the classical natural deduction system
1 On natural deduction system for nonmonotonic reasoning
"... This paper is concerned with the problem of how to construct a natural deduction system for nonmonotonic reasoning. Three possible constructions are investigated, the ones which consists of (1) pure nonmonotonic inference rules; (2) nonmonotonic inference rules plus a nonmonotonic tautology base; or ..."
Abstract
 Add to MetaCart
This paper is concerned with the problem of how to construct a natural deduction system for nonmonotonic reasoning. Three possible constructions are investigated, the ones which consists of (1) pure nonmonotonic inference rules; (2) nonmonotonic inference rules plus a nonmonotonic tautology base
A natural deduction system for first degree entailment’, Notre Dame
 Journal of Formal Logic
, 1999
"... Abstract This paper is concerned with a natural deduction system for First Degree Entailment (FDE). First, we exhibit a brief history of FDE and of combined systems whose underlying idea is used in developing the natural deduction system. Then, after presenting the language and a semantics of FDE, w ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract This paper is concerned with a natural deduction system for First Degree Entailment (FDE). First, we exhibit a brief history of FDE and of combined systems whose underlying idea is used in developing the natural deduction system. Then, after presenting the language and a semantics of FDE
Natural Deduction Systems for Intuitionistic Substructural Logics and their Strong Normalization
"... An intuitionistic substructural logic is a formal system obtained from Gentzen’s sequent calculus LJ for the intuitionistic logic by removing some or all of structural rules, i.e. exchange, weakening and contraction. Some natural deduction systems for them are known, but they all are what we call ‘s ..."
Abstract
 Add to MetaCart
An intuitionistic substructural logic is a formal system obtained from Gentzen’s sequent calculus LJ for the intuitionistic logic by removing some or all of structural rules, i.e. exchange, weakening and contraction. Some natural deduction systems for them are known, but they all are what we call
Simplifying proofs in Fitchstyle natural deduction systems
, 2004
"... We present an algorithm for simplifying Fitchstyle natural deduction proofs in classical firstorder logic. We formalize Fitchstyle natural deduction as a denotational proof language, N DL, with a rigorous syntax and semantics. Based on that formalization, we define an array of simplifying transfo ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
We present an algorithm for simplifying Fitchstyle natural deduction proofs in classical firstorder logic. We formalize Fitchstyle natural deduction as a denotational proof language, N DL, with a rigorous syntax and semantics. Based on that formalization, we define an array of simplifying
Labeled Natural Deduction Systems for a Family of Tense Logics
, 803
"... We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of useful normalization properties (in particular, derivations ..."
Abstract
 Add to MetaCart
We give labeled natural deduction systems for a family of tense logics extending the basic linear tense logic Kl. We prove that our systems are sound and complete with respect to the usual Kripke semantics, and that they possess a number of useful normalization properties (in particular
A Labeled Natural Deduction System for a Fragment of CTL∗
"... Abstract. We give a sound and complete labeled natural deduction system for an interesting fragment of CTL∗, namely the untilfree version of BCTL∗. The logic BCTL ∗ is obtained by referring to a more general semantics than that of CTL∗, where we only require that the set of paths in a model is clos ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Abstract. We give a sound and complete labeled natural deduction system for an interesting fragment of CTL∗, namely the untilfree version of BCTL∗. The logic BCTL ∗ is obtained by referring to a more general semantics than that of CTL∗, where we only require that the set of paths in a model
Results 1  10
of
3,666,422