Stig Kanger. A simplified proof method for elementary logic. Computer programming and formal systems

Name: Stig Kanger. A simplified proof method for elementary logic. Computer programming and formal systems
Author: P. Braffort and D. Hirschberg, Studies in logic and the foundations of mathematics

by P. Braffort and D. Hirschberg, Studies in logic and the foundations of mathematics · 1 review · 1967

Reviewed by	Journal	Date	Access
J. A. Robinson	The Journal of Symbolic Logic	1967	Restricted

Metaphysics & Logic

Also by mathematics

Saul A. Kripke. Semantical analysis of modal logic II. Non-normal modal propositional calculi. The theory of models, Proceedings of the 1963 International Symposium at Berkeley (2 reviews)
A. Heyting. Some remarks on intuitionism. Constructivity in mathematics, Proceedings of the colloquium held at Amsterdam (1 review)
A. N. Prior. Existence in Leśniewski and in Russell. Formal systems and recursive functions, Proceedings of the Eighth Logic Colloquium (1 review)
A. Robinson. A basis for the mechanization of the theory of equations. Computer programming and formal systems (1 review)
A. S. Troelstra. The theory of choice sequences. Logic, methodology and philosophy of science III, Proceedings of the Third International Congress for Logic, Methodology and Philosophy of Science, Amsterdam (1 review)
A. S. Yessenin-Volpin. The ultra-intuitionistic criticism and the antitraditional program for foundations of mathematics. Intuitionism and proof theory, Proceedings of the summer conference at Buffalo N.Y (1 review)
A. Tarski. Equational logic and equational theories of algebras. Contributions to mathematical logic, Proceedings of the Logic Colloquium, Hannover (1 review)
Alan Cobham. The intrinsic computational difficulty of functions. Logic, methodology and philosophy of science, Proceedings of the 1964 International Congress (1 review)

Search PhilReviews for this title