Hypertext '97, Association For Computing Machinery, 1997,

Association for Computing Machinery (1997)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Add categories

Keywords

Reprint years

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 91,386

External links

  • This entry has no external links. Add one.
Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

My notes

Chapters

"Scholarly Hypertext: Self-Represented Complexity".David Kolb

Similar books and articles

"Scholarly Hypertext: Self-Represented Complexity".David Kolb - 1997 - In Kolb David (ed.), Hypertext '97, Association For Computing Machinery, 1997,. Association for Computing Machinery. pp. 29-37..
Burkhart W. H.. Theorem minimization. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 259–263. [REVIEW]Raymond J. Nelson - 1953 - Journal of Symbolic Logic 18 (4):348-348.
Burkhart W. H.. A method for synthesis of two-valued feedback circuits. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 265–272. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):56-56.
Semon Warren L.. Characteristic numbers and their use in the decomposition of switching functions. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 273–280. [REVIEW]Raymond J. Nelson - 1954 - Journal of Symbolic Logic 19 (1):57-57.
Kalin Theodore A.. Formal logic and switching circuits. Proceedings of the Association for Computing Machinery, Jointly sponsored by the Association for Computing Machinery and the Mellon Institute, Pittsburgh, Pa., May 2 and 3, 1952, photo-offset, Richard Rimbach Associates, Pittsburgh 1952, pp. 251–257. [REVIEW]Alonzo Church - 1953 - Journal of Symbolic Logic 18 (4):345-346.
Jeffrey Richard C.. Arithmetical analysis of digital computing nets. Journal of the Association for Computing Machinery, vol. 3 , pp. 360–375. [REVIEW]E. J. McCluskey - 1960 - Journal of Symbolic Logic 25 (2):190-191.
Karen Ida Boalth Spärck Jones 1935-2007.S. G. Pulman - 2011 - In Proceedings of the British Academy, Volume 166, Biographical Memoirs of Fellows, IX. pp. 273.
Elgot Calvin C.. On single vs. triple address computing machines. Journal of the Association for Computing Machinery, vol. 1 no. 3 , pp. 119–123. [REVIEW]Raymond J. Nelson - 1956 - Journal of Symbolic Logic 21 (2):208-209.
Lessons from a restricted Turing test.Stuart M. Shieber - 1994 - Communications of the Association for Computing Machinery 37:70-82.
Patterson G. W.. What is a code? Communications of the Association for Computing Machinery, vol. 3 no. 5 , pp. 315–318.Richard C. Jeffrey - 1965 - Journal of Symbolic Logic 30 (3):385-385.
J. A. Robinson. Theorem-proving on the computer. Journal of the Association for Computing Machinery, vol. 10 , pp. 163–174. [REVIEW]David Luckham - 1966 - Journal of Symbolic Logic 31 (3):514-515.
"Hypertext as Subversive?".David Kolb - 2000 - Culture Machine 2.
Proceedings Symposium on Logic in Computer Science, Ithaca, New York, June 22-25, 1987 ; Sponsored by the Computer Society of the Ieee Technical Committee on Mathematical Foundations of Computing in Cooperation with Acm Sigact, Association for Symbolic Logic, European Association for Theoretical Computer Science.Association for Computing Machinery, Association for Symbolic Logic, European Association for Theoretical Computer Science, Ieee Computer Society & Special Interest Group for Automata and Computability Theory - 1987
Huffman David A.. The design and use of hazard-free switching networks. Journal of the Association for Computing Machinery, vol. 4 no. 1 , pp. 47–62. [REVIEW]Edward F. Moore - 1960 - Journal of Symbolic Logic 25 (3):301-301.
Socrates in the Labyrinth: Hypertext, Argument, Philosophy.David Kolb & J. David Bolter - 1994 - Eastgate Systems.

Analytics

Added to PP
2018-01-02

Downloads
0

6 months
0

Historical graph of downloads

Sorry, there are not enough data points to plot this chart.
How can I increase my downloads?

Author's Profile

David Kolb
Bates College

Citations of this work

No citations found.

Add more citations

References found in this work

No references found.

Add more references