We present a natural deduction calculus for the quantified propositional linear-time temporal logic (QPTL) and prove its correctness. The system extends previous natural deduction constructions for the propositional linear-time temporal logic. These developments extend the applicability of the natural deduction to more sophisticated specifications due to the expressive power of QPTL and, on the...

This paper describes an algorithm of proof search for implicational formula in intuitionistic logic. It is based on a natural deduction style formulation of long normal form of simply typed -calculus. The algorithm returns a deduction tree, which becomes a proof if the formula is provable. When the formula is unprovable, a counter-model is constructed by identifying the repeated nodes in the de...

Deduction modulo is a theoretical framework designed to introduce computational steps in deductive systems. This approach is well suited to automated theorem proving and a tableau method for firstorder classical deduction modulo has been developed. We reformulate this method and give an (almost constructive) semantic completeness proof. This new proof allows us to extend the completeness theore...

Deduction, induction, and analogy pervade all our thinking. In contrast with deduction, understanding logical aspects of induction and analogy is stil l an important and challenging issue of artificial intelligence. This paper describes a logical formalization, called production, of common conjectural reasoning of both induction and analogy. By introduction of preduction, analogical reasoning i...

In this paper, we describe an architecture for resource guided concurrent mecha-nised deduction which is motivated by some ndings in cognitive science. Its beneets are illustrated by comparing it with traditional proof search techniques. In particular, we introduce the notion of focused search and show that a reasoning system can be built as the cooperative collection of concurrently acting spe...

We introduce a new encoding of the set theory of the B method based on deduction modulo. The theory of deduction modulo is an extension of predicate calculus that includes rewriting on both terms and propositions, which is well suited for proof search in axiomatic theories, as it turns many axioms into rewrite rules. We also present Zenon Modulo and iProver Modulo, two automated theorem provers...

agility has an undeniable effect on organization success inthe present changing markets, and information technology (it) is a majorfacilitating factor in business activities of organizations nowadays,as about more than a half of present organizations capitals is based onit. therefore, assessment of the it application level and organizationalagility, and study of the effect of application of it ...