ON THE THEORY OF BOOLEAN FORMULAS: ALLOWABLE REPLACEMENT FOR SUBFORMULAS.

Abstract

The theory of substitutions for Boolean formulas developed in a previous report is applied here to the determination of those s-tuples of formulas that may be allowable replacements for s -tuples of subformulas of given Boolean formulas. The criteria of allowability are very general and flexible, yet may be expressed with great precision and ease. The results formalize and extend various known isolated instances. They may be used for the study of a large number of problems in the theory and application of Boolean formulas and functions. (Author)

Document Details

Document Type
Technical Report
Publication Date
Aug 01, 1965
Accession Number
AD0623921

Entities

People

  • E. W. Samson
  • L. Calabi

Organizations

  • Air Force Cambridge Research Laboratories

Tags

DTIC Thesaurus Topics

  • Behavior And Behavior Mechanisms
  • Behavioral Disciplines And Activities
  • Behavioral Sciences
  • Contract Administration
  • Contracts
  • Cooperation
  • Group Dynamics
  • Precision

Readers

  • Graph Algorithms and Convex Optimization.
  • Systems Analysis and Design