The notion of partial deduction known from logic programming is deened in the framework of Structural Synthesis of Programs (SSP). Partial deduction for unconditional computability statements in SSP is deened. Completeness and correctness of partial deduction in the framework of SSP are proven. Several tactics and stopping criteria are suggested.

It is shown the complete equivalence between the theory of continuous (enumeration) fuzzy closure operators and the theory of (effective) fuzzy deduction systems in Hilbert style. Moreover, it is proven that any truth-functional semantics whose connectives are interpreted in [0,1] by continuous functions is axiomatizable by a fuzzy deduction system (but not by an effective fuzzy deduction syste...

In this paper, we show how a system for automated deduction can be given computational reeection, i.e. can aaect its own computation mechanism, by using the very same machinery implementing logical deduction. This feature, that we call computational reeection via mechanized logical deduction, provides both theoretical and practical advantages. First, the theorem prover can inspect, extend and m...

In mathematics, a consequence drawn by a deduction from a set of premises can also drawn by the same deduction from any larger set of premises. The deduction remains a deduction no matter how the axioms are increased. This is monotonic reasoning, much imitated in other, less certain, disciplines. The very nature of monotonic reasoning makes mathematical proofs permanent, independent of new info...

The automated deduction and model checking communities have developed techniques that are impressively e ective when applied to suitable problems. However, these problems seldom coincide exactly with those that arise in formal methods. Using small but realistic examples for illustration, I will argue that e ective deductive support for formal methods requires cooperation among di erent techniqu...

We introduce new proof systems for propositional logic, simple deduction Frege systems, general deduction Frege systems and nested deduction Frege systems, which augment Frege systems with variants of the deduction rule. We give upper bounds on the lengths of proofs in these systems compared to lengths in Frege proof systems. As an application we give a near-linear simulation of the proposition...

In first part of this course [28] we have laid the theoretical foundations for logic program specialisation, notably introducing the technique of partial deduction along with some basic techniques to automatically control it. In this part of the course we first present in Section 2 an advanced way of controlling polyvariance based upon characteristic trees. We then show in Section 3 how partial...

We propose the use of variable declarations in natural deduction. A variable declaration is a line in a derivation that introduces a new variable into the derivation. Semantically, it can be regarded as declaring that the variable denotes an element of the universe of discourse. Undeclared variables, in contrast, do not denote anything, and may not occur free in any formula in the derivation. A...

The home mortgage interest deduction creates incentives to buy more housing and to become a homeowner, and the case for the deduction rests on social benefits from housing consumption and homeownership. There is little evidence suggesting large externalities from the level of housing consumption, but there appear to be externalities from homeownership. Externalities from living around homeowner...