A well-ingrained and recommended engineering practice in safety-critical software systems is to separate safety concerns from other aspects of the system. Along these lines, there have been calls for operating systems that implement ethical controls in an ethical layer separate from, and not amenable to tampering by, developers and modules in higher-level intelligence or cognition layers. There have been no implementations that demonstrate such a marshalling of ethical principles into an ethical layer. To address this, we present three (...) different tracks for implementing such systems, and offer a prototype implementation of the third track. We end by addressing objections to our approach. (shrink)

In this work, a virtual submerged floating operational system based on parallel and serial robotic platforms is proposed. The primary aim behind its development lies in carrying out simulated underwater manipulation experiments in an easier and safer way. This VSFOS is consisted of a six-degree-of-freedom parallel platform, an ABB serial manipulator, an inertial sensor, and a real-time industrial computer. The 6-DOF platform is used to simulate the movement of an underwater vehicle, whose attitude is measured by the inertial sensor. (...) The ABB manipulator, controlled by the real-time industrial computer, works as an operational tool to perform underwater manipulation tasks. In the control system architecture, software is developed to receive the data collected by the inertial sensor, to communicate and send instructions. Furthermore, the real-time status of the manipulator is displayed in this software. To validate the proposed system, two experiments have been conducted to test its performance. In the first experiment, the test is carried out to check the communication function of VSFOS, while in the second one, the manipulator is intended to follow the movement of the parallel platform and perform simulated operational task in the space. The obtained results from these two experiments show clearly the effectiveness and the performance of the proposed VSFOS. (shrink)

Pervasive, easy-to-use privacy services are keys to enabling users to maintain control of their private data in the online environment. This paper proposes (1) an online privacy lifecycle from the user perspective that drives and categorizes the development of these services, (2) a layered platform design solution for online privacy, (3) the evolution of the PeCAN (Personal Context Agent Networking) architecture to a platform for pervasively providing multiple contexts for user privacy preferences and online informational privacy services, and (4) use (...) of platform network effects for increasing wide-scale user adoption of privacy services. One implication of this paper’s concepts is that platform-mediated networks, which are reportedly the vehicles for most of the revenue earned by 60 of the world’s largest companies, and other platforms that commonly host millions of users, will not have to individually reinvent and manage sophisticated user services for privacy protection since universal privacy platforms can be layered on them in 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)

This paper is mainly concerned with proof-theoretic analysis of some second-order systems of explicit mathematics with a non-constructive minimum operator. By introducing axioms for variable types we extend our first-order theory BON to the elementary explicit type theory EET and add several forms of induction as well as axioms for μ. The principal results then state: EET plus set induction is proof-theoretically equivalent to Peano arithmetic PA <0).

Feferman, S. and G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part I, Annals of Pure and Applied Logic 65 243-263. This paper is mainly concerned with the proof-theoretic analysis of systems of explicit mathematics with a non-constructive minimum operator. We start off from a basic theory BON of operators and numbers and add some principles of set and formula induction on the natural numbers as well as axioms for μ. The principal results then state: BON plus set induction (...) is proof-theoretically equivalent to Peano arithmetic PA; BON plus formula induction is proof-theoretically equivalent to the system <0 of second-order arithmetic. (shrink)

The aim of this article is to give the proof-theoretic analysis of various subsystems of Feferman's theory T1 for explicit mathematics which contain the non-constructive μ-operator and join. We make use of standard proof-theoretic techniques such as cut-elimination of appropriate semiformal systems and asymmetrical interpretations in standard structures for explicit mathematics.

Two different concepts of iconicity compete in Peirce's diagrammatical logic. One is articulated in his general reflections on the role of diagrams in thought, in what could be termed his diagrammatology — the other is articulated in his construction of Existential Graphs as an iconic system for representing logic. One is operational and defines iconicity in terms of which information may be derived from a given diagram or diagram system — the other has stronger demands on iconicity, adding (...) to the operational criterion a demand for as high a degree of similarity as possible and may be termed optimal iconicity. Peirce himself does not clearly distinguish these two iconicity notions, a fact that has caused some confusion. By isolating them, we get a clearer and more refined conceptual apparatus for analyzing iconic signs, from pictures to logic. (shrink)

In the paper [8], the first author developped a topos- theoretic approach to reference and modality. (See also [5]). This approach leads naturally to modal operators on locales (or spaces without points). The aim of this paper is to develop the theory of such modal operators in the context of the theory of locales, to axiomatize the propositional modal logics arising in this context and to study completeness and decidability of the resulting systems.

We consider an extension of Gödel logic by a unary operator that enables the addition of non-negative reals to truth-values. Although its propositional fragment has a simple proof system, first-order validity is Π2-hard. We explain the close connection to Scarpellini’s result on Π2-hardness of Łukasiewicz’s logic.

In 1990, J.L. Krivine introduced the notion of storage operator to simulate 'call by value' in the 'call by name' strategy. J.L. Krivine has shown that, using Gödel translation of classical into intuitionitic logic, we can find a simple type for the storage operators in AF2 type system. This paper studies the $forall$-positive types (the universal second order quantifier appears positively in these types), and the Gödel transformations (a generalization of classical Gödel translation) of TTR type system. We (...) generalize, by using syntaxical methods, the J.L. Krivine's Theorem about these types and for these transformations. We give a proof of this result in the case of the type of recursive integers. (shrink)

In this article we introduce and study the notion of operational closure: a transitive set d is called operationally closed iff it contains all constants of OST and any operation f∈d applied to an element a∈d yields an element fa∈d, provided that f applied to a has a value at all. We will show that there is a direct relationship between operational closure and stability in the sense that operationally closed sets behave like Σ1 substructures of the universe. This leads (...) to our final result that OST plus the axiom , claiming that any set is element of an operationally closed set, is proof-theoretically equivalent to the system KP+ of Kripke–Platek set theory with infinity and Σ1 separation. We also characterize the system OST plus the existence of one operationally closed set in terms of Kripke–Platek set theory with infinity and a parameter-free version of Σ1 separation. (shrink)

. In this paper, the significance of using general logic-systems and finite consequence operators defined on non-organized languages is discussed. Results are established that show how properties of finite consequence operators are independent from language organization and that, in some cases, they depend only upon one simple language characteristic. For example, it is shown that there are infinitely many finite consequence operators defined on any non-organized infinite language L that cannot be generated from any finite logic-system. On the other (...) hand, it is shown that for any nonempty language L, a set map is a finite consequence operator if and only if it is defined by a general logic-system. Simple logic-system examples that determine specific consequence operator properties are given. (shrink)

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)

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)

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.

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)

Disaster response is a highly collaborative and critical process that requires the involvement of multiple emergency responders (ERs), ideally working together under a unified command, to enable a rapid and effective operational response. Following the 9/11 and 11/13 terrorist attacks and the devastation of hurricanes Katrina and Rita, it is apparent that inadequate communication and a lack of interoperability among the ERs engaged on-site can adversely affect disaster response efforts. Within this context, we present a scenario-based terrorism case study to (...) highlight the challenges of operational disaster command and response. In this article, which is based on the French emergency response doctrine, we outline a semantics-based common operational command system that is designed to guarantee an efficient information flow among ERs. Our focus is on offering to all ERs, a real-time operational picture of the situation in order to enable multilevel coordination among firefighters, police, healthcare units, public authorities, and other stakeholders. Our approach consolidates information to promote timely sharing of data among ERs. The proposed system is based on an ontology that has been developed to represent the different types of knowledge on the part of ERs, providing a shared vocabulary that covers a variety of interoperability concerns. (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)

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)

This paper introduces the concept of Operator Contestability in AI systems: the principle that those overseeing AI systems (operators) must have the necessary control to be accountable for the decisions made by these algorithms. We argue that designers have a duty to ensure operator contestability. We demonstrate how this duty can be fulfilled by applying the'Design for Defeaters' framework, which provides strategies to embed tools within AI systems that enable operators to challenge decisions. Defeaters are designed to contest either the (...) justification for the AI’s data inputs (undercutting defeaters) or the validity of the conclusions drawn from that data (rebutting defeaters). To illustrate the necessity and application of this framework, we examine case studies such as AI-driven recruitment processes, where operators need tools and authority to uncover and address potential biases, and autonomous driving systems, where real-time decision-making is crucial. The paper argues that operator contestability requires ensuring that operators have (1) epistemic access to the relevant normative reasons and (2) the authority and cognitive capacity to act on these defeaters. By addressing these challenges, the paper emphasizes the importance of designing AI systems in a way that enables operators to effectively contest AI decisions, thereby ensuring that the appropriate individuals can take responsibility for the outcomes of human-AI interactions. (shrink)

We study vertex operators in 4D conformal field theory derived from quantized gravity, whose dynamics is governed by the Wess-Zumino action by Riegert and the Weyl action. Conformal symmetry is equal to diffeomorphism symmetry in the ultraviolet limit, which mixes positive-metric and negative-metric modes of the gravitational field and thus these modes cannot be treated separately in physical operators. In this paper, we construct gravitational vertex operators such as the Ricci scalar, defined as space-time volume integrals of them are invariant (...) under conformal transformations. Short distance singularities of these operator products are computed and it is shown that their coefficients have physically correct signs. Furthermore, we show that conformal algebra holds even in the system perturbed by the cosmological constant vertex operator as in the case of the Liouville theory shown by Curtright and Thorn. (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)

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)

This work adopts H. Kelsen’s concept of legal system, proposes a formal definition for such notion, and introduces an operational semantical framework for legal systems that are situated in agent societies. Agent societies are defined. Relevant formal properties of situated legal systems are discussed; the way they are exposed in the operational semantical framework is explained, and their truth formally proved. Also, for the sake of a better understanding of the legal-theoretic assumptions of the paper, recurring issues regarding Kelsen’s (...) theory of law are briefly reviewed. They are put in confrontation with the points of view of R. Dworkin, H. Hart, and J. Raz, and an attempt is made to clarify them from the perspective of the provided formalization. A brief case study in agent-based modeling and simulation of public policy processes is presented, as an illustration of the way of using situated legal systems, and the proposed operational semantical framework, in a practical application. (shrink)

Actualists of a certain stripe—dispositionalists—hold that metaphysical modality is grounded in the powers of actual things. Roughly: p is possible iff something has, or some things have, the power to bring it about that p. Extant critiques of dispositionalism focus on its material adequacy, and question whether there are enough powers to account for all the possibilities we intuitively want to countenance. For instance, it seems possible that none of the actual contingent particulars ever existed, but it is impossible to (...) explain this by appealing to the powers of some actual thing or things to bring it about. I argue instead that dispositionalism, in the simple form championed by its proponents, is formally inadequate. Dispositionalists interpret the modal operators as simple existential claims about powers, but if we interpret the operators that way, the resulting system of modal logic is too weak to capture metaphysical modality. I argue that we can modify the standard dispositionalist interpretations of the operators to secure formal adequacy, but at the cost of accepting that not all modality is grounded in powers. This, I shall suggest, is not a bad thing—the resulting theory still has powers at its core and has certain attractive features, in addition to formal adequacy, that the standard theory lacks. (shrink)

The study aims to contribute to understand the Vitruvian design system through the analysis of the temples described in the text leading to the three key concepts related: proportio, commensus and commodulatio. At first, it is proposed a conceptual discussion about the origin of the compositional elements, and further it is discussed the concept of proportio as an operation of sizing and scaling these elements individually. Analyzed the definition and types of elements, it is proposed to continue the discussion (...) on the relationship that must be built as a way of associating elements in a consistent way, leading to the notion of symmetria, understood as an ideal state in which the elements maintain dimensional and/or geometrical relationships between them, creating a relational harmony. From the operational point of view, it is sought to demonstrate that the Vitruvian symmetria is fetched from two types of relations: a modular and a dimensional. (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)

Concepts of space and time are widely developed in physics. However, there is a considerable lack of biologically plausible theoretical frameworks that can demonstrate how space and time dimensions are implemented in the activity of the most complex life-system – the brain with a mind. Brain activity is organized both temporally and spatially, thus representing space-time in the brain. Critical analysis of recent research on the space-time organization of the brain’s activity pointed to the existence of so-called operational space-time (...) in the brain. This space-time is limited to the execution of brain operations of differing complexity. During each such brain operation a particular short-term spatio-temporal pattern of integrated activity of different brain areas emerges within related operational space-time. At the same time, to have a fully functional human brain one needs to have a subjective mental experience. Current research on the subjective mental experience offers detailed analysis of space-time organization of the mind. According to this research, subjective mental experience (subjective virtual world) has definitive spatial and temporal properties similar to many physical phenomena. Based on systematic review of the propositions and tenets of brain and mind space-time descriptions, our aim in this review essay is to explore the relations between the two. To be precise, we would like to discuss the hypothesis that via the brain operational space-time the mind subjective space-time is connected to otherwise distant physical space-time reality. (shrink)

In this paper, I provide a new reading of Wittgenstein’s N operator, and of its significance within his early logical philosophy. I thereby aim to resolve a longstanding scholarly controversy concerning the expressive completeness of N. Within the debate between Fogelin and Geach in particular, an apparent dilemma emerged to the effect that we must either concede Fogelin’s claim that N is expressively incomplete, or reject certain fundamental tenets within Wittgenstein’s logical philosophy. Despite their various points of disagreement, however, Fogelin (...) and Geach nevertheless share several common and problematic assumptions regarding Wittgenstein’s logical philosophy, and it is these mistaken assumptions which are the source of the dilemma. Once we recognize and correct these, and other, associated expository errors, it will become clear how to reconcile the expressive completeness of Wittgenstein’s N operator, with several commonly recognized features of, and fundamental theses within, the Tractarian logical system. (shrink)

If anyone deserves the title "father of social cognition," it is William J. McGuire who, along with his wife and colleague Claire V. McGuire, has written the ...

The purpose of this article is to provide a multi-perspective examination of one of the most important contemporary security issues: weaponized, and especially lethal, artificial intelligence. This technology is increasingly associated with the approaching dramatic change in the nature of warfare. What becomes particularly important and evermore intensely contested is how it becomes embedded with and concurrently impacts two social structures: ethics and law. While there has not been a global regime banning this technology, regulatory attempts at establishing a ban (...) have intensified along with acts of resistance and blocking coalitions. This article aims to reflect on the prospects and limitations, as well as the ethical and legal intensity, of the emerging regulatory framework. To allow for such an investigation, a power-analytical approach to studying international security regimes is utilized. (shrink)

In this paper, we use a ‘normality operator’ in order to generate logics of formal inconsistency and logics of formal undeterminedness from any subclassical many-valued logic that enjoys a truth-functional semantics. Normality operators express, in any many-valued logic, that a given formula has a classical truth value. In the first part of the paper we provide some setup and focus on many-valued logics that satisfy some of the three properties, namely subclassicality and two properties that we call fixed-point negation property (...) and conservativeness. In the second part of the paper, we introduce normality operators and explore their formal behaviour. In the third and final part of the paper, we establish a number of classical recapture results for systems of formal inconsistency and formal undeterminedness that satisfy some or all the properties above. These are the main formal results of the paper. Also, we illustrate concrete cases of recapture by discussing the logics $\mathsf{K}^{\circledast }_{3}$, $\mathsf{LP}^{\circledast }$, $\mathsf{K}^{w\circledast }_{3}$, $\mathsf{PWK}^{\circledast }$ and $\mathsf{E_{fde}}^{\circledast }$, that are in turn extensions of $\mathsf{{K}_{3}}$, $\mathsf{LP}$, $\mathsf{K}^{w}_{3}$, $\mathsf{PWK}$ and $\mathsf{E_{fde}}$, respectively. (shrink)

The standard dogmatism ignores the fact that neural coding is extremely flexible, and the degree of “coarseness” versus “locality” of representation in real brains can be different under different task conditions. The real question that should be asked is: What is the operating point of neural coding under natural behavioural conditions? Several sources of evidence suggest that under natural conditions some degree of distribution of coding pervades the nervous system.

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)

Polarized unification grammar (PUG) is a linguistic formalism which uses polarities to better control the way grammar fragments interact. The grammar combination operation of PUG was conjectured to be associative. We show that PUG grammar combination is not associative, and even attaching polarities to objects does not make it order-independent. Moreover, we prove that no non-trivial polarity system exists for which grammar combination is associative. We then redefine the grammar combination operator, moving to the powerset domain, in a way (...) that guarantees associativity. The method we propose is general and is applicable to a variety of tree-based grammar formalisms. (shrink)