An introduction to state notation and SKED

SKED is a minicomputer operating system based on the functional use of state notation as a programming language. An overall view of the operating system, state notation, and the hardware necessary to simultaneously control as many as 12 experimental stations is provided.     

NOVA SKED: A behavioral notation language for Data General minicomputers

A state notation language (NOVA SKED) for the experimental control and collection of data from operant behavior experiments by Data General NOVA series minicomputers is described. NOVA SKED is based on the SKED system written for the Digital Equipment Corporation PDP8 series of minicomputers. The NOVA SKED state notation syntax enables diagramming experimental procedures directly and precisely by the operant experimenter, who need not be familiar with computers. This syntax can then be compiled by the computer into programs that operate under the SKED run-time system (RTS). The SKED RTS operates in a timesharing mode that allows up to 16 experimental stations to function simultaneously and independently from each other. NOVA SKED is a “stand-alone” system that collects and stores data on digital magnetic tape.     

Musical notation for the keyboard: An examination of stimulus-response compatibility

A recent stimulus-response compatibility model was used to provide a performance evaluation of an experimental notation for the keyboard in which pitch varies horizontally in visual space. One hundred and twenty subjects performed a choice reaction time task using either the horizontal notation or a more traditional vertical notation. Half the subjects in each notation group received white noise and half received pitch-varying feedback with responses. A horizontal display advantage was revealed when rules of the model were applied to data analyses. Further, the horizontal display advantage was not dependent on the nature of the feedback. In a second experiment, performance of musicians and non-musicians was compared using the horizontal and vertical notations. Musicians' performance was uniformly better than that of non-musicians, and did not differ with notation orientation. The findings support the use of non-traditional horizontal notations for novice performance on a keyboard instrument.     

NOVA SKED II: A behavioral notation language utilizing the Data General Corporation real-time disk operating system

A software system (NOVA SKED) was developed for the experimental control and collection of data from operant behavior experiments that is compatible with the Data General Corporation real-time disk operating system (RDOS). NOVA SKED is based on the SKED state notation language originally implemented on Digital Equipment Corporation PDP-8 series of minicomputers. The system includes a compiler written in FORTRAN, a multitasking run-time system that can be configured to run up to 30 stations, a data back-up system, standard data manipulation programs and subroutines, and user manuals.     

不同注意条件下大数与小数的加工差异

考察在注意（注视点）与非注意（非注视点）条件下数字加工的距离效应和符号效应。采用小数（1－4）和大数（6－9）的中文与阿拉伯数字为材料,以判断数字是否大于5为任务。实验结果表明：⑴ 在注意条件下,大小数都出现了距离效应;而在非注意条件下,只有小数出现距离效应;⑵ 在注意条件下,大小数都没有出现符号效应;而在非注意条件下,只有小数出现符号效应,中文数字绩效显著好于阿拉伯数字。     

Semantics for existential graphs

This paper examines Charles Peirce's graphical notation for first-order logic with identity. The notation forms a part of his system of existential graphs, which Peirce considered to be his best work in logic. In this paper a Tarskian semantics is provided for the graphical system.     

Use of a notation system for digital control and recording

This paper describes (1) a notation system for digital control and recording, (2) some improvements to SKED, and (3) future developments and uses of minicomputers.     

基于广义谢弗竖的分析性模态公理系统

沿着安德森等人开创的方向,我们将分析性公理系统从经典逻辑推向模态逻辑,所定义的广义谢弗竖混合了模态词和广义析舍。在这篇论文中,我们给出常见的正规模态逻辑的分析性公理系统及其强完全性定理和插值定理,并讨论演绎关系的性质：单调性和切割性。     

Reasoning About Collectively Accepted Group Beliefs

A proof-theoretical treatment of collectively accepted group beliefs is presented through a multi-agent sequent system for an axiomatization of the logic of acceptance. The system is based on a labelled sequent calculus for propositional multi-agent epistemic logic with labels that correspond to possible worlds and a notation for internalized accessibility relations between worlds. The system is contraction- and cut-free. Extensions of the basic system are considered, in particular with rules that allow the possibility of operative members or legislators. Completeness with respect to the underlying Kripke semantics follows from a general direct and uniform argument for labelled sequent calculi extended with mathematical rules for frame properties. As an example of the use of the calculus we present an analysis of the discursive dilemma.     

Blockchain Identities: Notational Technologies for Control and Management of Abstracted Entities

This paper argues that many so‐called digital technologies can be construed as notational technologies, explored through the example of Monegraph, an art and digital asset management platform built on top of the blockchain system originally developed for the cryptocurrency bitcoin. As the paper characterizes it, a notational technology is the performance of syntactic notation within a field of reference, a technologized version of what Nelson Goodman called a “notational system.” Notational technologies produce abstracted entities through positive and reliable, or constitutive, tests of socially acceptable meaning. Accordingly, this account deviates from typical narratives of blockchains (usually characterized as Turing or state machines), instead demonstrating that blockchain technologies are effective at managing digital assets because they produce abstracted identities through the performance of notation. Since notational technologies rely on configurations of socially acceptable meaning, this paper also provides a philosophical account of how blockchain technologies are socially embedded.     

The relationship between the method of successive residuals and the method of exhaustion

The relationship between Horst's method of successive residuals and Gengerelli's method of exhaustion is demonstrated by transforming both methods intoL notation. TheL notation form is much more efficient computationally.     

Interacting plans

The paper explores certain phenomena which arise in stories, conversations, and human activity in general when the plans of two individuals are formed and carried out in an interactive situation. A notation system for representing interacting plans is introduced and applied in the analysis of a small portion of “Hansel and Gretel.” The analysis illustrates how a single actor plan can be modified by the needs of cooperative interaction with others and how cooperative interactive episodes can be transformed and used deceptively by one party in achieving his or her own covert goals.     

Philosophy,mathematics, science and computation

Attempts to lay a foundation for the sciences based on modern mathematics are questioned. In particular, it is not clear that computer science should be based on set-theoretic mathematics. Set-theoretic mathematics has difficulties with its own foundations, making it reasonable to explore alternative foundations for the sciences. The role of computation within an alternative framework may prove to be of great potential in establishing a direction for the new field of computer science.Whitehead's theory of reality is re-examined as a foundation for the sciences. His theory does not simply attempt to add formal rigor to the sciences, but instead relies on the methods of the biological and social sciences to construct his world-view. Whitehead's theory is a rich source of notions that are intended to explain every element of experience. It is a product of Whitehead's earlier attempt to provide a mathematical foundation for the physical sciences and is still consistent with modern physics.A computer simulation language is, in fact, a theory of reality; one that is often based on extremely simplistic notions. Simulation languages have evolved from the various programming languages and not from the development of their underlying world-view. The use of an established theory of reality, such as Whitehead's, as the basis of a simulation language is proposed as a way of extending the usefulness of computer simulation as an experimental tool for the theory.The simulation language is a first step in this direction. Based on Whitehead's notion of concrescence and a formalization in the typed -calculus, provides a notation and method for the construction and simulation of real-world phenomena. Both philosophy and computer science stand to benefit from such an attempt. Whitehead's theory gains a testing tool, while computer science gains a significantly more advanced simulation language. In philosophical discussion, the merest hint of dogmatic certainty as to the finality of statement is an exhibition of folly. A. N. Whitehead,Process and Reality.     

Asymmetries in the processing of Arabic digits and number words

Numbers can be represented as Arabic digits ("6") or as number words ("six"). The present study investigated potential processing differences between the two notational formats. In view of the previous finding (e.g., Potter & Faulconer, 1975) that objects are named slower, but semantically categorized faster, than corresponding words, it was investigated whether a similar interaction between stimulus format and task could be obtained with numbers. Experiment 1 established that number words were named faster than corresponding digits, but only if the two notation formats were presented in separate experimental blocks. Experiment 2 contrasted naming with a numerical magnitude judgment task and demonstrated an interaction between notation and task, with slower naming but faster magnitude judgment latencies for digits than for number words. These findings suggest that processing of the two notation formats is asymmetric, with digits gaining rapid access to numerical magnitude representations, but slower access to lexical codes, and the reverse for number words.     

Repetition priming in simple addition depends on surface form and typicality

Repetition priming and recognition memory for numbers were measured in four experiments using single-digit addition. Results of the first two experiments indicate that when numbers were presented as number words and dot configurations, preexposure of the same problem in the same notation produced greater reaction-time benefit than did preexposure of the same problem in Arabic-digit notation. In contrast, when numbers were presented as Arabic digits, preexposure of the same problem in Arabic digit, number word, and dot notation produced the same amount of priming. In the third experiment, priming was shown to be greatest, for all three notations, when the task performed on preexposure trials (addition or multiplication) matched the task performed on repetition trials (addition). Results of the fourth experiment, measuring recognition memory, were comparable to the priming results in the sense that memory was superior when notation matched across repetitions if the test involved number words and dot configurations but not Arabic digits. These data are interpreted in terms of models of numerical cognition, and they support the hypothesis that the influence of surface form on repetition priming depends on the typicality of the input for the task.     

Decoding Gentzen's Notation

In this note we consider Gentzen's first ordinal notation, used in his first published proof of the consistency of Peano Arithmetic (1936). It is a decimal notation, quite different from our current notations. We give a rule to translate this notation into our usual set-theoretic notation and we show some of its peculiarities. Then we indicate how to decode Gentzen's assignment of ordinal notations to derivations and give some examples. Finally, we go through his proof of their decrease after the application of his reduction procedure, giving further examples.