We show that the e-degree 0'e and the map u ↦ u' are definable in the upper semilattice of all e-degrees. The class of total e-degrees ≥0'e is also definable.

Emerging technologies such as cloud computing, augmented and virtual reality, artificial intelligence and robotics, among others, are transforming the field of manufacturing and industry as a whole in unprecedent ways. This fourth industrial revolution is consequentially changing how operators that have been crucial to industry success go about their practices in industrial environments. This short paper briefly introduces the notion of the Operator 4.0 as well as how this novel way of conceptualizing the human operator necessarily implicates human (...) values in the technologies that constitute it. Similarly, the design methodology known as value sensitive design (VSD) is drawn upon to discuss how these Operator 4.0 technologies can be design for human values and, conversely, how a potential value-sensitive Operator 4.0 can be used to strengthen the VSD methodology in developing novel technologies. (shrink)

In this paper the modal operator "x is provable in Peano Arithmetic" is incorporated into first-order theories. A provability extension of a theory is defined. Presburger Arithmetic of addition, Skolem Arithmetic of multiplication, and some first order theories of partial consistency statements are shown to remain decidable after natural provability extensions. It is also shown that natural provability extensions of a decidable theory may be undecidable.

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).

In the present paper, we show the first-order definability of the jump operator in the upper semi-lattice of the \-enumeration degrees. As a consequence, we derive the isomorphicity of the automorphism groups of the enumeration and the \-enumeration degrees.

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)

In order to develop efficient tools for automated reasoning with inconsistency (theorem provers), eventually making Logics of Formal inconsistency (_LFI_) a more appealing formalism for reasoning under uncertainty, it is important to develop the proof theory of the first-order versions of such _LFI_s. Here, we intend to make a first step in this direction. On the other hand, the logic _Ciore_ was developed to provide new logical systems in the study of inconsistent databases from the point of view of _LFI_s. (...) An interesting fact about _Ciore_ is that it has a _strong_ consistency operator, that is, a consistency operator which (forward/backward) propagates inconsistency. Also, it turns out to be an algebraizable logic (in the sense of Blok and Pigozzi) that can be characterized by means of a 3-valued logical matrix. Recently, a first-order version of _Ciore_, namely _QCiore_, was defined preserving the spirit of _Ciore_, that is, without introducing unexpected relationships between the quantifiers. Besides, some important model-theoretic results were obtained for this logic. In this paper we study some proof–theoretic aspects of both _Ciore_ and _QCiore_ respectively. In first place, we introduce a two-sided sequent system for _Ciore_. Later, we prove that this system enjoys the cut-elimination property and apply it to derive some interesting properties. Later, we extend the above-mentioned system to first-order languages and prove completeness and cut-elimination property using the well-known Shütte’s technique. (shrink)

In this note we introduce and study algebras of type such that is a bounded distributive lattice and ⌝ is an operator that satisfies the condition ⌝ = a ⌝ b and ⌝ 0 = 1. We develop the topological duality between these algebras and Priestley spaces with a relation. In addition, we characterize the congruences and the subalgebras of such an algebra. As an application, we will determine the Priestley spaces of quasi-Stone algebras.

The paper argues, that a direct formalization of the way common sense thinks about the numerical identity of enduring entities, requires that traditional predicate logic is developed. If everyday language mirrors the world, then persons, organisms, organs, cells, and ordinary material things can lose some parts but nonetheless remain numerically exactly the same entity. In order to formalize this view, two new logical operators are introduced; and they bring with them some non-standard syntax. One of the operators is called ‘the (...) instantiation operator’; it is needed because the existential quantifier and its traditional relatives cannot do the job required. The other operator is called ‘the form-on-matter operator’, and it allows an individual (an instance of a form) to stay the same even though some of its parts (its constituting matter) is taken away from it. Also, a certain kind of predicates, called ‘nature terms’, is needed in order to represent what gives a particular its kind of identity. Both the operators and the nature terms introduced can be used in constructions of formal languages and formal systems, but no such constructions are made in the paper. The paper is structured as a comment on the philosophical problem called ‘the problem of the cats Tibbles and Tib’. (shrink)

This paper studies, by way of an example, the intuitionistic propositional connective * defined in the language of second order propositional logic by * ≡ ∃Q. In full topological models * is not generally definable but over Cantor-space and the reals it can be classically shown that *↔ ⅂⅂P; on the other hand, this is false constructively, i.e. a contradiction with Church's thesis is obtained. This is comparable with some well-known results on the completeness of intuitionistic first-order predicate logic. Over (...) [0, 1], the operator * is undefinable. We show how to recast this argument in terms of intuitive intuitionistic validity in some parameter. The undefinability argument essentially uses the connectedness of [0, 1]; most of the work of recasting consists in the choice of a suitable intuitionistically meaningful parameter, so as to imitate the effect of connectedness. Parameters of the required kind can be obtained as so-called projections of lawless sequences. (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.

It was shown in [3] (see also [5]) that there is a duality between the category of bounded distributive lattices endowed with a join-homomorphism and the category of Priestley spaces endowed with a Priestley relation. In this paper, bounded distributive lattices endowed with a join-homomorphism, are considered as algebras and we characterize the congruences of these algebras in terms of the mentioned duality and certain closed subsets of Priestley spaces. This enable us to characterize the simple and subdirectly irreducible algebras. (...) In particular, Priestley relations enable us to characterize the congruence lattice of the Q-distributive lattices considered in [4]. Moreover, these results give us an effective method to characterize the simple and subdirectly irreducible monadic De Morgan algebras [7].The duality considered in [4], was obtained in terms of the range of the quantifiers, and such a duality was enough to obtain the simple and subdirectly irreducible algebras, but not to characterize the congruences. (shrink)

We show the completeness of a Hilbert-style system LK defined by M. Valiev involving the knowledge operator K dedicated to the reasoning with incomplete information. The completeness proof uses a variant of Makinson's canonical model construction. Furthermore we prove that the theoremhood problem for LK is co-NP-complete, using techniques similar to those used to prove that the satisfiability problem for propositional S5 is NP-complete.

Let K = (p, q...; &, ∨, ~) be a zeroth-order formal language with sentence variables p, q..., two place connectives & (and), ∨ (or) and negation sign ~, and let F be the formula algebra (set of well-formed formulas in K defined in the standard way by induction from the sentence variables). If v is an assignment of truth values 1(true), 0(f alse) to the sentence variables p, q..., then classical propositional logic is characterized by extending v by induction (...) from p, q... to the formula algebra F in such a manner that the extension (called interpretation and also denoted by v) be a “homomorphism” from F into the two-element Boolean algebra B 2 ≡ (1, 0, ⋂, ⋃, ⊥), where “homomorphism” means that the following hold υ(q&p)=υ(q)∩υ(p)υ(q∨p)=υ(q)∪υ(p)υ(∼q)=υ(q)⊥. (shrink)

Operators can be compared in at least two respects: expressive strength and deductive strength. Inspired by Hintikka’s treatment of question embedding verbs, the variations of noncontingency operator, and also the various combinations of modal operators and Boolean connectives, we propose a logic with strong noncontingency operator as the only primitive modality. The novel operator is deductively but not expressively stronger than both noncontingency operator and essence operator, and expressively but not deductively weaker than the necessity (...) operator. The frame-definability power of this new logic is in between standard modal logic and noncontingency logic. A notion of bisimulation is proposed to characterize this logic within standard modal logic and first-order logic. Axiomatizations over various frame classes are presented, among which the minimal logic is related to the treatment of an alternative semantics of the agreement operator proposed by Lloyd Humberstone. (shrink)

The jump operator on the ω-enumeration degrees was introduced in [I.N. Soskov, The ω-enumeration degrees, J. Logic Computat. 17 1193–1214]. In the present paper we prove a jump inversion theorem which allows us to show that the enumeration degrees are first order definable in the structure of the ω-enumeration degrees augmented by the jump operator. Further on we show that the groups of the automorphisms of and of the enumeration degrees are isomorphic. In the second part of the (...) paper we study the jumps of the ω-enumeration degrees below . We define the ideal of the almost zero degrees and obtain a natural characterization of the class H of the ω-enumeration degrees below which are high n for some n and of the class L of the ω-enumeration degrees below which are low n for some n. (shrink)

It is a well known empirical observation that natural axiomatic theories are pre-well-ordered by consistency strength. For any natural theory $T$, the next strongest natural theory is $T+\mathsf{Con}_T$. We formulate and prove a statement to the effect that the consistency operator is the weakest natural way to uniformly extend axiomatic theories.

Explaining the emergence of stochastic irreversible macroscopic dynamics from time-reversible deterministic microscopic dynamics is one of the key problems in philosophy of physics. The Mori-Zwanzig projection operator formalism, which is one of the most important methods of modern nonequilibrium statistical mechanics, allows for a systematic derivation of irreversible transport equations from reversible microdynamics and thus provides a useful framework for understanding this issue. However, discussions of the MZ formalism in philosophy of physics tend to focus on simple variants rather (...) than on the more sophisticated ones used in modern physical research. In this work, I will close this gap by studying the problems of probability and irreversibility using the example of Grabert’s time-dependent projection operator formalism. This allows to better understand how general proposals for understanding probability in statistical mechanics, namely quantum approaches and almost-objective probabilities, can be accomodated in the MZ formalism. Moreover, I will provide a detailed physical analysis, based on the MZ formalism, of various proposals from the philosophical literature, such as Robertson’s theory of justifying coarse-graining via autonomous macrodynamics, Myrvold’s problem of explaining autonomous macrodynamics, and Wallace’s simple dynamical conjecture. (shrink)

In theTractatus, Wittgenstein advocates two major notational innovations in logic. First, identity is to be expressed by identity of the sign only, not by a sign for identity. Secondly, only one logical operator, called “N” by Wittgenstein, should be employed in the construction of compound formulas. We show that, despite claims to the contrary in the literature, both of these proposals can be realized, severally and jointly, in expressively complete systems of first-order logic. Building on early work of Hintikka’s, (...) we identify three ways in which the first notational convention can be implemented, show that two of these are compatible with the text of theTractatus, and argue on systematic and historical grounds, adducing posthumous work of Ramsey’s, for one of these as Wittgenstein’s envisaged method. With respect to the second Tractarian proposal, we discuss how Wittgenstein distinguished between general and non-general propositions and argue that, claims to the contrary notwithstanding, an expressively adequate N-operator notation is implicit in theTractatuswhen taken in its intellectual environment. We finally introduce a variety of sound and complete tableau calculi for first-order logics formulated in a Wittgensteinian notation. The first of these is based on the contemporary notion of logical truth as truth in all structures. The others take into account the Tractarian notion of logical truth as truth in all structures over one fixed universe of objects. Here the appropriate tableau rules depend on whether this universe is infinite or finite in size, and in the latter case on its exact finite cardinality.As it is obviously easy to express how propositions can be constructed by means of this operation and how propositions are not to be constructed by means of it, this must be capable of exact expression.5.503. (shrink)

It is a widely held view in philosophy that propositions perform a plethora of different theoretical roles. Amongst other things, they are believed to be the semantic values of sentences in contexts, the objects of attitudes, the contents of illocutionary acts, and the referents of that-clauses. This assumption is often combined with the claim that propositions have their truth-values eternally. In this paper I aim to show that these two assumptions are incompatible: propositions cannot both fulfill the mentioned roles and (...) be eternally true or false. Following Kaplan and Lewis’s Operator Argument, I argue that compositional semantic values of sentences in contexts do not correspond to eternal propositions. Thus, either we regard the non-eternal entities that in fact realize the semantic role of propositions as also fulfilling the remaining propositional roles, or we abandon the assumption that there is a unique realizer of all the roles. The Operator Argument has recently come under attack, mainly for its tense-logical assumptions. However, rejecting these assumptions is not a sufficient defense of the compatibility of the two claims, since the extensional alternative to the tense-logical framework does not allow us to universally retain eternal propositions as compositional semantic values of sentences either. (shrink)

In [2] a semantics for implication is offered that makes use of stories — sets of sentences assembled under various constraints. Sentences are evaluated at an actual world and in each member of a set of stories. A sentence B is true in a story s just when B s. A implies B iff for all stories and the actual world, whenever A is true, B is true. In this article the first-order language of [2] is extended by the addition (...) of the operator the story... says that..., as in The story Flashman among the Redskins says that Flashman met Sitting Bull. The resulting language is shown to be sound and complete. (shrink)

It is well known that the structure of honest elementary degrees is a lattice with rather strong density properties. Let $\mbox{\bf a} \cup \mbox{\bf b}$ and $\mbox{\bf a} \cap \mbox{\bf b}$ denote respectively the join and the meet of the degrees $\mbox{\bf a}$ and $\mbox{\bf b}$ . This paper introduces a jump operator ( $\cdot'$ ) on the honest elementary degrees and defines canonical degrees $\mbox{\bf 0},\mbox{\bf 0}', \mbox{\bf 0}^{\prime \prime },\ldots$ and low and high degrees analogous to the (...) corresponding concepts for the Turing degrees. Among others, the following results about the structure of the honest elementary degrees are shown: There exist low degrees, and there exist degrees which are neither low nor high. Every degree above $\mbox{\bf 0}'$ is the jump of some degree, moreover, for every degree $\mbox{\bf c}$ above $\mbox{\bf 0}'$ there exist degrees $\mbox{\bf a},\mbox{\bf b}$ such that $\mbox{\bf c}=\mbox{\bf a} \cup \mbox{\bf b} = \mbox{{\bf a}}'=\mbox{\bf b}'$ . We have $\mbox{\bf a}'\cup \mbox{\bf b}' \leq (\mbox{\bf a}\cup\mbox{\bf b})'$ and $\mbox{\bf a}'\cap \mbox{\bf b}' \geq (\mbox{\bf a}\cap \mbox{\bf b})'$ . The jump operator is of course monotonic, i.e. $\mbox{\bf a}\leq\mbox{{\bf b}}\Rightarrow \mbox{\bf a}'\leq \mbox{\bf b}'$ . We prove that every situation compatible with $\mbox{\bf a}\leq\mbox{\bf b}\Rightarrow \mbox{\bf a}'\leq \mbox{\bf b}'$ is realized in the structure, e.g. we have incomparable degrees $\mbox{\bf a},\mbox{\bf b}$ such that $\mbox{\bf a}'<\mbox{\bf b}'$ and incomparable degrees $\mbox{\bf a},\mbox{\bf b}$ such that $\mbox{\bf a}' = \mbox{\bf b}'$ etcetera. We are able to prove all these results without the traditional recursion theoretic constructions. Our proof method relies on the fact that the growth of the functions in a degree is bounded. This technique also yields a very simple proof of an old result, namely that the structure is a lattice. (shrink)

In [9]. Yates proved the existence of a Turing degree a such that 0. 0′ are the only c.e. degrees comparable with it. By Slaman and Steel [7], every degree below 0′ has a 1-generic complement, and as a consequence. Yates degrees can be 1-generic, and hence can be low. In this paper, we prove that Yates degrees occur in every jump class.

In this paper we present a tableau system for deontic logics with the operator of explicit permission. By means of this system the decidability of the considered logics can be proved. We will sketch how these logics are semantically defined by means of relating semantics and how they provide a simple solution to the free choice permission problem. In short, these logics employ relating implication and a certain propositional constant. These two are in turn used to define deontic operators (...) similarly as in Andersonian-Kangerian reduction, which uses different intensional implications and constants. (shrink)

A common reducible representation space of the Lie algebras su and su is equipped with two different types of scalar products. The representation bases are labeled by the azimuthal and magnetic quantum numbers. The generators of su are the x-, y- and z-components of the orbital angular momentum operator. The representation of each of these Lie algebras is unitary with respect to only one of the scalar products. To each positive magnetic quantum number a family of the su-Barut–Girardello coherent (...) states is associated. The normalization and resolution of the identity condition for the coherent states are realized in two different approaches, i.e. the unitary and the non-unitary approaches. For the coherent states of the non-unitary case we calculate the uncertainty relation for the Hermitian x- and y-components of the angular momentum operator. While the unitary case leads to the known uncertainty relation for the Hermitian x- and y-components of su Lie algebra. (shrink)

Starting from the formal expressions of the hydrodynamical (or “local”) quantities employed in the applications of Clifford algebras to quantum mechanics, we introduce—in terms of the ordinary tensorial language—a new definition for the field of a generic quantity. By translating from Clifford into tensor algebra, we also propose a new (nonrelativistic) velocity operator for a spin- ${\frac{1}{2}}$ particle. This operator appears as the sum of the ordinary part p/m describing the mean motion (the motion of the center-of-mass), and (...) of a second part associated with the so-called Zitterbewegung, which is the spin “internal” motion observed in the center-of-mass frame (CMF). This spin component of the velocity operator is nonzero not only in the Pauli theoretical framework, i.e., in the presence of external electromagnetic fields with a nonconstant spin function, but also in the Schrödinger case, when the wavefunction is a spin eigenstate. Thus, one gets even in the latter case a decomposition of the velocity field for the Madelung fluid into two distinct parts, which constitutes the nonrelativistic analogue of the Gordon decomposition for the Dirac current. Explicit calculations are presented for the velocity field in the particular cases of the hydrogen atom, of a spherical well potential, and of an electron in a uniform magnetic field. We find, furthermore, that the Zitterbewegung motion involves a velocity field which is solenoidal, and that the local angular velocity is parallel to the spin vector. In the presence of a nonuniform spin vector (Pauli case) we have, besides the component of the local velocity normal to the spin (present even in the Schrödinger theory), also a component which is parallel to the curl of the spin vector. (shrink)

We study the behavior of the game operator $$ on Wadge classes of Borel sets. In particular we prove that the classical Moschovakis results still hold in this setting. We also characterize Wadge classes ${\bf{\Gamma }}$ for which the class has the substitution property. An effective variation of these results shows that for all $1 \le \eta < \omega _1^{{\rm{CK}}}$ and $2 \le \xi < \omega _1^{{\rm{CK}}}$, is a Spector class while is not.

Why are natural theories pre-well-ordered by consistency strength? In previous work, an approach to this question was proposed. This approach was inspired by Martin's Conjecture, one of the most prominent conjectures in recursion theory. Fixing a reasonable subsystem $T$ of arithmetic, the goal was to classify the recursive functions that are monotone with respect to the Lindenbaum algebra of $T$. According to an optimistic conjecture, roughly, every such function must be equivalent to an iterate $\mathsf{Con}_T^\alpha$ of the consistency operator (...) ``in the limit'' within the ultrafilter of sentences that are true in the standard model. In previous work the author established the first case of this optimistic conjecture; roughly, every recursive monotone function is either as weak as the identity operator in the limit or as strong as $\mathsf{Con}_T$ in the limit. Yet in this note we prove that this optimistic conjecture fails already at the next step; there are recursive monotone functions that are neither as weak as $\mathsf{Con}_T$ in the limit nor as strong as $\mathsf{Con}_T^2$ in the limit. In fact, for every $\alpha$, we produce a function that is cofinally equivalent to $\mathsf{Con}^\alpha_T$ yet cofinally equivalent to $\mathsf{Con}_T$. (shrink)

To meet the growing demands for yet more efficient and safer traffic, traffic control is deployed in all modes of transportation. In maritime transportation, traffic control is performed by Vessel Traffic Services (VTS). This paper describes research which is focused upon measurement of VTS operator performance. The concept of situation awareness is introduced as a means to describe and quantify VTS operator performance. Situation awareness is tested in a full scale interactive simulator. A scoring system for VTS (...) class='Hi'>operator performance accounts for the specific characteristics of VTS operator work, such as accuracy and relevance of information. (shrink)

We investigate an expansion of quasi-MV algebras ([10]) by a genuine quantum unary operator. The variety of such quasi-MV algebras has a subquasivariety whose members—called cartesian—can be obtained in an appropriate way out of MV algebras. After showing that cartesian . quasi-MV algebras generate ,we prove a standard completeness theorem for w.r.t. an algebra over the complex numbers.

This paper proposes an extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system. Chaitin's Ω is defined as the probability that the universal self-delimiting Turing machine U halts, and plays a central role in the development of algorithmic information theory. In the theory, there are two equivalent ways to define the program-size complexity H of a given finite binary string s. In the standard way, H is defined as the length of the (...) shortest input string for U to output s. In the other way, the so-called universal probability m is introduced first, and then H is defined as –log2m without reference to the concept of program-size.Mathematically, the statistics of outcomes in a quantum measurement are described by a positive operator-valued measure in the most general setting. Based on the theory of computability structures on a Banach space developed by Pour-El and Richards, we extend the universal probability to an analogue of POVM in an infinite dimensional quantum system, called a universal semi-POVM. We also give another characterization of Chaitin's Ω numbers by universal probabilities. Then, based on this characterization, we propose to define an extension of Ω as a sum of the POVM elements of a universal semi-POVM. The validity of this definition is discussed.In what follows, we introduce an operator version equation image of H in a Hilbert space of infinite dimension using a universal semi-POVM, and study its properties. (shrink)

An explicit expression of the “Wigner operator” is derived, such that the Wigner function of a quantum state is equal to the expectation value of this operator with respect to the same state. This Wigner operator leads to a representation-independent procedure for establishing the correspondence between the inhomogeneous symplectic group applicable to linear canonical transformations in classical mechanics and the Weyl-metaplectic group governing the symmetry of unitary transformations in quantum mechanics.

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)

ABSTRACT In this work the connections between the fuzzy closure operators and the graded consequence relations are examined Namely, as it is well known, in the crisp case there is a complete equivalence between the notion of closure operator and the one of consequence relation. We extend this result by proving that the graded consequence relations are related to a particular class of fuzzy closure operators, namely the class of fuzzy closure operators that can be obtained by a chain (...) of classical closure operators. (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.

Tarski presented his definition of consequence operator to explain the most important notions which any logical consequence concept must contemplate. A Tarski space is a pair constituted by a nonempty set and a consequence operator. This structure characterizes an almost topological space. This paper presents an algebraic view of the Tarski spaces and introduces a modal propositional logic which has as a model exactly the closed sets of a Tarski space. • DOI:10.5007/1808-1711.2010v14n1p47.