Armstrong holds the Supervenience Theory of instantiation, namely that the instantiation of universals by particulars supervenes upon what particulars and what universals there are, where supervenience is stipulated to be explanatory or dependent supervenience. I begin by rejecting the Supervenience Theory of instantiation. Having done so it is then tempting to take instantiation as primitive. This has, however, an awkward consequence, undermining one of the main advantages universals have over tropes. So I examine another account hinted at by (...) Armstrong. This is the Operator Theory of instantiation, by which I mean the theory that universals are operators, and that a particular instantiates a monadic universal because the universal operates on the particular, resulting in the state of affairs. On this theory the state of affairs supervenes on the instantiation rather than vice versa. In the second part of the paper I develop this theory of universals as operators, including an account of structural universals, which are useful for accounts of modality and of mathematics. (shrink)

The proposed heavy dependence on Pavlovian conditioning to account for social behavior confounds phylogenically and ontogenically selected behavior patterns and ignores the extension of the principle of selection by consequences from biological to learning theory. Instead of acknowledging operant relations, Domjan et al. construct vaguely specified mechanisms based upon anticipatory cost-benefit considerations that are not supported by the Pavlovian conditioning literature.

The research Nevin & Grace report is impressive in its integrative power, but it also shows the current limits of operant theory: There is tremendous concentration on understanding how existing behavioral relations are modulated in rate or time allocation, but little on dealing with the origin of the behavioral relations themselves. Specifying what should count as a behavioral unit will require source principles sensitive to the composition of the units being related.

Attempts to define life should focus on the transition from molecules to cells and the “closure” aspects of this event. Rather than classifying existing objects into living and non-living entities I believe the challenge is to understand how the transition from non-life to life can take place, that is, the how the closure in Jagers op Akkerhuis’s hierarchical classification of operators, comes about.

In this paper, we investigate the constitutive problems and other several aspects of what a research entitled 'formal epistemology' should be. The interest in this subject has to do with the possibility of reaching a privileged point of view or axis of research - i.e., the 'formal' one - that would allow, a better grasp of the richness and variety of the facts and problems tackled by precise (local) epistemology of theories (for example, in physics). This approach is likely to (...) enable one to hold the main structural lines that organize those theories according to a more com prehensive, unifying and synthetic intelligibilit. By the same token, it would eventually allow a better handling of the changes required in the organization of knowledge, putting emphasis on its main directions, drawing up a rational inventory of this knowledge, and perhaps anticipating others. At first, we deal with the `thought of changes' that no approach of the 'form' can afford to leave aside, since the meaning of this concept is inseparable from the contents that come with constructions and modifications. We examine then the notion of 'epistemic operation' as an instrument to create new forms on the theoretical as well as on the meta-theoretical levels. ln the wake of it, we analyze the characteristics of the form and of the formal, as well as their relationship with the contents of knowledge. We also take the notion of object into account, since it depends upon the decision of a subject and upon conventional choices. We finally inquire about the link between `epistemic operations' as specified above and algorithmic functions for knowledge statements, and emphasize the risk of reductionism that might follow from a naturalistic conception of representation. (shrink)

Current, prevalent models of the food system, including complex-adaptive systems theories and commodity-as-relation thinking, have usefully analyzed the food system in terms of its elements and relationships, confronting persistent questions about a system’s identity and leverage points for change. Here, inspired by Heldke’s analysis, we argue for another approach to the “system-ness” of food that carries those key questions forward. Drawing on Niklas Luhmann’s systems theory, we propose a model of the food system defined by the relational process of (...) feeding itself; that is, the food system is made of feeding and only feeding, and system structures are produced by the coupling of that process to its various contexts. We argue that this approach moves us away from understandings of the food system that take structures and relations as given, and sees them instead as contingent, thereby helping to identify leverage points for food system change. The new approach we describe also prompts us as critical agrifood scholars to be constantly reflexive about how our analyses are shaped by our own assumptions and subjectivities. (shrink)

Fara and Williamson (Mind, 2005) argue that counterpart theory is unable to account for modal claims that use an actuality operator. This paper argues otherwise. Rather than provide a different counterpart translation of the actuality operator itself, the solution presented here starts out with a quantified modal logic in which the actuality operator is redundant, and then translates the sentences of this logic into claims of counterpart theory.

In this paper we review the general framework of operational probabilistic theories, along with the six axioms from which quantum theory can be derived. We argue that the OPT framework along with a relaxed version of five of the axioms, define a general information theory. We close the paper with considerations about the role of the observer in an OPT, and the interpretation of the von Neumann postulate and the Schrödinger-cat paradox.

We have seen that the operational imperative is a prescriptive thesis about formulations of theories which imposes restrictions on the sorts of theories science may employ. We assessed the operational imperative by investigating a number of relationships holding between theory formulations, theories, physical systems, and phenomena, and then applying our findings to the operational imperative. These applications showed that the operational definitions required by the operational imperative were not definitions at all, being rather statements of putative empirical regularities holding (...) between particulars which in effect are formulations of empirically true or false theories. From this fact it followed that the supposed epistemic pay-offs of following the operational imperative fail to accrue: Operational definitions do not enable one to go deductively from knowledge of observables to knowledge of unobservables, and operational definitions do not provide a means for testing theories about unobservable phenomena. As such the operational imperative should be rejected in both its weak and strong versions. However, we did discover a grain of truth in the observational imperative — namely that theories with non-observable parameters are testable only if these parameters have observable manifestations. But that grain of truth does not lead to the operational imperative as typically advanced unless one embraces certain epistemological theories about observation which recent work on observation makes highly doubtful. (shrink)

We ponder about the kind of problems and perspectives of a “formalized epistemology”, by considering the advantages than one can get from a concern with the “formal”, with its structural orientation, that would favour comprehensive, unifying and synthetic, intelligibility. We confront this perspective with that of the changes in knowledge, considering the relation between form and meaning for knowledge contents, and examine the notion of “epistemic operation” as instrumental for creating new forms, at the theoretical and meta-theoretical levels. Actually, the (...) notions of form, of formal and of object are not independent of the problem of a subject that decides on conventions and choices. “Epistemic operations” might suggest a link with “algorithmic functions” for knowledge statements, that themselves entail the risk of reductionism in a naturalistic conception of representation. (shrink)

The general aim of this book is to provide an elementary exposition of some basic concepts in terms of which both classical and non-dassicallogirs may be studied and appraised. Although quantificational logic is dealt with briefly in the last chapter, the discussion is chiefly concemed with propo gjtional cakuli. Still, the subject, as it stands today, cannot br covered in one book of reasonable length. Rather than to try to include in the volume as much as possible, I have put (...) emphasis on some selected topics. Even these could not be roverrd completely, but for each topic I have attempted to present a detailed and precise t’Xposition of several basic results including some which are non-trivial. The roots of some of the central ideas in the volume go back to J. Luka siewicz’s seminar on mathematicallogi. (shrink)

We study a theory PTO of polynomial time computability on the type of binary strings, as embedded in full lambda calculus with total application and extensionality. We prove that the closed terms of type W → W are exactly the polynomial time operations. This answers a conjecture of Strahm [13].

Dr Seuren's study deals with the problem of presenting an adequate model of grammatical description. The model he proposes conforms in its main outlines to the transformational generative grammar established by Chomsky, but differs in important respects. These mainly affect that part of Chomsky's syntactic component known as the 'base', which generates basic or 'deep' structures. In the model of the base proposed here two main constituents are distinguished for every deep structure representation of a sentence, vis-a-vis the operators and (...) the nucleus. The deep structure of a sentence is thus seen to be very similar to the logical structure of a proposition. The arguments given in support of this analysis are based on mainly on considerations of simplicity and semantic adequacy. (shrink)

In Ref. 1 we have considered the finite-dimensional quantum mechanics. There the quantum mechanical space of states wasV=C r. It is known that the second quantization of this space is the space of square-summable functions of finite number of variables(L 2(Rr,dx)) (Segal isomorphism). Creation and annihilation operators were introduced in Ref. 1, and the former coincided with the usual position and momentum operators in the conventional quantum mechanics. In this paper we shall investigate the spectral properties of field operators. We (...) shall show that the isomorphism between the exponential ofV andL 2(Rr,dx) can be understood as the decomposition by generalized eigenvectors of field operators (“Fourier transform”). (shrink)

I present a general theory of abstraction operators which treats them as variable-binding term- forming operators, and provides a reasonably uniform treatment for definite descriptions, set abstracts, natural number abstraction, and real number abstraction. This minimizing, extensional and relational theory reveals a striking similarity between definite descriptions and set abstracts, and provides a clear rationale for the claim that there is a logic of sets (which is ontologically non- committal). The theory also treats both natural and real (...) numbers as answering to a two-fold process of abstraction. The first step, of conceptual abstraction, yields the object occupying a particular position within an ordering of a certain kind. The second step, of objectual abstraction, yields the number sui generis, as the position itself within any ordering of the kind in question. (shrink)

In this paper it is shown that the intuitionistic .xed point theory equation image for α times iterated fixed points of strictly positive operator forms is conservative for negative arithmetic and equation image sentences over the theory equation image for α times iterated arithmetic comprehension without set parameters.This generalizes results previously due to Buchholz [5] and Arai [2].

We present an extension of constructive Zermelo{Fraenkel set theory [2]. Constructive sets are endowed with an applicative structure, which allows us to express several set theoretic constructs uniformly and explicitly. From the proof theoretic point of view, the addition is shown to be conservative. In particular, we single out a theory of constructive sets with operations which has the same strength as Peano arithmetic.

We study the extension of Feferman’s operational set theory provided by adding operational versions of unbounded existential quantification and power set and determine its proof-theoretic strength in terms of a suitable theory of sets and classes.

A-theorists think there is a fundamental difference between the present and other times. This concern shows up in what kinds of properties they take to be instantiated, what objects they think exist and how they formalize their views. Nearly every contemporary A-theorist assumes that her metaphysics requires a tense logic – a logic with operators like and. In this paper, I show that there is at least one viable A-theory that does not require a logic with tense operators. And (...) I will argue that three common indispensability arguments for tense operators are unsound. (shrink)

We discuss several ontological properties of explicit mathematics and operational set theory: global choice, decidable classes, totality and extensionality of operations, function spaces, class and set formation via formulas that contain the definedness predicate and applications.

(2003). Berkeley's theory of operative language in the Manuscript Introduction. British Journal for the History of Philosophy: Vol. 11, No. 2, pp. 271-301. doi: 10.1080/09608780320001047877.

This book studies the foundations of quantum theory through its relationship to classical physics. This idea goes back to the Copenhagen Interpretation (in the original version due to Bohr and Heisenberg), which the author relates to the mathematical formalism of operator algebras originally created by von Neumann. The book therefore includes comprehensive appendices on functional analysis and C*-algebras, as well as a briefer one on logic, category theory, and topos theory. Matters of foundational as well as (...) mathematical interest that are covered in detail include symmetry (and its "spontaneous" breaking), the measurement problem, the Kochen-Specker, Free Will, and Bell Theorems, the Kadison-Singer conjecture, quantization, indistinguishable particles, the quantum theory of large systems, and quantum logic, the latter in connection with the topos approach to quantum theory. This book is Open Access under a CC BY licence. (shrink)

No-cloning theorem says that there is no unitary operation that makes perfect clones of non-orthogonal quantum states. The objective of the present paper is to examine whether an imperfect cloning operation exists or not in a C*-algebraic framework. We define a universal \ -imperfect cloning operation which tolerates a finite loss \ of fidelity in the cloned state, and show that an individual system’s algebra of observables is abelian if and only if there is a universal \ -imperfect cloning operation (...) in the case where the loss of fidelity is less than \ . Therefore in this case no universal \ -imperfect cloning operation is possible in algebraic quantum theory. (shrink)

This paper deals with Boolean algebras supplied with an additional binary operation, calledB-algebras for short.The aim of the paper is to generalize some theorems concerning topological Boolean algebras to more comprehensive classes ofB-algebras, to formulate fundamental properties ofB-algebras, and to find more important relationships of these algebras to other known algebras.

We investigate Hilbert’s varepsilon -calculus in the context of intuitionistic type theories, that is, within certain systems of intuitionistic higher-order logic. We determine the additional deductive strength conferred on an intuitionistic type theory by the adjunction of closed varepsilon -terms. We extend the usual topos semantics for type theories to the varepsilon -operator and prove a completeness theorem. The paper also contains a discussion of the concept of “partially defined‘ varepsilon -term. MSC: 03B15, 03B20, 03G30.

We introduce an operational set theory in the style of [5] and [16]. The theory we develop here is a theory of constructive sets and operations. One motivation behind constructive operational set theory is to merge a constructive notion of set ([1], [2]) with some aspects which are typical of explicit mathematics [14]. In particular, one has non-extensional operations (or rules) alongside extensional constructive sets. Operations are in general partial and a limited form of self{application is (...) permitted. The system we introduce here is a fully explicit, nitely axiomatised system of constructive sets and operations, which is shown to be as strong as HA. (shrink)

The formalism of general probabilistic theories provides a universal paradigm that is suitable for describing various physical systems including classical and quantum ones as particular cases. Contrary to the usual no-restriction hypothesis, the set of accessible meters within a given theory can be limited for different reasons, and this raises a question of what restrictions on meters are operationally relevant. We argue that all operational restrictions must be closed under simulation, where the simulation scheme involves mixing and classical post-processing (...) of meters. We distinguish three classes of such operational restrictions: restrictions on meters originating from restrictions on effects; restrictions on meters that do not restrict the set of effects in any way; and all other restrictions. We fully characterize the first class of restrictions and discuss its connection to convex effect subalgebras. We show that the restrictions belonging to the second class can impose severe physical limitations despite the fact that all effects are accessible, which takes place, e.g., in the unambiguous discrimination of pure quantum states via effectively dichotomic meters. We further demonstrate that there are physically meaningful restrictions that fall into the third class. The presented study of operational restrictions provides a better understanding on how accessible measurements modify general probabilistic theories and quantum theory in particular. (shrink)

The general theory of variable binding term operators is an interesting recent development in logic. It opens up a rich class of semantic and model-theoretic problems. In this paper we survey the recent literature on the topic, and offer some remarks on its significances and on its connections with other branches of mathematical logic.

“Small” large cardinal notions in the language of ZFC are those large cardinal notions that are consistent with V = L. Besides their original formulation in classical set theory, we have a variety of analogue notions in systems of admissible set theory, admissible recursion theory, constructive set theory, constructive type theory, explicit mathematics and recursive ordinal notations (as used in proof theory). On the face of it, it is surprising that such distinctively set-theoretical notions (...) have analogues in such disaparate and relatively constructive contexts. There must be an underlying reason why that is possible (and, incidentally, why “large” large cardinal notions have not led to comparable analogues). My long term aim is to develop a common language in which such notions can be expressed and can be interpreted both in their original classical form and in their analogue form in each of these special constructive and semi-constructive cases. This is a program in progress. What is done here, to begin with, is to show how that can be done to a considerable extent in the settings of classical and admissible set theory (and thence, admissible recursion theory). The approach taken here is to expand the language of set theory to allow us to talk about (possibly partial) operations applicable both to sets and to operations and to formulate the large cardinal notions in question in terms of operational closure conditions; at the same time only minimal existence axioms are posited for sets. The resulting system, called Operational Set Theory, is a partial adaptation to the set-theoretical framework of the explicit mathematics framework Feferman (1975). The.. (shrink)

In frameworks in which _topic-__theoretic_ considerations—_e.g._, tracking _subject-matter_ or _topic_—are given equal importance with _veridical_ considerations, assigning topics to formulae in a satisfactory way is of critical importance. While intuitions are more-or-less solid for _extensional_ formulae in a propositional language, arriving at a compelling account of the subject-matter of _intensional_ formulae, _i.e._, formulae including intensional operators, is more challenging. This paper continues previous work on modeling topics of intensional formulae in William Parry’s logic of analytic implication, adapting the general techniques (...) to the framework of _topic-sensitive intentional modals_ (TSIMs) championed by Francesco Berto and his collaborators. As illustrations, we introduce variations on Berto and Peter Hawke’s logic of knowability relative to information ( \(\pmb {\textsf{KRI}}\) ), including a refinement sensitive to topic-theoretic distinctions between knowledge and belief and a refinement capable of internalizing its own properties. Finally, subsystems of Aybüke Ozgun and Berto’s logic of plain hyperintensional belief ( \(\pmb {\textsf{PHB}}\) ) are introduced in which fine-grained distinctions in subject-matter are possible. (shrink)

The Chilean Cybersyn project, an attempt to manage a nation’s economy by cybernetic methods, has evoked more and more interest in recent years. The project’s design lead and several team members were alumni of the Ulm School of Design—an institution that has been labelled “Bauhaus successor” and today is famous for a no-arts and method-led design approach with strong societal aspirations. The school also influenced the emerging design discipline in Latin America during the 1960s and 70s. This article reviews topics (...) in the Ulm curriculum that influenced “Ulmian” thinking, but often remained unnoticed in design centred publications. Cybernetics, Operations Research and Information Theory and their relation to design are discussed and the related scholars are portrayed critically. (shrink)

I formulate the Zermelo-Russell paradox for naive set theory. A sketch is given of Zermelo’s solution to the paradox: the cumulative type structure. A careful analysis of the set formation process shows a missing component in this solution: the necessity of an assumed imaginary jump out of an infinite universe. Thus a set is formed by a suitable combination of concrete and imaginary operations all of which can be made or assumed by a Turing machine. Some consequences are drawn (...) from this improved analysis of the concept of set, for the theory of sets and for the philosophy and foundations of mathematics. (shrink)

We introduce a way of relativizing operational set theory that also takes care of application. After presenting the basic approach and proving some essential properties of this new form of relativization we turn to the notion of relativized regularity and to the system OST that extends OST by a limit axiom claiming that any set is element of a relativized regular set. Finally we show that OST is proof-theoretically equivalent to the well-known theory KPi for a recursively inaccessible (...) universe. (shrink)