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.

Journal of Mathematical Logic, Volume 23, Issue 02, August 2023. In mathematical logic there are two seemingly distinct kinds of principles called “reflection principles.” Semantic reflection principles assert that if a formula holds in the whole universe, then it holds in a set-sized model. Syntactic reflection principles assert that every provable sentence from some complexity class is true. In this paper, we study connections between these two kinds of reflection principles in the setting of second-order arithmetic. We prove that, for (...) a large swathe of theories, [math]-model reflection is equivalent to the claim that arbitrary iterations of uniform [math] reflection along countable well-orderings are [math]-sound. This result yields uniform ordinal analyzes of theories with strength between [math] and [math]. The main technical novelty of our analysis is the introduction of the notion of the proof-theoretic dilator of a theory [math], which is the operator on countable ordinals that maps the order-type of [math] to the proof-theoretic ordinal of [math]. We obtain precise results about the growth of proof-theoretic dilators as a function of provable [math]-model reflection. This approach enables us to simultaneously obtain not only [math], [math] and [math] ordinals but also reverse-mathematical theorems for well-ordering principles. (shrink)

This paper discusses the relation between the minimal positive relevant logic B and intersection and union type theories. There is a marvelous coincidence between these very differently motivated research areas. First, we show a perfect fit between the Intersection Type Discipline ITD and the tweaking BT of B, which saves implication and conjunction but drops disjunction . The filter models of the -calculus (and its intimate partner Combinatory Logic CL) of the first author and her coauthors then become theory models (...) of these calculi. (The logician's "theory" is the algebraist's "filter".) The coincidence extends to a dual interpretation of key particles—the subtype translates to provable , type intersection to conjunction , function space to implication, and whole domain to the (trivially added but trivial) truth T. This satisfying ointment contains a fly. For it is right, proper, and to be expected that type union should correspond to the logical disjunction of B. But the simulation of functional application by a fusion (or modus ponens product) operation on theories leaves the key Bubbling lemma of work on ITD unprovable for the -prime theories now appropriate for the modeling. The focus of the present paper lies in an appeal to Harrop theories which are (a) prime and (b) closed under fusion. A version of the Bubbling lemma is then proved for Harrop theories, which accordingly furnish a model of and CL. (shrink)

It is well known that any finitary operation is recursive in a suitable total numeration. A. Orlicki showed that there is an ω-operation not recursive in any total numeration. We will show that any ω-operation is recursive in a partial numeration.

In his Tractatus, Wittgenstein maintained that arithmetic consists of equations arrived at by the practice of calculating outcomes of operations$\Omega ^{n}(\bar {\xi })$defined with the help of numeral exponents. Since$Num$(x) and quantification over numbers seem ill-formed, Ramsey wrote that the approach is faced with “insuperable difficulties.” This paper takes Wittgenstein to have assumed that his audience would have an understanding of the implicit general rules governing his operations. By employing the Tractarian logicist interpretation that theN-operator$N(\bar {\xi })$and recursively (...) defined arithmetic operators$\Omega ^{n}(\bar {\xi })$are not different in kind, we can address Ramsey’s problem. Moreover, we can take important steps toward better understanding how Wittgenstein might have imagined emulating proof by mathematical induction. (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.

In this note, the problem of tracking random references and rejecting random perturbations in a quadrotor, both generated by an auxiliary system named exosystem, is solved by extending the deterministic tracking problem to the area of stochastic processes. Besides, it is considered that only a part of the state vector of the quadrotor is available through measurements. As a consequence, the state vector of the plant must be estimated in order to close the control loop. On this basis, a controller (...) to track random references and to reject random perturbations is developed by combining a Kalman filter to estimate the references and perturbations of an exosystem and an observer to estimate the states of a quadrotor. Besides, to obtain a more practical controller, the analysis is carried out in discrete time. Numerical simulations are used in a quadrotor to confirm the validity and effectiveness of the proposed control. (shrink)

Van Lambalgen's Theorem plays an important role in algorithmic randomness, especially when studying relative randomness. In this paper we extend van Lambalgen's Theorem by considering the join of infinitely many reals which are random relative to each other. In addition, we study computability of the reals in the range of Omega operators. It is known that $\Omega^{\phi'}$ is high. We extend this result to that $\Omega^{\phi^{(n)}}$ is $\textrm{high}_n$ . We also prove that there exists A such that, (...) for each n , the real $\Omega^A_M$ is $\textrm{high}_n$ for some universal Turing machine M by using the extended van Lambalgen's Theorem. (shrink)

As a natural example of a 1-random real, Chaitin proposed the halting probability Ω of a universal prefix-free machine. We can relativize this example by considering a universal prefix-free oracle machine U. Let [Formula: see text] be the halting probability of UA; this gives a natural uniform way of producing an A-random real for every A ∈ 2ω. It is this operator which is our primary object of study. We can draw an analogy between the jump operator from (...) computability theory and this Omega operator. But unlike the jump, which is invariant under the choice of an effective enumeration of the partial computable functions, [Formula: see text] can be vastly different for different choices of U. Even for a fixed U, there are oracles A =* B such that [Formula: see text] and [Formula: see text] are 1-random relative to each other. We prove this and many other interesting properties of Omega operators. We investigate these operators from the perspective of analysis, computability theory, and of course, algorithmic randomness. (shrink)

Looking at the operation of forming neat $\alpha $ -reducts as a functor, with $\alpha $ an infinite ordinal, we investigate when such a functor obtained by truncating $\omega $ dimensions, has a right adjoint. We show that the neat reduct functor for representable cylindric algebras does not have a right adjoint, while that of polyadic algebras is an equivalence. We relate this categorial result to several amalgamation properties for classes of representable algebras. We show that the variety of (...) cylindric algebras of infinite dimension, endowed with the merry go round identities, fails to have the amalgamation property answering a question of Németi’s. We also study two variants of the so-called cylindric polyadic algebras introduced by Ferenczi (all are reducts of polyadic equality algebras, that are also varieties). We show that one is more cylindric than polyadic, and that the other is more polyadic than cylindric. Our classification is determined by results on neat embeddings and amalgamation expressed from the point of view of category theory, thereby witnessing, and, indeed, further emphasizing, the dichotomy between the cylindric and polyadic paradigms. For example, the first class does not have the unique neat embedding property, fails to have the amalgamation property and the neat reduct functor does not have a right adjoint, while the second class has the unique neat emdedding property, the superamalgamation property and the neat reduct functor is strongly invertible. Other results, like first order definability of the class of neat reducts and the class of completely representable algebras, confirming our classification along these lines are presented. (shrink)

We consider Borel sets of finite rank $A \subseteq\Lambda^\omega$ where cardinality of Λ is less than some uncountable regular cardinal K. We obtain a "normal form" of A, by finding a Borel set Ω, such that A and Ω continuously reduce to each other. In more technical terms: we define simple Borel operations which are homomorphic to ordinal sum, to multiplication by a countable ordinal, and to ordinal exponentiation of base K, under the map which sends every Borel set (...) A of finite rank to its Wadge degree. (shrink)

We study large cardinal properties associated with Ramseyness in which homogeneous sets are demanded to satisfy various transfinite degrees of indescribability. Sharpe and Welch [25], and independently Bagaria [1], extended the notion of $\Pi ^1_n$ -indescribability where $n<\omega $ to that of $\Pi ^1_\xi $ -indescribability where $\xi \geq \omega $. By iterating Feng’s Ramsey operator [12] on the various $\Pi ^1_\xi $ -indescribability ideals, we obtain new large cardinal hierarchies and corresponding nonlinear increasing hierarchies of normal (...) ideals. We provide a complete account of the containment relationships between the resulting ideals and show that the corresponding large cardinal properties yield a strict linear refinement of Feng’s original Ramsey hierarchy. We isolate Ramsey properties which provide strictly increasing hierarchies between Feng’s $\Pi _\alpha $ -Ramsey and $\Pi _{\alpha +1}$ -Ramsey cardinals for all odd $\alpha <\omega $ and for all $\omega \leq \alpha <\kappa $. We also show that, given any ordinals $\beta _0,\beta _1<\kappa $ the increasing chains of ideals obtained by iterating the Ramsey operator on the $\Pi ^1_{\beta _0}$ -indescribability ideal and the $\Pi ^1_{\beta _1}$ -indescribability ideal respectively, are eventually equal; moreover, we identify the least degree of Ramseyness at which this equality occurs. As an application of our results we show that one can characterize our new large cardinal notions and the corresponding ideals in terms of generic elementary embeddings; as a special case this yields generic embedding characterizations of $\Pi ^1_\xi $ -indescribability and Ramseyness. (shrink)

A function is recursive (in given operations) if its values are computed explicitly and uniformly in terms of other "previously computed" values of itself and (perhaps) other "simultaneously computed" recursive functions. Here, "explicitly" includes definition by cases. We investigate those recursive functions on the structure $\mathbf{N} = \langle \omega, 0, \operatorname{succ,pred}\rangle$ that are computed in terms of themselves only, without other simultaneously computed recursive functions.

We show that, assuming the Axiom of Determinacy, every non-selfdual Wadge class can be constructed by starting with those of level $\omega _1$ and iteratively applying the operations of expansion and separated differences. The proof is essentially due to Louveau, and it yields at the same time a new proof of a theorem of Van Wesep. The exposition is self-contained, except for facts from classical descriptive set theory.

This book concerns the foundations of epistemic modality and hyperintensionality and their applications to the philosophy of mathematics. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality and hyperintensionality relate to the computational theory of mind; metaphysical modality and hyperintensionality; the types of mathematical modality and hyperintensionality; to the epistemic status of large cardinal axioms, undecidable (...) propositions, and abstraction principles in the philosophy of mathematics; to the modal and hyperintensional profiles of the logic of rational intuition; and to the types of intention, when the latter is interpreted as a hyperintensional mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. I also develop a novel topic-sensitive truthmaker semantics for dynamic epistemic logic, and develop a novel dynamic epistemic two-dimensional hyperintensional semantics. Chapter 3 provides an abstraction principle for epistemic (hyper-)intensions. Chapter 4 advances a topic-sensitive two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the fixed points of the modal μ-calculus in order to account for the iteration of epistemic states in a single agent, by contrast to availing of modal axiom 4 (i.e. the KK principle). The fixed point operators in the modal μ-calculus are rendered hyperintensional, which yields the first hyperintensional construal of the modal μ-calculus in the literature and the first application of the calculus to the iteration of epistemic states in a single agent instead of the common knowledge of a group of agents. Chapter 6 advances a solution to the Julius Caesar problem based on Fine's `criterial' identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The topic-sensitive epistemic two-dimensional truthmaker semantics developed in chapters 2 and 4 are availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. -/- Chapters 8-12 provide cases demonstrating how the two-dimensional hyperintensions of hyperintensional, i.e. topic-sensitive epistemic two-dimensional truthmaker, semantics, solve the access problem in the epistemology of mathematics. Chapter 8 examines the interaction between my hyperintensional semantics and the axioms of epistemic set theory, large cardinal axioms, the Epistemic Church-Turing Thesis, the modal axioms governing the modal profile of Ω-logic, Orey sentences such as the Generalized Continuum Hypothesis, and absolute decidability. These results yield inter alia the first hyperintensional Epistemic Church-Turing Thesis and hyperintensional epistemic set theories in the literature. Chapter 9 examines the modal and hyperintensional commitments of abstractionism, in particular necessitism, and epistemic hyperintensionality, epistemic utility theory, and the epistemology of abstraction. I countenance a hyperintensional semantics for novel epistemic abstractionist modalities. I suggest, too, that observational type theory can be applied to first-order abstraction principles in order to make first-order abstraction principles recursively enumerable, i.e. Turing machine computable, and that the truth of the first-order abstraction principle for hyperintensions is grounded in its being possibly recursively enumerable and the machine being physically implementable. Chapter 10 examines the philosophical significance of hyperintensional Ω-logic in set theory and discusses the hyperintensionality of metamathematics. Chapter 11 provides a modal logic for rational intuition and provides a hyperintensional semantics. Chapter 12 avails of modal coalgebras to interpret the defining properties of indefinite extensibility, and avails of hyperintensional epistemic two-dimensional semantics in order to account for the interaction between the interpretational and objective modalities and truthmakers thereof. This yields the first hyperintensional category theory in the literature. I invent a new mathematical trick in which first order structures are treated as categories, and Vopenka's principle can be satisfied because of the elementary embeddings between the categories and generate Vopenka cardinals while bypassing the category of Set in category theory. Chapter 13 examines modal responses to the alethic paradoxes. Chapter 14 examines, finally, the modal and hyperintensional semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

There is a Turing computable embedding $\Phi $ of directed graphs $\mathcal {A}$ in undirected graphs. Moreover, there is a fixed tuple of formulas that give a uniform effective interpretation; i.e., for all directed graphs $\mathcal {A}$, these formulas interpret $\mathcal {A}$ in $\Phi $. It follows that $\mathcal {A}$ is Medvedev reducible to $\Phi $ uniformly; i.e., $\mathcal {A}\leq _s\Phi $ with a fixed Turing operator that serves for all $\mathcal {A}$. We observe that there is a graph (...) G that is not Medvedev reducible to any linear ordering. Hence, G is not effectively interpreted in any linear ordering. Similarly, there is a graph that is not interpreted in any linear ordering using computable $\Sigma _2$ formulas. Any graph can be interpreted in a linear ordering using computable $\Sigma _3$ formulas. Friedman and Stanley [4] gave a Turing computable embedding L of directed graphs in linear orderings. We show that there is no fixed tuple of $L_{\omega _1\omega }$ -formulas that, for all G, interpret the input graph G in the output linear ordering $L$. Harrison-Trainor and Montalbán [7] have also shown this, by a quite different proof. (shrink)

We redefine a system of varieties definable by a schema of equations to include finite dimensions. Then we present a technique using ultraproducts enabling one to lift results proved for every finite dimension to the transfinite. Let \(\bf Ord\) denote the class of all ordinals. Let \(\langle \mathbf{K}_{\alpha}: \alpha\in \bf Ord\rangle\) be a system of varieties definable by a schema. Given any ordinal \(\alpha\), we define an operator \(\mathsf{Nr}_{\alpha}\) that acts on \(\mathbf{K}_{\beta}\) for any \(\beta>\alpha\) giving an algebra in (...) \(\mathbf{K}_{\alpha}\), as an abstaction of taking \(\alpha\)-neat reducts for cylindric algebras. We show that for any positive \(k\), and any infinite ordinal \(\alpha\) that \(\mathbf{S}\mathsf{Nr}_{\alpha}\mathbf{K}_{\alpha+k+1}\) cannot be axiomatized by a finite schema over \(\mathbf{S}\mathsf{Nr}_{\alpha}\mathbf{K}_{\alpha+k}\) given that the result is valid for all finite dimensions greater than some fixed finite ordinal. We apply our results to cylindric algebras and Halmos quasipolyadic algebras with equality. As an application to our algebraic result we obtain a strong incompleteness theorem (in the sense that validitities are not captured by finitary Hilbert style axiomatizations) for an algebraizable extension of \(L_{\omega,\omega}\). (shrink)

Following the finitist’s rejection of the complete totality of the natural numbers, a finitist language allows only propositional connectives and bounded quantifiers in the formula-construction but not unbounded quantifiers. This is opposed to the currently standard framework, a first-order language. We conduct axiomatic studies on the notion of truth in the framework of finitist arithmetic in which at least smash function $\#$ is available. We propose finitist variants of Tarski ramified truth theories up to rank $\omega $, of Kripke–Feferman (...) truth theory and of Friedman–Sheard truth theory, and show that all of these have the same strength as the finitist arithmetic of one higher level along Grzegorczyk hierarchy. On the other hand, we also show that adding Burgess-style groundedness schema, adjusted to the finitist setting, makes Kripke–Feferman truth theory as strong as primitive recursive arithmetic. Meanwhile, we obtain some basic results on finitist theories of (full and hat) inductive definitions and on the second order axiom of hat inductive definitions for positive operators. (shrink)

It is shown that the determinacy of $G_{\delta \sigma }$ games of length $\omega ^2$ is equivalent to the existence of a transitive model of ${\mathsf {KP}} + {\mathsf {AD}} + \Pi _1\textrm {-MI}_{\mathbb {R}}$ containing $\mathbb {R}$. Here, $\Pi _1\textrm {-MI}_{\mathbb {R}}$ is the axiom asserting that every monotone $\Pi _1$ operator on the real numbers has an inductive fixpoint.

It is shown that for any computable field K and any r.e. degree a there is an r.e. set A of degree a and a field F ≅ K with underlying set A such that the field operations of F (including subtraction and division) are extendible to (total) recursive functions. Further, it is shown that if a and b are r.e. degrees with b ≤ a, there is a 1-1 recursive function $f: \mathbb{Q} \rightarrow \omega$ such that f(Q) ∈ (...) a, f(Z) ∈ b, and the images of the field operations of Q under f can be extended to recursive functions. (shrink)

Elementary particles are considered as local oscillators under the influence of zeropoint fields. Such oscillatory behavior of the particles leads to the deviations in their path of motion. The oscillations of the particle in general may be considered as complex rotations in complex vector space. The local particle harmonic oscillator is analyzed in the complex vector formalism considering the algebra of complex vectors. The particle spin is viewed as zeropoint angular momentum represented by a bivector. It has been shown that (...) the particle spin plays an important role in the kinematical intrinsic or local motion of the particle. From the complex vector formalism of harmonic oscillator, for the first time, a relation between mass $m$ and bivector spin $S$ has been derived in the form $\varvec{\sigma }_3 mc^2{\mathcal {J}}_{\pm } =\lambda \Omega _{\mathbf{s}} \cdot \mathrm{{S}} {\mathcal {J}}_{\pm }$ . Where, $\Omega _{s}$ is the angular velocity bivector of complex rotations, $c$ is the velocity of light. The unit vector $\varvec{\sigma }_3$ acts as an operator on the idempotents ${\mathcal {J}}_{+}$ and ${\mathcal {J}}_{-}$ to give the eigen values $\lambda =\pm 1.$ The constant $\lambda $ represents two fold nature of the equation corresponding to particle and antiparticle states. Further the above relation shows that the mass of the particle may be interpreted as a local spatial complex rotation in the rest frame. This gives an insight into the nature of fundamental particles. When a particle is observed from an arbitrary frame of reference, it has been shown that the spatial complex rotation dictates the relativistic particle motion. The mathematical structure of complex vectors in space and spacetime is developed. (shrink)

In this note we give a simplified ordinal analysis of first-order reflection. An ordinal notation system$OT$is introduced based on$\psi $-functions. Provable$\Sigma _{1}$-sentences on$L_{\omega _{1}^{CK}}$are bounded through cut-elimination on operator controlled derivations.

This book concerns the foundations of epistemic modality. I examine the nature of epistemic modality, when the modal operator is interpreted as concerning both apriority and conceivability, as well as states of knowledge and belief. The book demonstrates how epistemic modality relates to the computational theory of mind; metaphysical modality; the types of mathematical modality; to the epistemic status of large cardinal axioms, undecidable propositions, and abstraction principles in the philosophy of mathematics; to the modal profile of rational intuition; (...) and to the types of intention, when the latter is interpreted as a modal mental state. Chapter 2 argues for a novel type of expressivism based on the duality between the categories of coalgebras and algebras, and argues that the duality permits of the reconciliation between modal cognitivism and modal expressivism. Chapter 3 provides an abstraction principle for epistemic intensions. Chapter 4 advances a two-dimensional truthmaker semantics, and provides three novel interpretations of the framework along with the epistemic and metasemantic. Chapter 5 applies the fixed points of the modal $\mu$-calculus in order to account for the iteration of epistemic states, by contrast to availing of modal axiom 4. Chapter 6 advances a solution to the Julius Caesar problem based on Fine's "criterial" identity conditions which incorporate conditions on essentiality and grounding. Chapter 7 provides a ground-theoretic regimentation of the proposals in the metaphysics of consciousness and examines its bearing on the two-dimensional conceivability argument against physicalism. The epistemic two-dimensional truthmaker semantics developed in chapter 4 is availed of in order for epistemic states to be a guide to metaphysical states in the hyperintensional setting. Chapter 8 examines the modal commitments of abstractionism, in particular necessitism, and epistemic modality and the epistemology of abstraction. Chapter 9 examines the modal profile of $\Omega$-logic in set theory. Chapter 10 examines the interaction between epistemic two-dimensional semantics and absolute decidability. Chapter 11 avails of modal coalgebraic automata to interpret the defining properties of indefinite extensibility, and avails of epistemic two-dimensional semantics in order to account for the interaction of the interpretational and objective modalities thereof. The hyperintensional, epistemic two-dimensional truthmaker semantics developed in chapter 4 is applied in chapters 8, 10, and 11. Chapter 12 provides a modal logic for rational intuition. Chapter 13 examines modal responses to the alethic paradoxes. Chapter 14 examines, finally, the modal semantics for the different types of intention and the relation of the latter to evidential decision theory. (shrink)

The Critique of Judgment aims to account for the affective sharing of a common world of appearance. To accomplish this project, Kant retrieves a connection between contemplation and judgment which had lain dormant in the philosophical tradition since the time of Plato. Kant rescues the theme of contemplatio or $\theta\varepsilon\omega\rho\acute\iota\alpha$ from the Neo-platonist tradition culminating in Leibniz and Shaftesbury. This tradition took beauty as the motivation for an intuitive assimilation to the order of ideas, which are understood as principles (...) for the determination of natural form. Discovering imagination as a power through which human beings may escape the tyranny of determinate objectivity, Kant insists that taste demands an openness towards appearance, outside of cognitive and conative determination. The attitude of disinterestedness suspends objectivity and looks toward the idea of a sensus communis, which implies a human plurality. In the first two Critiques, Kant subjectivizes the Leibnizian principle of determining ground. In the third Critique he suspends this principle, while retrieving and retaining the significance of humanitas latent in the idea of sensus communis which forms the indeterminate ground for aesthetic judgments. ;The first two chapters develop a phenomenological interpretation of Kantian aesthetics. Operating with an unthematized method of phenomenological reduction, Kant uncovers features indicating the primacy of appearance over determining ground within aesthetic contemplation. The third chapter traces Kant's response to Leibniz from the pre-critical period up to the Critique of Judgment. Kant's rehabilitation of appearance emerges in opposition of the Leibnizian principle of determining ground. The fourth chapter resumes the phenomenological interpretation, now directed to illuminating Kant's apology for sensibility and his advance beyond Shaftesbury's Platonist aesthetics. Sensibility compels think to relinquish its power to determine objectivity. ;A tension emerges between the subject's powers of determination and the freedom within sensibility which escapes determination. Despite its indeterminancy, the regulative idea of a sensus communis orients a disciplined sensitivity to appearance. Beauty testifies to a fractured human subject who cannot determine its own ground and must dwell in a world of appearance among a plurality in the sharing of perspectivally situated voices. (shrink)

This article begins with a review of the framework of fuzzy probability theory. The basic structure is given by the σ-effect algebra of effects (fuzzy events) $\mathcal{E}{\text{ }}\left( {\Omega ,\mathcal{A}} \right)$ and the set of probability measures $M_1^ + {\text{ }}\left( {\Omega ,\mathcal{A}} \right)$ on a measurable space $\left( {\Omega ,\mathcal{A}} \right)$ . An observable $X:\mathcal{B} \to {\text{ }}\mathcal{E}{\text{ }}\left( {\Omega ,\mathcal{A}} \right)$ is defined, where $\begin{gathered} X:\mathcal{B} \to {\text{ }}\mathcal{E}{\text{ }}\left( {\Omega ,\mathcal{A}} \right) \\ (...) \left( {\Lambda ,{\text{ }}\mathcal{B}} \right) \\ \end{gathered} $ is the value space of X. It is noted that there exists a one-to-one correspondence between states on $\mathcal{E} \left( {\Omega ,\mathcal{A} } \right)$ and elements of $M_1^ + {\text{ }}\left( {\Omega ,\mathcal{A} } \right)$ and between observables $X:\mathcal{B} \to \mathcal{E} \left( {\Omega ,\mathcal{A} } \right)$ and σ-morphisms from $\mathcal{E} \left( {\Lambda , \mathcal{B}} \right)$ to $\mathcal{E} \left( {\Omega , \mathcal{A}} \right)$ . Various combinations of observables are discussed. These include compositions, products, direct products, and mixtures. Fuzzy stochastic processes are introduced and an application to quantum dynamics is considered. Quantum effects are characterized from among a more general class of effects. An alternative definition of a statistical map $M_1^ + {\text{ }}\left( {\Lambda ,\mathcal{B} } \right)$ is given and it is shown that any statistical map has a unique extension to a statistical operator. Finally, various combinations of statistical maps are discussed and their relationships to the corresponding combinations of observables are derived. (shrink)

We present the first-order logic of change, which is an extension of the propositional logic of change $\textsf {LC}\Box $ developed and axiomatized by Świętorzecka and Czermak. $\textsf {LC}\Box $ has two primitive operators: ${\mathcal {C}}$ to be read it changes whether and $\Box $ for constant unchangeability. It implements the philosophically grounded idea that with the help of the primary concept of change it is possible to define the concept of time. One of the characteristic axioms for ${\mathcal {C}}$ (...) is ${\mathcal {C}} A \to {\mathcal {C}}\neg A$ and one of the primitive rules is $\omega $-rule introducing $\Box $. It turns out that the next operator is definable in $\textsf {LC}\Box $. Logic $\textsf {LC}\Box $ with next is equivalent to certain fragment of $\textsf {LTL}$ extended by the appropriate definition of ${\mathcal {C}}$. Recently, $\textsf {LC}\Box $ has also been modified to the propositional logic of ‘branching’ changes $\textsf {BTC}$ by Łyczak and the logic of ‘parallel’ changes $\textsf {LC}\Box $ ↳ by Świętorzecka and Łyczak. Extended in an appropriate manner, $\textsf {BTC}$ is equivalent to a certain fragment of logic $\textsf {CTL}$ to which definitions of two kinds of changes have been added. Here we propose an extension of $\textsf {LC}\Box $ to first-order logic in which, again, the only primitive modal operators are ${\mathcal {C}}$ and $\Box $. We interpret our logic in the semantics of histories of changes. We give an axiomatic system $\textsf {LC}\Box Q$ for the considered logic, and we show selected theses about some relationships between ${\mathcal {C}}$, $\Box $ and $\forall $. Then we prove the completeness of $\textsf {LC}\Box Q$. Finally, we compare our logic with $\textsf {FOLT}$ and show the relation between $\textsf {LC}\Box Q$ and a certain fragment of the Kröger system $\varSigma $ to which the definition of ${\mathcal {C}}$ was added. (shrink)

A series of meetings, in search of industrial equity, started in Worcester, Massachusetts, August, 1867, disclosed a belief that the solution of the labor problem will not be found in trades monopolies, special legislation to reduce the hours or increase the wages of service, co-operation on present methods of ownership, exchange, and finance, or other expedients, by restricting competition, to remove evils which natural forces would expel if allowed a chance; but rather in opportunity and reciprocity, in the unrestricted liberty (...) to create and equitable exchange of values which only asks government to step out of the way. In the progress of thought, service appeared to be the source of wealth, and the true basis of exchange; while interest, rent and profit or dividends seemed inadmissible, except for work done or risk incurred. The use of one's credit was found to be a natural right, antecedently independent of human law, and free money the destined mediator between labor and capital. After this faith was reaffirmed in the Boston Convention of January, 1869, we were agreeably surprised to learn that substantially the same conclusions had been reached, by a different line of argument, twenty years before, in a series of articles published in a Worcester County newspaper over the signature of "Omega." Reprinted in 1850 and 1857, these essays generously placed at our disposal by their author, we now have the pleasure of reissuing for general circulation. The truths stated in them are as fresh and practicable today as they were twenty years ago, and the public is better prepared to receive them. (shrink)

The Friedman–Stanley jump, extensively studied by descriptive set theorists, is a fundamental tool for gauging the complexity of Borel isomorphism relations. This paper focuses on a natural computable analog of this jump operator for equivalence relations on $\omega $, written ${\dotplus }$, recently introduced by Clemens, Coskey, and Krakoff. We offer a thorough analysis of the computable Friedman–Stanley jump and its connections with the hierarchy of countable equivalence relations under the computable reducibility $\leq _c$. In particular, we show (...) that this jump gives benchmark equivalence relations going up the hyperarithmetic hierarchy and we unveil the complicated highness hierarchy that arises from ${\dotplus }$. (shrink)

We ask when, for a pair of structures $\mathcal {A}_1,\mathcal {A}_2$, there is a uniform effective procedure that, given copies of the two structures, unlabeled, always produces a copy of $\mathcal {A}_1$. We give some conditions guaranteeing that there is such a procedure. The conditions might suggest that for the pair of orderings $\mathcal {A}_1$ of type $\omega _1^{CK}$ and $\mathcal {A}_2$ of Harrison type, there should not be any such procedure, but, in fact, there is one. We construct (...) an example for which there is no such procedure. The construction involves forcing. On the way to constructing our example, we prove a general result on modifying Cohen generics. (shrink)

Let T(Ω) be the ordinal notation system from Buchholz-Schütte (1988). [The order type of the countable segmentT(Ω)0 is — by Rathjen (1988) — the proof-theoretic ordinal the proof-theoretic ordinal ofACA 0 + (Π 1 l −TR).] In particular let ↦Ω a denote the enumeration function of the infinite cardinals and leta ↦ ψ0 a denote the partial collapsing operation on T(Ω) which maps ordinals of T(Ω) into the countable segment TΩ 0 of T(Ω). Assume that the (fast growing) extended Grzegorczyk (...) hierarchy $(F_a )_{a \in T(\Omega )_0 }$ and the slow growing hierarchy $(G_a )_{a \in T(\Omega )_0 }$ are defined with respect to the natural system of distinguished fundamental sequences of Buchholz and Schütte (1988) in the following way: $$\begin{array}{*{20}c} {G_0 (n): = 0,} & {F_0 (n): = (n + 1)^2 ,} \\ {\begin{array}{*{20}c} {G_{a + 1} (n): = G_a (n) + 1,} \\ {G_l (n): = G_{l[n]} (n),} \\ \end{array} } & {\begin{array}{*{20}c} {F_{a + 1} (n): = \underbrace {F_a (...F_a }_{n + 1 - times}(n)...),} \\ {F_l (n): = F_{l[n]} (n),} \\ \end{array} } \\ \end{array}$$ wherel is a countable limit ordinal (term) and (l[n]) n ∈N is the distinguished fundamental sequence assigned tol. For each ordinal (term)a in T(Ω) and each natural numbern letC n (a) be the formal term which results from the ordinal terma by successively replacing every occurence ofψ a by $\psi _{ - 1 + C_n (a)}$ whereψ −1 is considered as a defined function symbol, namely $\psi _{ - 1} b: = F_{\psi _0 b + 1} (n + 1)$ . (Note thatψ a 0=Ω a ) In this article it is shown that for each ordinal termψ 0 a in T(Ω) there exists a natural numbern 0 such thatψ 0 C n (a) ∈ T(Ω) and $G_{\psi _0 a} (n) \leqslant F_{\psi _0 C_n (a) + 1} (n + 1)$ holds for alln≥n 0. This hierarchy comparison theorem yields a plethora of new results on nontrivial lower bounds for the slow growing ordinals — i.e. ordinals for which the slow growing hierarchy yields a classification of the provably total functions of the theory in question — of various theories of iterated inductive definitions (and subsystems ofKPi) and on the number and size of the subrecursively inaccessible ordinals — i.e. ordinals at which the extended Grzegorczyk hierarchy and the slow growing hierarchy catch up — below the proof-theoretic ordinal ofACA 0+(Π 1 l −TR). In particular these subrecursively inaccessibles ordinals are necessarily of the form $\psi _0 \Omega ..._{\Omega _\omega }$. (shrink)

You omega know something when you know it, and know that you know it, and know that you know that you know it, and so on. This paper first argues that omega knowledge matters, in the sense that it is required for rational assertion, action, inquiry, and belief. The paper argues that existing accounts of omega knowledge face major challenges. One account is skeptical, claiming that we have no omega knowledge of any ordinary claims about the (...) world. Another account embraces the KK thesis, and identifies knowledge with omega knowledge. This position faces counterexamples, and struggles to make sense of inexact knowledge. The paper then develops a new account of knowledge, by proposing the principle of Reflective Luminosity: if you know that you know something, then you omega know it. I argue that Reflective Luminosity allows for omega knowledge while avoiding the problems for KK. (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)

An $\omega$-categorical supersimple group is finite-by-abelian-by-finite, and has finite SU-rank. Every definable subgroup is commensurable with an acl-definable subgroup. Every finitely based regular type in a CM-trivial $\omega$-categorical simple theory is non-orthogonal to a type of SU-rank 1. In particular, a supersimple $\omega$-categorical CM-trivial theory has finite SU-rank.

I present an outline of the Omega Point theory, which is a model for an omnipresent, omniscient, omnipotent, evolving, personal God who is both transcendent to spacetime and immanent in it, and who exists necessarily. The model is a falsifiable physical theory, deriving its key concepts not from any religious tradition but from modern physical cosmology and computer science; from scientific materialism rather than revelation. Four testable predictions of the model are given. The theory assumes that thinking is a (...) purely physical process of the brain, and that personality dies with the brain. Nevertheless, I show that the Omega Point theory suggests a future universal resurrection of the dead very similar to the one predicted in the Judeo‐Christian‐Islamic tradition. The notions of “grace” and the “beatific vision” appear naturally in the model. (shrink)

This paper concerns the relationship between transitivity of entailment, omega-inconsistency and nonstandard models of arithmetic. First, it provides a cut-free sequent calculus for non-transitive logic of truth STT based on Robinson Arithmetic and shows that this logic is omega-inconsistent. It then identifies the conditions in McGee for an omega-inconsistent logic as quantified standard deontic logic, presents a cut-free labelled sequent calculus for quantified standard deontic logic based on Robinson Arithmetic where the deontic modality is treated as a (...) predicate, proves omega-inconsistency and shows thus, pace Cobreros et al., that the result in McGee does not rely on transitivity. Finally, it also explains why the omega-inconsistent logics of truth in question do not require nonstandard models of arithmetic. (shrink)

Der Beitrag untersucht die Formation, also gleichermaßen die Genese und die Gestalt der Londoner Werkstatt ‚Omega‘ im frühen 20. Jahrhundert, die aus dem Bloomsbury Kreis hervorgegangen ist. Es handelt sich um einen dichten Zusammenhang von Lebens-, Arbeits- und Gestaltungsformen und das Zusammenspiel von affektiven und instrumentellen Beziehungsweisen auch in der Organisationsform, die durch weitgehende Strukturlosigkeit gekennzeichnet ist. Wie sich vor diesem Hintergrund Prozesse der Konstituierung, der Entscheidungsfindung und der oft verdeckten Hierarchiebildung in künstlerischen Gemeinschaften nachvollziehen lassen, wird vor der (...) Folie der gegenwärtigen Diskussion um Kollektive entfaltet. (shrink)

Despite the undeniable epistemic progress of developmental biology from the second half of the twentieth century to the present day, there still is widespread disagreement on defining the biological term of ‘development’. This scientific field epistemologically is neither unsuccessful nor immature, thus the persistent lack of agreement on its most central concept raises some important questions: is there any need for an explicit definition of biological development, and if so, what content should the definition have? My central thesis is twofold. (...) First, that current definitions of biological development are conceptually or empirically inadequate. Second, that an explicit definition of biological development is very much needed (a) for the practical purposes of science textbooks, but more importantly is needed (b) epistemically for exposing or overcoming problematic assumptions and for partially guiding scientific research by coding the appropriate assumptions. To support this thesis, initially I will show the deficiencies of the dominant definitions of biological development; and subsequently I will provide two arguments: an Argument from Practical Purposes and an Argument from Epistemic Purposes. Finally, for accommodating practical and epistemic purposes and as a response to the inadequacy of the available definitions of development, I will propose and defend an operational definition of biological development which is aimed to be broader than the received ones, while being more precise and fruitful to conduct empirical research. (shrink)

In this paper, we discuss semantical properties of the logic \(\textbf{GL}\) of provability. The logic \(\textbf{GL}\) is a normal modal logic which is axiomatized by the the Löb formula \( \Box (\Box p\supset p)\supset \Box p \), but it is known that \(\textbf{GL}\) can also be axiomatized by an axiom \(\Box p\supset \Box \Box p\) and an \(\omega \) -rule \((\Diamond ^{*})\) which takes countably many premises \(\phi \supset \Diamond ^{n}\top \) \((n\in \omega )\) and returns a conclusion (...) \(\phi \supset \bot \). We show that the class of transitive Kripke frames which validates \((\Diamond ^{*})\) and the class of transitive Kripke frames which strongly validates \((\Diamond ^{*})\) are equal, and that the following three classes of transitive Kripke frames, the class which validates \((\Diamond ^{*})\), the class which weakly validates \((\Diamond ^{*})\), and the class which is defined by the Löb formula, are mutually different, while all of them characterize \(\textbf{GL}\). This gives an example of a proof system _P_ and a class _C_ of Kripke frames such that _P_ is sound and complete with respect to _C_ but the soundness cannot be proved by simple induction on the height of the derivations in _P_. We also show Kripke completeness of the proof system with \((\Diamond ^{*})\) in an algebraic manner. As a corollary, we show that the class of modal algebras which is defined by equations \(\Box x\le \Box \Box x\) and \(\bigwedge _{n\in \omega }\Diamond ^{n}1=0\) is not a variety. (shrink)

Sociologists studying gender have debated West and Zimmerman’s premise that “doing gender is unavoidable,” seeking to ascertain whether people can “undo” or only “redo” gender. While sociologists have been correct to focus on the interactional accomplishment of gender, they have neglected one of Garfinkel’s key insights about interaction: that people hold each other accountable to particular narratives. Neglecting the narrative aspect of doing—and undoing—gender impedes our ability to recognize processes of social change. Based on a qualitative study, we show how (...) the movement for LGBTQI acceptance within U.S. conservative Protestant churches works to make gender not “omnirelevant” by challenging conservative “complementarity” narratives that posit two complementary, opposite sexes as a commandment preceding the Ten Commandments in time and importance. We explore this movement’s ambivalent relationship with homonormativity, highlight three ways this movement resists projecting binary gender narratives into scripture, and examine how some in this movement see the pursuit of social justice as a Christian mandate. The efforts of LGBTQI conservative Christians exemplify how reshaping sex/gender/sexual narratives can create possibilities for undoing gender. (shrink)

By an "inverse iteration" of Sacks forcing over a model of $V = L$, we produce a model in which the degrees of constructibility of nonconstructible reals have order type $\omega_1^\ast$.

G is the result of adjoining the schema (qAA)qA to K; the axioms of G* are the theorems of G and the instances of the schema qAA and the sole rule of G* is modus ponens. A sentence is -provable if it is provable in P(eano) A(rithmetic) by one application of the -rule; equivalently, if its negation is -inconsistent in PA. Let -Bew(x) be the natural formalization of the notion of -provability. For any modal sentence A and function mapping sentence (...) letters to sentences of PA, inductively define A by: p = (p) (p a sentence letter); = ; (AB)su}= (A B); and (qA)= -Bew(A )(S) is the numeral for the Gödel number of the sentence S). Then, applying techniques of Solovay (Israel Journal of Mathematics 25, pp. 287–304), we prove that for every modal sentence A, G A iff for all , PA A ; and for every modal sentence A, G* A iff for all , A is true. (shrink)

Depicts the history of the Omega Workshops, British decorative art studios, and examines the murals, furniture, pottery, textiles, and clothing produced by their members.