I argue that David Lewis is too quick to deny the presentist the right to employ span operators. There is no reason why the presentist could not help herself to both primitive tensed slice operators and primitive span operators. She would then have another device available to eliminate ambiguities and explain why sentences with embedded contradictions may nevertheless be true.

I present a notion of invariance under arbitrary surjective mappings for operators on a relational finite type hierarchy generalizing the so-called Tarski-Sher criterion for logicality and I characterize the invariant operators as definable in a fragment of the first-order language. These results are compared with those obtained by Feferman and it is argued that further clarification of the notion of invariance is needed if one wants to use it to characterize logicality.

This is a study in the meaning of natural language probability operators, sentential operators such as probably and likely. We ask what sort of formal structure is required to model the logic and semantics of these operators. Along the way we investigate their deep connections to indicative conditionals and epistemic modals, probe their scalar structure, observe their sensitivity to contex- tually salient contrasts, and explore some of their scopal idiosyncrasies.

The concept of an operator is used in a variety of practical and theoretical areas. Operators, as both conceptual and physical entities, are found throughout the world as subsystems in nature, the human mind, and the manmade world. Operators, and what they operate, i.e., their substrates, targets, or operands, have a wide variety of forms, functions, and properties. Operators have explicit philosophical significance. On the one hand, they represent important ontological issues of reality. On the other hand, epistemological operators form (...) the basic mechanism of cognition. At the same time, there is no unified theory of the nature and functions of operators. In this work, we elaborate a detailed analysis of operators, which range from the most abstract formal structures and symbols in mathematics and logic to real entities, human and machine, and are responsible for effecting changes at both the individual and collective human levels. Our goal is to find what is common in physical objects called operators and abstract mathematical structures, with the name operator providing foundations for building a unified but flexible theory of operators. The paper concludes with some reflections on functionalism and other philosophical aspects of the ‘operation’ of operators. (shrink)

There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express metalogical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the logics of formal inconsistency and by the logics of formal undeterminedness. LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs recover the validity of (...) the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core—in the case studied here, this common core is classical positive propositional logic. The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of LFI and undeterminedness, namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion one at a time. The last sections offer an algebraic account for such logics by adapting the swap structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite nondeterministic matrices. (shrink)

Certain passages in Kaplan’s ‘Demonstratives’ are often taken to show that non-vacuous sentential operators associated with a certain parameter of sentential truth require a corresponding relativism concerning assertoric contents: namely, their truth values also must vary with that parameter. Thus, for example, the non-vacuity of a temporal sentential operator ‘always’ would require some of its operands to have contents that have different truth values at different times. While making no claims about Kaplan’s intentions, we provide several reconstructions of how such (...) an argument might go, focusing on the case of time and temporal operators as an illustration. What we regard as the most plausible reconstruction of the argument establishes a conclusion similar enough to that attributed to Kaplan. However, the argument overgenerates, leading to absurd consequences. We conclude that we must distinguish assertoric contents from compositional semantic values, and argue that once they are distinguished, the argument fails to establish any substantial conclusions. We also briefly discuss a related argument commonly attributed to Lewis, and a recent variant due to Weber. (shrink)

For over four decades, "Introduction to Operations Research" by Frederick Hillier has been the classic text on operations research. While building on the classic strengths of the text, the author continues to find new ways to make the text current and relevant to students. One way is by incorporating a wealth of state-of-the-art, user-friendly software and more coverage of business applications than ever before. The hallmark features of this edition include clear and comprehensive coverage of fundamentals, an extensive set of (...) interesting problems and cases, and state-of-the-practice operations research software used in conjunction with examples from the text. The ninth edition introduces a new partnership with the Institute for Operations Research and Management (INFORMS). These two pillars of the OR world have come together to showcase some of the award-winning applications of operations research and integrate them with this text. (shrink)

There are two foundational, but not fully developed, ideas in paraconsistency, namely, the duality between paraconsistent and intuitionistic paradigms, and the introduction of logical operators that express meta-logical notions in the object language. The aim of this paper is to show how these two ideas can be adequately accomplished by the Logics of Formal Inconsistency (LFIs) and by the Logics of Formal Undeterminedness (LFUs). LFIs recover the validity of the principle of explosion in a paraconsistent scenario, while LFUs recover the (...) validity of the principle of excluded middle in a paracomplete scenario. We introduce definitions of duality between inference rules and connectives that allow comparing rules and connectives that belong to different logics. Two formal systems are studied, the logics mbC and mbD, that display the duality between paraconsistency and paracompleteness as a duality between inference rules added to a common core– in the case studied here, this common core is classical positive propositional logic (CPL + ). The logics mbC and mbD are equipped with recovery operators that restore classical logic for, respectively, consistent and determined propositions. These two logics are then combined obtaining a pair of logics of formal inconsistency and undeterminedness (LFIUs), namely, mbCD and mbCDE. The logic mbCDE exhibits some nice duality properties. Besides, it is simultaneously paraconsistent and paracomplete, and able to recover the principles of excluded middle and explosion at once. The last sections offer an algebraic account for such logics by adapting the swap-structures semantics framework of the LFIs the LFUs. This semantics highlights some subtle aspects of these logics, and allows us to prove decidability by means of finite non-deterministic matrices. (shrink)

We trace the difference between the ways in which apes and humans co–operate to differences in communicative abilities, claiming that the pressure for future–directed co–operation was a major force behind the evolution of language. Competitive co–operation concerns goals that are present in the environment and have stable values. It relies on either signalling or joint attention. Future–directed co–operation concerns new goals that lack fixed values. It requires symbolic communication and context–independent representations of means and goals. We analyse these ways of (...) co–operating in game–theoretic terms and submit that the co–operative strategy of games that involve shared representations of future goals may provide new equilibrium solutions. (shrink)

Recently, new types of independence of a pair of C *- or W *-subalgebras (1,2) of a C *- or W *-algebra have been introduced: operational C *- and W *-independence (Rédei and Summers, http://arxiv.org/abs/0810.5294, 2008) and operational C *- and W *-separability (Rédei and Valente, How local are local operations in local quantum field theory? 2009). In this paper it is shown that operational C *-independence is equivalent to operational C *-separability and that operational W *-independence is equivalent to (...) operational W *-separability. Specific further sub-types of both operational C *- and W *-separability and operational C *- and W *-independence are defined and the problem of characterization of the logical interdependencies of the independence notions is raised. (shrink)

In this paper, we extend the expressive power of the logics K3, LP and FDE with anormality operator, which is able to express whether a for-mula is assigned a classical truth value or not. We then establish classical recapture theorems for the resulting logics. Finally, we compare the approach via normality operator with the classical collapse approach devisedby Jc Beall.

We show that logic has more to offer to ontologists than standard first order and modal operators. We first describe some operators of linear logic which we believe are particularly suitable for ontological modeling, and suggest how to interpret them within an ontological framework. After showing how they can coexist with those of classical logic, we analyze three notions of artifact from the literature to conclude that these linear operators allow for reducing the ontological commitment needed for their formalization, and (...) even simplify their logical formulation. (shrink)

The research aims to study the role of strategic and operational planning as approach for crises management in UNRWA - Gaza Strip field- Palestine. Several descriptive analytical methods were used for this purpose and a survey as a tool for data collection. Community size was (881), and the study sample was stratified random (268). The overall findings of the current study show that strategic and operational planning is performed in UNRWA. The results of static analysis show that there are a (...) relation between strategic and operational planning and crises management. In spite this relation existence, it need more improvement and expanding. Also there are shortcomings in the way that organization manages the crises before and after they occur. A crisis management is only practicing during the crisis. The study suggests that UNRWA must invest in more resources to enhance strategic and operational palming and improve other methods to face potential crises in the future. (shrink)

The functional capabilities that consciousness seems to provide to biological systems can supply valuable principles in the design of more autonomous and robust technical systems. These functional concepts keep a notable similarity to those underlying the notion of operating system in software engineering, which allows us to specialize the computer metaphor for the mind into that of the operating system metaphor for consciousness. In this article, departing from these ideas and a model-based theoretical framework for cognition, we present an architectural (...) proposal for machine consciousness, called the Operative Mind. According to it, machine consciousness could be implemented as a set of services, in an operative system fashion, based on modeling of the own control architecture, that supervise the adequacy of the system architectural structure to the current objectives, triggering and managing adaptativity mechanisms. (shrink)

I present a notion of invariance under arbitrary surjective mappings for operators on a relational finite type hierarchy generalizing the so-called Tarski-Sher criterion for logicality and I characterize the invariant operators as definable in a fragment of the first-order language. These results are compared with those obtained by Feferman and it is argued that further clarification of the notion of invariance is needed if one wants to use it to characterize logicality.

Tarski and Mautner proposed to characterize the "logical" operations on a given domain as those invariant under arbitrary permutations. These operations are the ones that can be obtained as combinations of the operations on the following list: identity; substitution of variables; negation; finite or infinite disjunction; and existential quantification with respect to a finite or infinite block of variables. Inasmuch as every operation on this list is intuitively "logical", this lends support to the Tarski-Mautner proposal.

The properties of the ${\forall^{1}}$ quantifier defined by Kontinen and Väänänen in [13] are studied, and its definition is generalized to that of a family of quantifiers ${\forall^{n}}$ . Furthermore, some epistemic operators δ n for Dependence Logic are also introduced, and the relationship between these ${\forall^{n}}$ quantifiers and the δ n operators are investigated.The Game Theoretic Semantics for Dependence Logic and the corresponding Ehrenfeucht- Fraissé game are then adapted to these new connectives.Finally, it is proved that the ${\forall^{1}}$ quantifier (...) is not uniformly definable in Dependence Logic, thus answering a question posed by Kontinen and Väänänen in the above mentioned paper. (shrink)

In the October 1937 number of Philosophy of Science Lindsay has made certain criticisms of the adequacy of the “operational method” of analyzing and giving meaning to the concepts of physics, documenting his criticisms chiefly from my own writings. In these criticisms he has made statements as to the method which I would by no means accept. This is not characteristic of his paper only, for I have seldom indeed seen a printed discussion of the method which I would accept (...) as being an adequate or sometimes even fair representation of what I understand by it. It will perhaps pay therefore if I attempt to state what I conceive it to be all about, particularly since I have never attempted such a comprehensive statement and since my own ideas on the subject have been developing since I first wrote in the Logic of Modern Physics. For one reason I have hesitated to do this, for fear of seeming to subscribe to the not uncommon idea that we are dealing with some elaborate and profound new theory of the nature of knowledge or of meaning. I believe that I myself have never talked of “operationalism” or “operationism”, but I have a distaste for these grandiloquent words which imply something more philosophic and esoteric than the simple thing that I see. What we are here concerned with is an observation and description of methods which at least some physicists had already, perhaps unconsciously, adopted and found successful—the practise of the methods already existed. What I have attempted is to analyze these successful methods, not to set up a philosophical system and a theory of the properties that any method must have if it hopes to be successful. Since I was concerned with a technique already extant, my principal method of getting others to see what the technique involved has been to exhibit examples of the technique in action, rather than to attempt any exhaustive characterization of the technique itself. (shrink)

Résumé La linguistique du texte a pour tâche la théorisation et la description des opérations de segmentation qui délimitent des unités de rang et de longueur différentes, et la théorisation et la description des différents effets de continuité créés par les opérations de liage de ces unités. À la structuration phrastique-périodique par la morpho-syntaxe et la prosodie à l’oral, la ponctuation à l’écrit, le palier micro-textuel ajoute six facteurs de texture transphrastique : les liages référentiels et isotopiques, les liages du (...) signifiant, l’ensemble des phénomènes de connexion, les relations d’implicitation, la cohésion énonciative et la cohésion illocutoire. À partir de trois textes, cet article illustre systématiquement et détaille ces six formes de liage transphrastique des unités textuelles de base. (shrink)

The Operator Argument against eternalism holds that having non-vacuous tense operators in the language is incompatible with the claim that every proposition has its truth-value eternally. Assuming that (1) there are non-vacuous tense operators, (2) tense operators operate on propositions and (3) tense operators which operate on eternal entities are vacuous, it may be argued that eternalism is false. In this paper, I examine the Operator Argument. The goal is threefold. First, I want to present some aspects of the debate (...) in a more elaborate way, especially those concerning formal matters. Secondly, I will argue that eternalism can escape the Operator Argument. There are two main strategies for handling the Operator Argument. The first one is based on replacing temporal operators with object-language quantifiers. The second rejects the identification of compositional semantic value with assertoric content. My third goal is to show that none of them is as good as the strategy that adopts Timestamp Semantics (Fritz in Philosl Stud 176:2933–2959, 2019). I am going to argue that the quantificational treatment of tenses is compatible with temporalism and that the arguments for rejecting the identification of compositional semantic value with assertoric content provide, in fact, a motivation for the temporalist position. At the end, I will develop Timestamp Semantics by providing a novel formalization of it, and defend it against three potential counter-arguments. (shrink)

It is shown, within constructive mathematics, that the unit ball B1 of the set of bounded operators on a Hilbert space H is weak-operator totally bounded. This result is then used to prove that the weak-operator continuity of the mapping T → AT on B1 is equivalent to the existence of the adjoint of A.

Rapid technological change is resulting in the development of ever increasingly capable autonomous weapon systems. As they become more sophisticated, the calls for developing restrictions on their use, up to and including their complete prohibition, are growing. Not unlike the call for restrictions on the sale and use of drones, most proposed restrictions are well-intentioned but are often ill-informed, with a high likelihood of degrading national security and putting additional lives at risk. Employed by experienced operators well-versed in the laws (...) of armed conflict, autonomous weapons can advance the objectives of those who would prohibit their use. This essay takes an operational perspective to examine the role that autonomous weapon systems can play while complying with the laws of armed conflict. With responsible design and incorporation of applicable control measures, autonomous weapons will be able not just to comply but also to enhance the ethical use of force. This essay contends that efforts by the international community to use international legal means and/or institutions to over-regulate or even ban lethal autonomous weapons are counterproductive. It considers and describes the end-game results of the use of autonomous weapons in enhancing the application of both international law and human ethical values. (shrink)

Logical and philosophical literature provides different classifications of reasoning. In the Polish literature on the subject, for instance, there are three popular ones accepted by representatives of the Lvov-Warsaw School: Jan Łukasiewicz, Tadeusz Czeżowski and Kazimierz Ajdukiewicz (Ajdukiewicz in Logika pragmatyczna [Pragmatic Logic]. PWN, Warsaw (1965, 2nd ed. 1974). Translated as: Pragmatic Logic. Reidel & PWN, Dordrecht, 1975). The author of this paper, having modified those classifications, distinguished the following types of reasoning: (1) deductive and (2) non-deductive, and additionally two (...) types of them in each of the two, depending on the manner of combining their premises with the conclusion through the relation of classical logical entailment. Consequently, the four types of reasoning: unilateral deductive (incl. its sub-types: deductive inference and proof), bilateral deductive (incl. complete induction), and reductive (incl. the sub-types: explanation and verification), logically nonvaluable (incl. inference by analogy, statistic inference), correspond to four operators of derivability. They are defined formally on the ground of Tarski’s axiomatic theory of deductive systems, by means of the consequence operation _Cn_ (Tarski in Monatshefte Math Phys 37:361–404, 1930a, C R Soc Sci Lett Vars 23:22–29, 1930b). Also, certain metalogical properties of these operators are given, as well as their relations with Tarski’s consequence operations \(Cn^+\) ( \(Cn^+ = Cn\) ) and dual consequences \(Cn^{-1}\) (Słupecki in Zeszyty Naukowe Uniwersytetu Wrocławskiego Seria B Nr 3:33–40, 1959, Słupecki et al. in Stud Log 29:76–123, 1971, Wybraniec-Skardowska, in: Wybraniec-Skardowska, Bryll (eds) Z badań nad teorią zdań odrzuconych [Studies in the Theory of Rejected Propositions], Series B, Studia i Monografie, Zeszyty Naukowe Wyższej Szkoły Pedagogicznej w Opolu, Opole, 1969), and \(Cn^-\) (Wójcicki in Bull Sect Log 2(2):54–57, 1973)). (shrink)

This paper presents a unified framework that explains and extends the already successful applications of the Leibniz operator, the Suszko operator, and the Tarski operator in recent developments in abstract algebraic logic. To this end, we refine Czelakowski’s notion of an S-compatibility operator, and introduce the notion of coherent family of S-compatibility operators, for a sentential logic S. The notion of coherence is a restricted property of commutativity with inverse images by surjective homomorphisms, which is satisfied by both the Leibniz (...) and the Suszko operators. We generalize several constructions and results already existing for the mentioned operators; in particular, the well-known classes of algebras associated with a logic through each of them, and the notions of full generalized model of a logic and a special kind of S-filters. We obtain a General Correspondence Theorem, extending the well-known one from the theory of protoalgebraic logics to arbitrary logics and to more general operators, and strengthening its formulation. We apply the general results to the Leibniz and the Suszko operators, and obtain several characterizations of the main classes of logics in the Leibniz hierarchy by the form of their full generalized models, by old and new properties of the Leibniz operator, and by the behaviour of the Suszko operator. Some of these characterizations complete or extend known ones, for some classes in the hierarchy, thus offering an integrated approach to the Leibniz hierarchy that uncovers some new, nice symmetries. (shrink)

The sum, difference, product and quotient of two functions with different domains are usually defined only on their common domain. This paper extends these definitions so that the sum and other operations are essentially defined anywhere that at least one of the components is defined. This idea is applied to propositions and events, expressed as indicator functions, to define conditional propositions and conditional events as three-valued indicator functions that are undefined when their condition is false. Extended operations of "and", "or", (...) "not" and "conditioning" are then defined on these conditional events with variable conditions. The probabilities of the disjunction and of the conjunction of two conditionals are expressed in terms of the conditional probabilities of the component conditionals. In a special case, these are shown to be weighted averages of the component conditional probabilities where the weights are the relative probabilities of the various conditions. Next, conditional random variables are defined to be random variables X whose domain has been restricted by a condition on a second random variable Y. The extended sum, difference, product and conditioning operations on functions are then applied to these conditional random variables. The expectation of a random variable and the conditional expectation of a conditional random variable are recounted. Theorem 1 generalizes the standard result that the conditional expectation of the sum of two conditional random variables with disjoint and exhaustive conditions is a weighted sum of the conditional expectations of the component conditional random variables. Because of the extended operations, the theorem is true for arbitrary conditions. Theorem 2 gives a formula for the expectation of the product of two conditional random variables. After the definition of independence of two random variables is extended to accommodate the extended operations, it is applied to the formula of Theorem 2 to simplify the expectation of a product of conditional random variables. Two examples end the paper. The first concerns a work force of n workers of different output levels and work shifts. The second example involves two radars with overlapping surveillance regions and different detection error rates. One radar's error rate is assumed to be sensitive to fog and the other radar's error rate is assumed to be sensitive to air traffic density. The combined error rate over the combined surveillance region given heavy fog and moderate air traffic is computed. (shrink)

In this paper, we prove that the lattice of all closure operators of a complete Almost Distributive Lattice L with fixed maximal element m is dual atomistic. We define the concept of a completely meet-irreducible element in a complete ADL and derive a necessary and sufficient condition for a dual atom of Φ (L) to be complemented.

The understanding of the interrelationship between brain and mind remains far from clear. It is well established that the brain's capacity to integrate information from numerous sources forms the basis for cognitive abilities. However, the core unresolved question is how information about the "objective" physical entities of the external world can be integrated, and how unifiedand coherent mental states (or Gestalts) can be established in the internal entities of distributed neuronal systems. The present paper offers a unified methodological and conceptual (...) basis for a possible mechanism of how the transient synchronization of brain operations may construct the unified and relatively stable neural states, which underlie mental states. It was shown that the sequence of metastable spatial EEG mosaics does exist and probably reflects the rapid stabilization periods of the interrelation of large neuron systems. At the EEG level this is reflected in the stabilization of quasi-stationary segments on corresponding channels. Within the introduced framework, physical brain processes and psychological processes are considered as two basic aspects of a single whole informational brain state. The relations between operational process of the brain, mental states and consciousness are discussed. (shrink)

How can we critique political theory when all we have to use are its own conceptual tools? As Hannah Arendt observed, it can only be done through leaps, inversions, and the turning of concepts upside-down. But this twisting operation must be done in order to turn those who philosophize back to the hard work of real life change. In Turning Operations, renowned theorist Mary G. Dietz challenges specific contemporary modes of theorizing politics-from feminist theory to Habermasian discourse- -while appropriating some (...) of political theory's own approaches and some of its most striking figures, including Aristotle, Nietzsche, Weber, Beauvoir, and Arendt in order to foment some leaps, inversions, reversals and turns on politics along the way. Dietz confronts a number of current debates, arguing that most are filled with artificial division and empty terms. She argues that we must abandon commonly supported dichotomies-masculine versus feminine, speech versus action, liberty versus community -to create abetter discourse, and a better world. Turning Operations is an essential new contribution to democratic and feminist political thought. (shrink)

Steve Awodey and Jesse Hughes. Modal Operators and the Formal Dual of Birkhoff's Completeness Theorem.

We investigate properties of the ineffability and the Ramsey operator, and a common generalization of those that was introduced by the second author, with respect to higher indescribability, as introduced by the first author. This extends earlier investigations on the ineffability operator by James Baumgartner, and on the Ramsey operator by Qi Feng, by Philip Welch et al., and by the first author.

The problem. The model. Inventory models. Allocation models. Waiting-time models. Replacement models. Competitive models. Testing, control and implementation. Administration of operations research. Index.

Based on the theoretical analysis of self-consciousness concepts, we hypothesized that the spatio-temporal pattern of functional connectivity within the default-mode network (DMN) should persist unchanged across a variety of different cognitive tasks or acts, thus being task-unrelated. This supposition is in contrast with current understanding that DMN activated when the subjects are resting and deactivated during any attention-demanding cognitive tasks. To test our proposal, we used, in retrospect, the results from our two early studies ([Fingelkurts, 1998] and [Fingelkurts et al., (...) 2003]). In both studies for the majority of experimental trails we indeed found a constellation of operationally synchronized cortical areas (indexed as DMN) that was persistent across all studied experimental conditions in all subjects. Furthermore, we found three major elements comprising this DMN: two symmetrical occipito-parieto-temporal and one frontal spatio-temporal patterns. This new data directly supports the notion that DMN has a specific functional connotation – it provides neurophysiologic basis for self-processing operations, namely first-person perspective taking and an experience of agency. (shrink)

Although several studies propose that the integrity of neuronal assemblies may underlie a phenomenon referred to as awareness, none of the known studies have explicitly investigated dynamics and functional interactions among neuronal assemblies as a function of consciousness expression. In order to address this question EEG operational architectonics analysis (Fingelkurts and Fingelkurts, 2001, 2008) was conducted in patients in minimally conscious (MCS) and vegetative states (VS) to study the dynamics of neuronal assemblies and operational synchrony among them as a function (...) of consciousness expression. We found that in minimally conscious patients and especially in vegetative patients neuronal assemblies got smaller, their life-span shortened and they became highly unstable. Furthermore, we demonstrated that the extent/volume and strength of operational synchrony among neuronal assemblies was smallest or even absent in VS patients, intermediate in MCS patients and highest in healthy fully-conscious subjects. All findings were similarly observed in EEG alpha as well as beta1 and beta2 frequency oscillations. The presented results support the basic tenets of Operational Architectonics theory of brain-mind functioning and suggest that EEG operational architectonics analysis may provide an objective and accurate means of assessing signs of (un)consciousness in patients with severe brain injuries. Therefore this methodological approach may complement the existing “gold standard” of behavioral assessment of this population of challenging patients and inform the diagnostic and treatment decision-making processes. (shrink)

It is a classic result in modal logic, often referred to as Jónsson-Tarski duality, that the category of modal algebras is dually equivalent to the category of descriptive frames. The latter are Kripke frames equipped with a Stone topology such that the binary relation is continuous. This duality generalizes the celebrated Stone duality for boolean algebras. Our goal is to generalize descriptive frames so that the topology is an arbitrary compact Hausdorff topology. For this, instead of working with the boolean (...) algebra of clopen subsets of a Stone space, we work with the ring of continuous real-valued functions on a compact Hausdorff space. The main novelty is to define a modal operator on such a ring utilizing a continuous relation on a compact Hausdorff space.Our starting point is the well-known Gelfand duality between the category ${\sf KHaus}$ of compact Hausdorff spaces and the category $\boldsymbol {\mathit {uba}\ell }$ of uniformly complete bounded archimedean $\ell $ -algebras. We endow a bounded archimedean $\ell $ -algebra with a modal operator, which results in the category $\boldsymbol {\mathit {mba}\ell }$ of modal bounded archimedean $\ell $ -algebras. Our main result establishes a dual adjunction between $\boldsymbol {\mathit {mba}\ell }$ and the category ${\sf KHF}$ of what we call compact Hausdorff frames; that is, Kripke frames equipped with a compact Hausdorff topology such that the binary relation is continuous. This dual adjunction restricts to a dual equivalence between ${\sf KHF}$ and the reflective subcategory $\boldsymbol {\mathit {muba}\ell }$ of $\boldsymbol {\mathit {mba}\ell }$ consisting of uniformly complete objects of $\boldsymbol {\mathit {mba}\ell }$. This generalizes both Gelfand duality and Jónsson-Tarski duality. (shrink)

Relational, operator, and predicate systems are distinguished on the basis that they correspond to the three possible pair-wise bracketings into two constituents of the three parts of a proposition: relation, subject, and object. It is asserted that the verbal propositional modality (left hemisphere) uses a predicate grammar, while the spatial-image operational modality (right hemisphere) uses an operator grammar. Verbal propositional memory has the capacity for extensive propositional embedding while spatial operational memory does not.

Storage operators have been introduced by J. L. Krivine in [5] they are closed λ-terms which, for a data type, allow one to simulate a "call by value" while using the "call by name" strategy. In this paper, we introduce the directed λ-calculus and show that it has the usual properties of the ordinary λ-calculus. With this calculus we get an equivalent--and simple--definition of the storage operators that allows to show some of their properties: $\bullet$ the stability of the set (...) of storage operators under the β-equivalence (Theorem 5.1.1); $\bullet$ the undecidability (and semidecidability) of the problem "is a closed λ-term t a storage operator for a finite set of closed normal λ-terms?" (Theorems 5.2.2 and 5.2.3); $\bullet$ the existence of storage operators for every finite set of closed normal λ-terms (Theorem 5.4.3); $\bullet$ the computation time of the "storage operation" (Theorem 5.5.2). (shrink)

Predicates are term-to-sentence devices, and operators are sentence-to-sentence devices. What Kaplan and Montague's Paradox of the Knower demonstrates is that necessity and other modalities cannot be treated as predicates, consistent with arithmetic; they must be treated as operators instead. Such is the current wisdom.A number of previous pieces have challenged such a view by showing that a predicative treatment of modalities neednot raise the Paradox of the Knower. This paper attempts to challenge the current wisdom in another way as well: (...) to show that mere appeal to modal operators in the sense of sentence-to-sentence devices is insufficient toescape the Paradox of the Knower. A family of systems is outlined in which closed formulae can encode other formulae and in which the diagonal lemma and Paradox of the Knower are thereby demonstrable for operators in this sense. (shrink)

This work extend to residuated lattices the results of [ 7 ]. It also provides a possible generalization to this context of frontal operators in the sense of [ 9 ]. Let L be a residuated lattice, and f : L k → L a function. We give a necessary and sufficient condition for f to be compatible with respect to every congruence on L . We use this characterization of compatible functions in order to prove that the variety of (...) residuated lattices is locally affine complete. We study some compatible functions on residuated lattices which are a generalization of frontal operators. We also give conditions for two operations P ( x , y ) and Q ( x , y ) on a residuated lattice L which imply that the function $${x \mapsto min\{y \in L : P(x, y) \leq Q(x, y)\}}$$ when defined, is equational and compatible. Finally we discuss the affine completeness of residuated lattices equipped with some additional operators. (shrink)

Several important terms in biology have recently been criticized for not being "operational." In this paper the course of operationism in physics, psychology and genetics is sketched to show what effect this particular view on the meaning of scientific terms had on these disciplines. Then the biological species concept and the concept of homology are examined to see in what respects they are or are not "operational." One of the primary conclusions of this investigation is that few terms in science (...) are completely operational or completely nonoperational. Some scientific terms, especially theoretical terms, are a good deal less operational than others; but, far from being regrettable, this situation is essential if theoretical terms are to fulfill their systematizing function and if scientific theories are to be capable of growth. (shrink)

Behavior that solves a problem is distinguished by the fact that it changes another part of the solver's behavior and is strengthened when it does so. Problem solving typically involves the construction of discriminative stimuli. Verbal responses produce especially useful stimuli, because they affect other people. As a culture formulates maxims, laws, grammar, and science, its members behave more effectively without direct or prolonged contact with the contingencies thus formulated. The culture solves problems for its members, and does so by (...) transmitting the verbal discriminative stimuli called rules. Induction, deduction, and the construction of models are ways of producing rules. Behavior that solves a problem may result from direct shaping by contingencies or from rules constructed either by the problem solver or by others. Because different controlling variables are involved, contingency-shaped behavior is never exactly like rule-governed behavior. The distinction must take account of a system which establishes certain contingencies of reinforcement, such as some part of the natural environment, a piece of equipment, or a verbal community; the behavior shaped and maintained by these contingencies; rules, derived from the contingencies, which specify discriminative stimuli, responses, and consequences, and the behavior occasioned by the rules. (shrink)

In this paper we shall introduce the variety FWHA of frontal weak Heyting algebras as a generalization of the frontal Heyting algebras introduced by Leo Esakia in [10]. A frontal operator in a weak Heyting algebra A is an expansive operator r preserving finite meets which also satisfies the equation?? b V, for all a,b? A. These operators were studied from an algebraic, logical and topological point of view by Leo Esakia in [10]. We will study frontal operators in weak (...) Heyting algebras and we will consider two examples of them. We will give a Priestley duality for the category of frontal weak Heyting algebras in terms of relational spaces where is a WH space [6], and R is an additional binary relation used to interpret the modal operator. We will also study the WH- algebras with successor and the WTf- algebras with gamma. For these varieties we will give two topological dualities. The first one is based on the representation given for the frontal weak Heyting algebras. The second one is based on certain particular classes of WH-spaces. (shrink)