Dynamic Predicate Logic (DPL) is a variant of Predicate Logic introduced by Groenendijk and Stokhof. One rationale behind the introduction of DPL is that it is closer to Natural Language than ordinary Predicate Logic in the way it treats scope.In this paper I develop some variants of DPL that can more easily approximate Natural Language in some further aspects. Specifically I add flexibility in the treatment of polarity and and some further flexibility in the treatment of scope.I develop a framework (...) that is intended to encourage further experimentation with alternative variants of DPL. In this framework the new meanings are, roughly,indexed sets of old meanings. The indices can be viewed as "files'' or "storage devices.''Each such file supports a separate "information stream.''The interaction of the new meanings is "programmed'' with the help of certain monoids acting on the indices. The construction of the new meanings can be viewed as an application of the Grothendieck Construction to monoids. (shrink)

A symmetric monoidal category naturally arises as the mathematical structure that organizes physical systems, processes, and composition thereof, both sequentially and in parallel. This structure admits a purely graphical calculus. This paper is concerned with the encoding of a fixed causal structure within a symmetric monoidal category: causal dependencies will correspond to topological connectedness in the graphical language. We show that correlations, either classical or quantum, force terminality of the tensor unit. We also show that well-definedness of the (...) concept of a global state forces the monoidal product to be only partially defined, which in turn results in a relativistic covariance theorem. Except for these assumptions, at no stage do we assume anything more than purely compositional symmetric-monoidal categorical structure. We cast these two structural results in terms of a mathematical entity, which we call a causal category . We provide methods of constructing causal categories, and we study the consequences of these methods for the general framework of categorical quantum mechanics. (shrink)

The concept of process is ubiquitous in science, engineering and everyday life. Category theory, and monoidal categories in particular, provide an abstract framework for modelling processes of many kinds. In this paper, we concentrate on sequential and parallel decomposability of processes in the framework of monoidal categories: We will give a precise definition, what it means for processes to be decomposable. Moreover, through examples, we argue that viewing parallel processes as coupled in this framework can be seen as (...) a category mistake or a misinterpretation. We highlight the suitability of category theory for a structuralistic interpretation of mathematical modelling and argue that for appliers of mathematics, such as engineers, there is a pragmatic advantage from this. (shrink)

Local deterministic string-to-string transductions arise in natural language processing (NLP) tasks such as letter-to-sound translation or pronunciation modeling. This class of transductions is a simple generalization of morphisms of free monoids; learning local transductions is essentially the same as inference of certain monoid morphisms. However, learning even a highly restricted class of morphisms, the so-called fine morphisms, leads to intractable problems: deciding whether a hypothesized fine morphism is consistent with observations is an NP-complete problem; and maximizing classification accuracy of (...) the even smaller class of alphabetic substitution morphisms is APX-hard. These theoretical results provide some justification for using the kinds of heuristics that are commonly used for this learning task. (shrink)

There is currently much interest in bringing together the tradition of categorial grammar, and especially the Lambek calculus, with the recent paradigm of linear logic to which it has strong ties. One active research area is designing non-commutative versions of linear logic (Abrusci, 1995; Retoré, 1993) which can be sensitive to word order while retaining the hypothetical reasoning capabilities of standard (commutative) linear logic (Dalrymple et al., 1995). Some connections between the Lambek calculus and computations in groups have long been (...) known (van Benthem, 1986) but no serious attempt has been made to base a theory of linguistic processing solely on group structure. This paper presents such a model, and demonstrates the connection between linguistic processing and the classical algebraic notions of non-commutative free group, conjugacy, and group presentations. A grammar in this model, or G-grammar is a collection of lexical expressions which are products of logical forms, phonological forms, and inverses of those. Phrasal descriptions are obtained by forming products of lexical expressions and by cancelling contiguous elements which are inverses of each other. A G-grammar provides a symmetrical specification of the relation between a logical form and a phonological string that is neutral between parsing and generation modes. We show how the G-grammar can be oriented for each of the modes by reformulating the lexical expressions as rewriting rules adapted to parsing or generation, which then have strong decidability properties (inherent reversibility). We give examples showing the value of conjugacy for handling long-distance movement and quantifier scoping both in parsing and generation. The paper argues that by moving from the free monoid over a vocabulary V (standard in formal language theory) to the free group over V, deep affinities between linguistic phenomena and classical algebra come to the surface, and that the consequences of tapping the mathematical connections thus established can be considerable. (shrink)

In the categorical approach to the foundations of quantum theory, one begins with a symmetric monoidal category, the objects of which represent physical systems, and the morphisms of which represent physical processes. Usually, this category is taken to be at least compact closed, and more often, dagger compact, enforcing a certain self-duality, whereby preparation processes (roughly, states) are interconvertible with processes of registration (roughly, measurement outcomes). This is in contrast to the more concrete “operational” approach, in which the states (...) and measurement outcomes associated with a physical system are represented in terms of what we here call a convex operational model: a certain dual pair of ordered linear spaces–generally, not isomorphic to one another. On the other hand, state spaces for which there is such an isomorphism, which we term weakly self-dual, play an important role in reconstructions of various quantum-information theoretic protocols, including teleportation and ensemble steering. In this paper, we characterize compact closure of symmetric monoidal categories of convex operational models in two ways: as a statement about the existence of teleportation protocols, and as the principle that every process allowed by that theory can be realized as an instance of a remote evaluation protocol—hence, as a form of classical probabilistic conditioning. In a large class of cases, which includes both the classical and quantum cases, the relevant compact closed categories are degenerate, in the weak sense that every object is its own dual. We characterize the dagger-compactness of such a category (with respect to the natural adjoint) in terms of the existence, for each system, of a symmetric bipartite state, the associated conditioning map of which is an isomorphism. (shrink)

We study the monoid of global invariant types modulo domination-equivalence in the context of o-minimal theories. We reduce its computation to the problem of proving that it is generated by classes...

Monoidal triangular norm logic MTL is the logic of left-continuous triangular norms. In the paper we present a relational formalization of the logic MTL and then we introduce relational dual tableau that can be used for verification of validity of MTL-formulas. We prove soundness and completeness of the system.

Monoidal logics were introduced as a foundational framework to analyse the proof theory of deontic logic. Building on Lambek’s work in categorical logic, logical systems are defined as deductive systems, that is, as collections of equivalence classes of proofs satisfying specific rules and axiom schemata. This approach enables the classification of deductive systems with respect to their categorical structure. When looking at their proof theory, however, one can see that there are similarities between monoidal and substructural logics. The (...) purpose of the present paper is to address this issue and highlight the differences between these two approaches. We argue that monoidal logics provide a more flexible foundational framework that enables a finer analysis of the relationship between negation and other logical connectives. We show that the elimination of double negation is independent from the de Morgan dualities, that monoidal deductive systems are not necessarily weakly distributive and that deduc... (shrink)

Let l be a commutative field; Bauval [1] showed that the theory of the ring l[X1,...,Xm] is the same as the weak second-order theory of the field l. Now, l[X1,...,Xm] is the ring of the monoid m, so it may be asked what properties of m we can deduce from the theory of l[;m], that is, if l[m] is elementarily equivalent to the ring of monoid k[G], with k, a field and G, a monoid, what do we know not only (...) about the first-order theory of G but also about more properties of G. We prove that in this case G is isomorphic to m.Bauval [1, Theorem V.2.1] proved that if a factorial ring A is elementarily equivalent to l[;X1,...,Xm], then A is isomorphic to F[X1,...,Xm], with F being the field of invertible elements of A.Our result is different from this property because, a priori, the field k is not the field of invertible elements . Furthermore, k[G]; is not always factorial or Neotherian: if G is isomorphic to the cartesian product ∏i<ω, then the number of irreducible elements that divide elements that divide X is infinite, and the ideal generated by the monomials X is not finitely generated.We recall that to be factorial of Neotherian are not elementary properties. (shrink)

Each Girard quantale (i.e., commutative quantale with a selected dualizing element) provides a support for a semantics for linear propositional formulas (but not for linear derivations). Several constructions of Girard quantales are known. We give two more constructions, one using an arbitrary partially ordered monoid and one using a partially ordered group (both commutative). In both cases the semantics can be controlled be a relation between pairs of elements of the support and formulas. This gives us a neat way of (...) handling duality. (shrink)

The notion of a natural numbers object in a monoidal category is defined and it is shown that the theory of primitive recursive functions can be developed. This is done by considering the category of cocommutative comonoids which is cartesian, and where the theory of natural numbers objects is well developed. A number of examples illustrate the usefulness of the concept.

The variety DMM of De Morgan monoids has just four minimal subvarieties. The join-irreducible covers of these atoms in the subvariety lattice of DMM are investigated. One of the two atoms consisting of idempotent algebras has no such cover; the other has just one. The remaining two atoms lack nontrivial idempotent members. They are generated, respectively, by 4-element De Morgan monoids C4 and D4, where C4 is the only nontrivial 0-generated algebra onto which finitely subdirectly irreducible De Morgan monoids may (...) be mapped by noninjective homomorphisms. The homomorphic preimages of C4 within DMM constitute a proper quasivariety, which is shown to have a largest subvariety U. The covers of the variety within U are revealed here. There are just ten of them. In exactly six of these ten varieties, all nontrivial members have C4 as a retract. In the varietal join of those six classes, every subquasivariety is a variety—in fact, every finite subdirectly irreducible algebra is projective. Beyond U, all covers of [or of ] within DMM are discriminator varieties. Of these, we identify infinitely many that are finitely generated, and some that are not. We also prove that there are just 68 minimal quasivarieties of De Morgan monoids. (shrink)

This paper develops the basics of the theory of involutive categories and shows that such categories provide the natural setting in which to describe involutive monoids. It is shown how categories of Eilenberg-Moore algebras of involutive monads are involutive, with conjugation for modules and vector spaces as special case. A part of the so-called Gelfand–Naimark–Segal (GNS) construction is identified as an isomorphism of categories, relating states on involutive monoids and inner products. This correspondence exists in arbritrary involutive symmetric monoidal (...) categories. (shrink)

The paper deals with involutive FLe-monoids, that is, commutative residuated, partially-ordered monoids with an involutive negation. Involutive FLe-monoids over lattices are exactly involutive FLe-algebras, the algebraic counterparts of the substructural logic IUL. A cone representation is given for conic involutive FLe-monoids, along with a new construction method, called twin-rotation. Some classes of finite involutive FLe-chains are classified by using the notion of rank of involutive FLe-chains, and a kind of duality is developed between positive and non-positive rank algebras. As a (...) side effect, it is shown that the substructural logic IUL plus t ↔ f does not have the finite model property. (shrink)

We show how to reconstruct the topology on the monoid of endomorphisms of the rational numbers under the strict or reflexive order relation, and the polymorphism clone of the rational numbers under the reflexive relation. In addition we show how automatic homeomorphicity results can be lifted to polymorphism clones generated by monoids.

Dynamical systems are mathematical structures whose aim is to describe the evolution of an arbitrary deterministic system through time, which is typically modeled as (a subset of) the integers or the real numbers. We show that it is possible to generalize the standard notion of a dynamical system, so that its time dimension is only required to possess the algebraic structure of a monoid: first, we endow any dynamical system with an associated graph and, second, we prove that such a (...) graph is a category if and only if the time model of the dynamical system is a monoid. In addition, we show that the general notion of a dynamical system allows us not only to define a family of meaningful dynamical concepts, but also to distinguish among a cluster of otherwise tangled notions of reversibility, whose logical relationships are finally analyzed. (shrink)

We study the monoid of primitive recursive functions and investigate a onestep construction of a kind of exact completion, which resembles that of the familiar category of modest sets, except that the partial equivalence relations which serve as objects are recursively enumerable. As usual, these constructions involve the splitting of symmetric idempotents.

It is proved that all the isomorphisms in the cartesian category freely generated by a set of objects (i.e., a graph without arrows) can be written in terms of arrows from the symmetric monoidal category freely generated by the same set of objects. This proof yields an algorithm for deciding whether an arrow in this free cartesian category is an isomorphism.

The endomorphism monoid of a model-theoretic structure carries two interesting topologies: on the one hand, the topology of pointwise convergence induced externally by the action of the endomorphisms on the domain via evaluation; on the other hand, the Zariski topology induced within the monoid by (non-)solutions to equations. For all concrete endomorphism monoids of $\omega $ -categorical structures on which the Zariski topology has been analysed thus far, the two topologies were shown to coincide, in turn yielding that the pointwise (...) topology is the coarsest Hausdorff semigroup topology on those endomorphism monoids. We establish two systematic reasons for the two topologies to agree, formulated in terms of the model-complete core of the structure. Further, we give an example of an $\omega $ -categorical structure on whose endomorphism monoid the topology of pointwise convergence and the Zariski topology differ, answering a question of Elliott, Jonušas, Mitchell, Péresse, and Pinsker. (shrink)

ABSTRACTMonoidal logics were introduced as a foundational framework to analyze the proof theory of logical systems. Inspired by Lambek's seminal work in categorical logic, the objective is to defin...

It is shown that given any finite system of monoid identities, it is decidable if the class of locally finite monoids that satisfy the system is a variety. This answers an open problem of Mark V. Sapir.

A central question in online human sentence comprehension is, “How are linguistic relations established between different parts of a sentence?” Previous work has shown that this dependency resolution process can be computationally expensive, but the underlying reasons for this are still unclear. This article argues that dependency resolution is mediated by cue‐based retrieval, constrained by independently motivated working memory principles defined in a cognitive architecture. To demonstrate this, this article investigates an unusual instance of dependency resolution, the processing of (...) negative and positive polarity items, and confirms a surprising prediction of the cue‐based retrieval model: Partial‐cue matches—which constitute a kind of similarity‐based interference—can give rise to the intrusion of ungrammatical retrieval candidates, leading to both processing slow‐downs and even errors of judgment that take the form of illusions of grammaticality in patently ungrammatical structures. A notable achievement is that good quantitative fits are achieved without adjusting the key model parameters. (shrink)

On the views of Alfred North Whitehead, 1861-1947, on process philosophy.

The monoidal t-norm based logic MTL is obtained from Hájek''s Basic Fuzzy logic BL by dropping the divisibility condition for the strong (or monoidal) conjunction. Recently, Jenei and Montgana have shown MTL to be standard complete, i.e. complete with respect to the class of residuated lattices in the real unit interval [0,1] defined by left-continuous t-norms and their residua. Its corresponding algebraic semantics is given by pre-linear residuated lattices. In this paper we address the issue of standard and (...) rational completeness (rational completeness meaning completeness with respect to a class of algebras in the rational unit interval [0,1]) of some important axiomatic extensions of MTL corresponding to well-known parallel extensions of BL. Moreover, we investigate varieties of MTL algebras whose linearly ordered countable algebras embed into algebras whose lattice reduct is the real and/or the rational interval [0,1]. These embedding properties are used to investigate finite strong standard and/or rational completeness of the corresponding logics. (shrink)

In the last decades philosophers of science and social scientists promoted the view that knowledge of mechanisms might help causal inference considerably in the social sciences. Mechanisms, however, can only assist causal inference effectively if scientists have a means to identify them correctly. Some scholars suggested that process-tracing might be a helpful strategy in this respect. Shared criteria to assess its performance, however, are not available yet; furthermore, the criteria proposed so far tie the validity of process-tracing findings to the (...) specific kind of evidence it uses. In this paper I shall propose a criterion to assess process-tracing performance in cases in which favorable epistemic circumstances do not occur and the existing criteria thus fail to apply. The criterion I propose does not double as a condition for validity. Rather, it aims to assess whether the mechanism process-tracing outlines constitutes admissible evidence for the hypothesis at hand. It will be argued that only if this requirement is fulfilled process-tracing can be used as an effective complement for causal inference. (shrink)

Dual-process and dual-system theories in both cognitive and social psychology have been subjected to a number of recently published criticisms. However, they have been attacked as a category, incorrectly assuming there is a generic version that applies to all. We identify and respond to 5 main lines of argument made by such critics. We agree that some of these arguments have force against some of the theories in the literature but believe them to be overstated. We argue that the dual- (...) class='Hi'>processing distinction is supported by much recent evidence in cognitive science. Our preferred theoretical approach is one in which rapid autonomous processes are assumed to yield default responses unless intervened on by distinctive higher order reasoning processes. What defines the difference is that Type 2 processing supports hypothetical thinking and load heavily on working memory. (shrink)

A new process philosophy of signs, where process becomes primary, and fixed relation secondary'Behind Red Doors - Signs, Process and the Political' - a post by James Williams on the Edinburgh University Press blogWhat is a sign? We usually think that it is a fixed relation: a red light signifies 'Stop'. In his bold new book, James Williams now argues that signs are varying processes: seeing the red light triggers a creative response to the question, Should I stop?Williams develops this (...) new process philosophy of signs through a formal model, in contrast to earlier structuralist definitions. He draws on the philosophies of Deleuze and Whitehead, criticises earlier work on the sign in biology by Jakob von Uexküll, and connects to contemporary work on process in the philosophy of biology by John Dupré.The process model has wide applications in the arts, humanities and social sciences, and informs their critical debates with science. In defining the sign as essentially political, this radical definition of the sign opens up new possibilities for social and political critique.". (shrink)

Leading scholars explore the relationship between deconstructive theory and process thought.

We use a new version of the Definability Theorem of Beth in order to unify classical theorems of Yuri Matiyasevich and Jan Denef in one structural statement. We give similar forms for other important definability results from Arithmetic and Number Theory.

An integral subresiduated lattice ordered commutative monoid (or integral srl-monoid for short) is a pair $({\textbf {A}},Q)$ where ${\textbf {A}}=(A,\wedge,\vee,\cdot,1)$ is a lattice ordered commutative monoid, 1 is the greatest element of the lattice $(A,\wedge,\vee )$ and _Q_ is a subalgebra of _A_ such that for each $a,b\in A$ the set $\{q \in Q: a \cdot q \le b\}$ has maximum, which will be denoted by $a\rightarrow b$. The integral srl-monoids can be regarded as algebras $(A,\wedge,\vee,\cdot,\rightarrow,1)$ of type (2, 2, (...) 2, 2, 0). Furthermore, this class of algebras is a variety which properly contains the varieties of integral commutative residuated lattices and subresiduated lattices respectively. In this paper we study the quasivariety of $\{\wedge,\cdot,\rightarrow,1\}$ -subreducts of integral srl-monoids, which will be denoted by $\mathsf {SR^s}$. In particular, we show that $\mathsf {SR^s}$ is a variety. We also characterize simple and subdirectly irreducible algebras of $\mathsf {SR^s}$ respectively. Finally, through a Hilbert style system, we present a logic which has as algebraic semantics the variety $\mathsf {SR^s}$ and we apply this result in order to present an expansion of the previous logic which has as algebraic semantics the variety of integral srl-monoids. (shrink)

Using process philosophy, especially its view of nature and its ethic, we develop a process-based environmental ethic embodying minimalism and beneficience. From this perspective, we criticize the philosophy currently underlying public policy and examine some alternative approaches based on phenomenology and ethnomethodology. We conclude that process philosophy, minus its value hierarchy, is a powerful tool capable of supporting both radical and n10derate changes in environmental policy.

Every transformation monoid comes equipped with a canonical topology, the topology of pointwise convergence. For some structures, the topology of the endomorphism monoid can be reconstructed from its underlying abstract monoid. This phenomenon is called automatic homeomorphicity. In this paper we show that whenever the automorphism group of a countable saturated structure has automatic homeomorphicity and a trivial center, then the monoid of elementary self-embeddings has automatic homeomorphicity, too. As a second result we strengthen a result by Lascar by showing (...) that whenever \ is a countable \-categorical G-finite structure whose automorphism group has a trivial center and if \ is any other countable structure, then every isomorphism between the monoids of elementary self-embeddings is a homeomorphism. (shrink)

PROCESS THOUGHT Edited by Nicholas Rescher • Johanna Seibt • Michel Weber Advisory Board Mark Bickhard • Jaime Nubiola • Roberto Poli Volume 14 ...

This volume answers the question: Why do we believe what we believe? It examines current research on the concept of beliefs, and the development in our understanding of the process of believing. It takes into account empirical findings in the field of neuroscience regarding the processes that underlie beliefs, and discusses the notion that beyond the interactive exploratory analysis of sensory information from the complex outside world, humans engage in an evaluative analysis by which they attribute personal meaning and relevance (...) to the probabilistic representations of objects and events. Beliefs exert a strong influence on behaviour, decision-making, and identifying and solving problems. Despite their importance, beliefs have until recently not been at the centre of scientific interest. In fact, "belief" is an ill-defined phenomenon. From a transdisciplinary perspective the actual approaches to understanding belief seem incompatible as they attempt to highlight such different topics as "belief - religion", "belief - spirituality", "belief - faith", "belief - knowledge", "belief - attitude", "belief - disbelief", "belief - illusion", and "believing - brain function". This situation contradicts the idea that belief is close to pathological phenomena and that it should be eliminated from scientific discussions. Rather, believing is fundamental for understanding the many problems of every-day life. In fact, the book shows that beliefs are relevant for politics, international affairs, economy, law, or religions also in modern societies. This book presents the increasing scientific interest in beliefs and believing, and reflects the change in focus from the content aspect of belief towards the fluid nature of believing. (shrink)

The aim of the paper is to explore and assess the process of responsibility, decoupling point, and disengagement of moral responsibility, in combination with business sustainability in supply chains. The research is based on a qualitative approach consisting of two multifaceted case studies, each including multiple case companies and different empirical research characteristics, and a review of BSus in supply chain literature. The case studies apply moral disengagement to propose how moral responsibility can deteriorate in supply chains, and the literature (...) review identifies elements of BSus in supply chain management. The contribution of this paper is to compare these two research streams and evaluate the efficacy of the concepts proposed in the case studies. Through this study, BSus gains an entirely different and complementary toolkit which should facilitate further and more effective research in SCM. The theory of MDis also provides a foundation for reinforcing explanatory and prescriptive aspects of ‘best practices’ in the SCM literature. The findings also establish a basis for organizing and monitoring supply chains so as to improve BSus efforts. Considering moral responsibility as a flow this research explains why and how certain practices may impede BSus efforts in supply chains. Original and/or innovative outcomes include explanatory and prescriptive insights that emerge from a combination of empirical findings from two case studies, including seven companies and a framework for improving BSus management in supply chains, based on a typology of moral disengagement. (shrink)

This paper presents the algebraic and Kripke modelsoundness and completeness ofa logic over Boolean monoids. An additional axiom added to thelogic will cause the resulting monoid models to be representable as monoidsof relations. A star operator, interpreted as reflexive, transitiveclosure, is conservatively added to the logic. The star operator isa relative modal operator, i.e., one that is defined in terms ofanother modal operator. A further example, relative possibility,of this type of operator is given. A separate axiom,antilogism, added to the logic (...) causes the Kripke models to support acollection of abstract topological uniformities which become concretewhen the Kripke models are dual to monoids of relations. The machineryfor the star operator is shownto be a recasting of Scott-Montague neighborhood models. An interpretationof the Kripke frames and properties thereof is presented in terms ofcertain CMOS transister networks and some circuit transformation equivalences.The worlds of the Kripke frame are wires and the Kripke relation is a specializedCMOS pass transistor network. (shrink)

A construction is described of a cartesian closed category A with exactly two elements out of a C-monoid such that can be recovered from A without reference to the construction.

_Process Philosophy_ surveys the basic issues and controversies surrounding the philosophical approach known as “process philosophy.” Process philosophy views temporality, activity, and change as the cardinal factors for our understanding of the real—process has priority over product, both ontologically and epistemically. Rescher examines the movement’s historical origins, reflecting a major line of thought in the work of such philosophers as Heracleitus, Leibniz, Bergson, Peirce, William James, and especially A. N. Whitehead. Reacting against the tendency to associate process philosophy too closely (...) with this last-named thinker, Rescher writes, “Indeed, one cardinal task for the partisans of process at this particular juncture of philosophical history is to prevent the idea of ‘process philosophy’ from being marginalized through a limitation of its bearing to the work and influence of any one single individual or group.” This book will appeal to both students and professors of philosophy. Those teachers who have not been trained in process philosophy will welcome this new text by one one of North America’s foremost philosophers as a perspicuous and informative introduction. (shrink)

(1996). Business process change: A systems thinking perspective. World Futures: Vol. 47, Unity and Diversity in Contemporary Systems Tinking: Systematic Pictures at an Exhibition, pp. 69-77.

Mental Processes in the Human Brain provides an integrative overview of the rapid advances and future challenges in understanding the neurobiological basis of mental processes that are characteristically human. With chapters from leading figures in the brain sciences, it will be essential for all those in the cognitive and brain sciences.

The idea that cognitive processes can be meaningfully classified as conscious or unconscious has a long history in philosophy and psychology. However, even though many experimental reports during the past 100 years claim to demonstrate perception, Ieaming, or memory without conscious awareness, the distinction between conscious and unconscious ’ processes remains highly controversial. For example, the same empirical findings that Holender 1986 concludes provide little or no evidence for unconscious perception are considered by other reviewers as conclusive and overwhelming documentation (...) of the validity of perception without awareness. (shrink)

Process and Reality, Whitehead’s magnum opus, is one of the major philosophical works of the modern world, and an extensive body of secondary literature has developed around it. Yet surely no significant philosophical book has appeared in the last two centuries in nearly so deplorable a condition as has this one, with its many hundreds of errors and with over three hundred discrepancies between the American and the English editions, which appeared in different formats with divergent paginations. The work itself (...) is highly technical and far from easy to understand, and in many passages the errors in those editions were such as to compound the difficulties. The need for a corrected edition has been keenly felt for many decades. (shrink)

This book, first published in 1992, attempts to unify the economic analysis of the production process in order to understand the effects of technical change. It is both an analytical representation of the production process, taking into account the temporal, organizational, and qualitative dimensions of production, and a fact-finding model for studying the economic effects of technical change. The inclusion of temporal and organizational aspects allows the author to examine the analytical implications of research on the nature of firms and (...) the characteristics of technical change, whilst the model is used to analyse technical changes that involve variations of scale or degrees of flexibility. This book deals with themes much discussed in research in industrial economics and management studies and is an important contribution to bringing these two areas of research closer together, providing a general framework for the study of production processes. (shrink)

Eichenbaum et al. (1994a) hypothesized that perceptually distinct items and the relations among them are processed sequentially by the parahippocampal region and the hippocampal formation, respectively. Predictions based solely on their model's sequential-processing feature might prove easier to disconfirm than those based on its representational features. Two such predictions are discussed: (1) double dissociations should be impossible following hippocampal vs. parahippocampal lesions, and (2) hippocampal lesions should not exacerbate impairments that follow complete parahippocampal lesions.