- 1 CHURCH, A. A : noet the Eutchddugsproblem. J. symb Logic 1 (1936) 40-41. Correction ibid., 101-102.Google Scholar
- 2 DAVIS. M., AND PUTMAN, H. A computing proCedure for quantific tHeory. ,j .ACm 7 (Mar. 1960), 201-215. Google Scholar
- 3 FRIEDMAN, J. A semi-decision procedure for die funCtiONAL calculus. J. ACM I0 (Jan. 1963), 1-24. Google Scholar
- 4 GILMORE, P- C, A proof method for quantiFired ion theory. IBM J. Res. Develop. 4 (1960), 2S-35,Google Scholar
- 5 ROBINSON, J. A, Theorem-provinng on the computer, J, ACM 10 (Apr. t963), 163-174. Google Scholar
Index Terms
- A Machine-Oriented Logic Based on the Resolution Principle
Recommendations
Partitioned Branch Condition Resolution Logic
SBCCI '00: Proceedings of the 13th symposium on Integrated circuits and systems designThis paper presents the design of an early condition resolution circuit. The proposed circuit works in parallel with the arithmetic unit, and calculates the Equal to (EQ), Greater-than (GT), Less-than (LT), Overflow (OV), Underflow (UF), and Carry-out (...
Design of reversible logic based full adder in current-mode logic circuits
AbstractDemand of Very Large Scale Integration (VLSI) circuits with very high speed and low power are increased due to communication system's transmission speed increase. During computation, heat is dissipated by a traditional binary logic or logic ...
Logic Networks of Carry-Save Adders
logic networks of carry-save adders such as high-speed multipliers, multioperand adders, and double-rail input parallel adders are designed based on the parallel adders with a minimum number of NOR gates discussed in [1]. After a discussion of the ...
Comments