Information and the complementarity game

Complementarity games are explorative games between two players. The deterministic rules of the game are known to both players. The first player freely chooses among a finite number of states of the game but tells nobody of this decision. The second player accesses the game only by primitive, symbolic input‐output interfaces. The task of the second player is to find out the unknown state by input‐output experiments. The logic resulting from this scenario resembles‐ quantum logic in many aspects. It is the empirical logic of choice for virtual realities.     

A concept approach to input/output logic

This paper provides a semantics for input/input output logic based on formal concept analysis. The central result shows that an input/output logic axiomatised by a relation R is the same as the logic induced by deriving pairs from the concept lattice generated by R using a ∧- and ∨-classical Scott consequence relation. This correspondence offers powerful analytical techniques for classifying, visualising and analysing input/output relations, revealing implicit hierarchical structure and/or natural clusterings and dependencies. The application of all formal developments are illustrated by a worked example towards the end.     

Constraints for Input/Output Logics

In a previous paper we developed a general theory of input/output logics. These are operations resembling inference, but where inputs need not be included among outputs, and outputs need not be reusable as inputs. In the present paper we study what happens when they are constrained to render output consistent with input. This is of interest for deontic logic, where it provides a manner of handling contrary-to-duty obligations. Our procedure is to constrain the set of generators of the input/output system, considering only the maximal subsets that do not yield output conflicting with a given input. When inputs are authorised to reappear as outputs, both maxichoice revision in the sense of Alchourrón/Makinson and the default logic of Poole emerge as special cases, and there is a close relation with Reiter default logic. However, our focus is on the general case where inputs need not be outputs. We show in what contexts the consistency of input with output may be reduced to its consistency with a truth-functional combination of components of generators, and under what conditions constrained output may be obtained by a derivation that is constrained at every step.     

An optically isolated digital interface for the SKED system

A digital interface to support the SKED software system in recent versions of the PDP-8 computer. One printed circuit card of interface logic and optical isolators can be installed in the OMNIBUS to provide 24 input and 36 output lines to external panels containing input simulation switches and input or output indicators.     

The meaningful-based cognitive architecture model of schizophrenia

In subsymbolic operation of the Meaningful-Based Cognitive Architecture (MBCA) the input sensory vector is propagated through a hierarchy of Hopfield-like Network (HLN) functional groups, is recognized and may associatively trigger in the instinctual core goals module as well as in groups of HLNs arranged as pre-causal and pattern memory, vectors propagated to the output motor group of HLNs which produce an output signal. In full causal symbolic operation, the processed sensory input vector is also propagated to the logic/working memory groups of HLNs, where it can be compared to other vectors in the logic/working memory, and produce various outputs in response. The processed sensory input vector can trigger in the instinctual core goals module intuitive logic, intuitive physics, intuitive psychology and intuitive planning procedural vectors, as well as trigger in the causal group of HLNs learned logic, physics, psychology and planning procedural vectors which are also sent to the logic/working memory groups of HLNs. These circuits can allow the MBCA to act causally on information it has never seen before. An example is given of a Python simulation where the MBCA which is controlling a legged robot causally determines that a shallow whitewater river will cause water damage to itself, while if the MBCA is acting associatively only and never having seen whitewater before and normally crossing shallow rivers, will cross the whitewater river and become damaged. While the MBCA does not attempt to replicate biological systems at the neuronal spiking level, its HLNs and the organization of its HLNs are indeed inspired by biological mammalian minicolumns and mammalian brains. The MBCA model leads to the hypothesis that in the course of hominin evolution, HLNs became co-opted into groups of HLNs providing more extensive working memories with causal abilities, unlike non-hominins. While such co-option of the minicolumns can allow advantageous causal symbolic processing integrated with subsymbolic processing, the order of magnitude of increased complexity required for such organization and operation, created a vulnerability in the human brain to psychosis, which does not occur with significant prevalence in non-humans.     

Another inexpensive,efficient, solid state shock scrambler

This paper describes an inexpensive, solid state shock scrambler. The circuit employs TTL logic and mercury-wetted relays for quiet, reliable operation. The unit can control shock presentation to 16 grids and operates with an efficiency of 50%; for example, on any given clock pulse, 50% of the grids are positive and the other 50%, negative.     

Sets and Plural Comprehension

The state of affairs of some things falling under a predicate is supposedly a single entity that collects these things as its constituents. But whether we think of a state of affairs as a fact, a proposition or a possibility, problems will arise if we adopt a plural logic. For plural logic says that any plurality include themselves, so whenever there are some things, the state of affairs of their plural self-inclusion should be a single thing that collects them all. This leads to paradoxes analogous to those that afflict naïve set theory. Here I suggest that they are the very same paradoxes, because sets can be reduced to states of affairs. However, to obtain a consistent theoretical reduction we must restrict the usual axiom scheme of Comprehension for plural logic to ‘stratified’ formulas, to avoid viciously circular definitions. I prove that with this modification to the background plural logic, the theory of states of affairs is consistent; moreover, it yields the axioms of the familiar set theory NFU.     

多值逻辑与语义赋值博弈

文章在扩展博弈上,给出了多值逻辑的语义赋值博弈的一般框架,避免了博弈者在多值逻辑的语义博弈中声明无穷对象的问题;然后通过Eloise赢的策略定义博弈的语义概念——赋值,证明了多值逻辑的博弈语义与Tarski语义是等价的;最后,根据语义赋值博弈框架对经典逻辑进行了博弈化。     

Application of modal logic to programming

The modal logician's notion of possible world and the computer scientist's notion of state of a machine provide a point of commonality which can form the foundation of a logic of action. Extending ordinary modal logic with the calculus of binary relations leads to a very natural logic for describing the behavior of computer programs.This research was supported by NSF Grant No. MSC - 7804338.     

Editing silent hesitation from speech recordings

A simple method of increasing speech rate by shortening or removing silent hesitation from speech recordings is described. Two tape recorders and a voice key are used. The transmitting tape recorder is modified to have two playback heads in line. The onset and offset of speech signals fed from the first head, via a voice key, control the tape transport of the receiving tape recorder. The speech signals from the second playback head are fed directly to the line input of the receiving tape recorder. Time delays can be arranged so that the tape transport of the receiving machine is only in motion for the duration of the speech signals. The logic circuit of a suitable voice key with independently variable onset and offset delay times is also described.     

The logic of ‘being informed’ revisited and revised

The logic of ‘being informed’ gives a formal analysis of a cognitive state that does not coincide with either belief, or knowledge. To Floridi, who first proposed the formal analysis, the latter is supported by the fact that unlike knowledge or belief, being informed is a factive, but not a reflective state. This paper takes a closer look at the formal analysis itself, provides a pure and an applied semantics for the logic of being informed, and tries to find out to what extent the formal analysis can contribute to an information-based epistemology.     

Variable Priorities and Exclusionary Reasons in Input/Output Logic

Jörg Hansen, John Horty, and Xavier Parent and Leendert van der Torre have all recently described some sort of nonmonotonic logic to model reasons and their interactions. Horty’s framework is broader in scope than the other two, encompassing both reasoning about the relative strengths of reasons and reasoning about which reasons to consider in the first place. Hansen discusses a plethora of approaches and examples, including Horty’s, arguing that his preferred system best captures our intuitions. And Parent and van der Torre present a family of systems of input/output logic, which are in some ways the most flexible. In this paper, I aim to combine these features. Without attempting to answer the question of which intuitions are the best to capture, I first argue that there are good reasons to explore systems that behave more like Hansen’s than Horty’s. I then show that Parent and van der Torre’s framework of input/output logic can exactly duplicate Hansen’s system but is flexible enough to produce other results as well. Finally, I extend their framework to include the additional kinds of reasoning Horty discusses, showing that the resulting theory can handle a wider range of cases than Horty’s.     

A Sequent Formulation of Conditional Logic Based on Belief Change Operations

Peter Gärdenfors has developed a semantics for conditional logic, based on the operations of expansion and revision applied to states of information. The account amounts to a formalisation of the Ramsey test for conditionals. A conditional A > B is declared accepted in a state of information K if B is accepted in the state of information which is the result of revising K with respect to A. While Gärdenfors's account takes the truth-functional part of the logic as given, the present paper proposes a semantics entirely based on epistemic states and operations on these states. The semantics is accompanied by a syntactic treatment of conditional logic which is formally similar to Gentzen's sequent formulation of natural deduction rules. Three of David Lewis's systems of conditional logic are represented. The formulations are attractive by virtue of their transparency and simplicity.     

Toward a phenomenology of trance logic in posttraumatic stress disorder

Some induction procedures result in trance logic as an essential feature of hypnosis. Trance logic is a voluntary state of acceptance of suggestions without the critical evaluation that would destroy the validity of the meaningfulness of the suggestion. Induction procedures in real and simulated conditions induce a conflict between two contradictory messages in experimental hypnosis. In military induction the conflict is much more subtle involving society's need for security and its need for ethics. Such conflicts are often construed by the subject as trance logic. Trance logic provides an opportunity for therapists using the phenomenology of "presence" to deal with the objectified concepts of "avoidance," "numbing" implicit in this kind of dysfunctional thinking in Posttraumatic Stress Disorder. An individual phenomenology of induction procedures and suggestions, which trigger trance logic, may lead to a resolution of logical fallacies and recurring painful memories. It invites a reconciliation of conflicting messages implicit in phobias and avoidance traumas. Such a phenomenological analysis of trance logic may well be a novel approach to restructure the meaning of trauma.     

A Formal Characterisation of Hamblin’s Action-State Semantics

Hamblin’s Action-State Semantics provides a sound philosophical foundation for understanding the character of the imperative. Taking this as our inspiration, in this paper we present a logic of action, which we call ST, that captures the clear ontological distinction between being responsible for the achievement of a state of affairs and being responsible for the performance of an action. We argue that a relativised modal logic of type RT founded upon a ternary relation over possible worlds integrated with a basic tense logic captures intuitions of the Hamblinian model of imperatives. The logic implements a direct mapping of each of Hamblin’s key concepts: strategies, partial strategies and wholehearted satisfaction.     

Bilattices with Implications

In a previous work we studied, from the perspective of Abstract Algebraic Logic, the implicationless fragment of a logic introduced by O. Arieli and A. Avron using a class of bilattice-based logical matrices called logical bilattices. Here we complete this study by considering the Arieli-Avron logic in the full language, obtained by adding two implication connectives to the standard bilattice language. We prove that this logic is algebraizable and investigate its algebraic models, which turn out to be distributive bilattices with additional implication operations. We axiomatize and state several results on these new classes of algebras, in particular representation theorems analogue to the well-known one for interlaced bilattices.     

An accurate repeat cycle timer.

This timer was designed to provide a compact and quiet unit to control the presentation of visual stimuli by means of a slide projector, but it is not limited to this use. It is a solid state device, ready for use as soon as switched on, and is made largely from commercial logic units. The output is in the form of contact closures: the ON relay and the OFF relay give short pulse closures at the beginning of their respective cycles. With circuit values as shown in Fig. 1, times, from 0.5 to 10 sec in increments of 0.5 sec with an accuracy of ±1%, are selected by separate switches on the ON and the OFF cycles. Single interval solid state timers have been described by Saslow and Markowitz (1964) and by Tapp and Clark (1964).     

走向模型论的模态逻辑

增加特定的基数量词,扩张一阶语言,就可以导致实质性地增强语言的表达能力,这样许多超出一阶逻辑范围的数学概念就能得到处理。由于在模型的层次上基本模态逻辑可以看作一阶逻辑的互模拟不变片断,显然它不能处理这些数学概念。因此,增加说明后继状态类上基数概念的模态词,原则上我们就能以模态的方式处理所有基数。我们把讨论各种模型论逻辑的方式转移到模态方面。