Search

One of the most important principles of J.-Y. Girard's $\Pi^1_2$-logic is induction on dilators. In particular, Girard used this principle to construct his famous functor $\Lambda$. He claimed that the totality of $\Lambda$ is equivalent to the set existence axiom of $\Pi^1_1$-comprehension from reverse mathematics. While Girard provided a plausible description of a proof around 1980, it seems that the very technical details have not been worked out to this day. A few years ago, a loosely related approach led to an equivalence between $\Pi^1_1$-comprehension and a certain Bachmann-Howard principle. The present paper closes the circle. We relate the Bachmann-Howard principle to induction on dilators. This allows us to show that $\Pi^1_1$-comprehension is equivalent to the totality of a functor $\mathbb J$ due to P. P\"appinghaus, which can be seen as a streamlined version of $\Lambda$.

In this paper, we give characterizations of the set of $\Pi^1_{e}$-consequences, $\Sigma^1_{e}$-consequences and $\mathsf{B}(\Pi^1_{e})$-consequences of the axiomatic system of the strong dependent choice for $\Sigma^1_i$ formulas $\Sigma^1_i$-$\mathsf{SDC}_0$ for $i > 0$ and $e < i+2$. Here, $\mathsf{B}(\Gamma)$ denotes the set generated by $\land,\lor,\lnot$ starting from $\Gamma$.

We introduce exacting cardinals and a strengthening of these, ultraexacting cardinals. These are natural large cardinals defined equivalently as weak forms of rank-Berkeley cardinals, strong forms of J\'onsson cardinals, or in terms of principles of structural reflection. However, they challenge commonly held intuition on strong axioms of infinity. We prove that ultraexacting cardinals are consistent with Zermelo-Fraenkel Set Theory with the Axiom of Choice (ZFC) relative to the existence of an I0 embedding. However, the existence of an ultraexacting cardinal below a measurable cardinal implies the consistency of ZFC with a proper class of I0 embeddings, thus challenging the linear-incremental picture of the large cardinal hierarchy. We show that the existence of an exacting cardinal implies that V is not equal to HOD (G\"odel's universe of Hereditarily Ordinal Definable sets), showing that these cardinals surpass the current hierarchy of large cardinals consistent with ZFC. We prove that the consistency of ZFC with an exacting cardinal above an extendible cardinal refutes Woodin's HOD Conjecture and Ultimate-L Conjecture. Finally, we establish the consistency of ZFC with the existence of an exacting cardinal above an extendible cardinal from the consistency of ZF with certain large cardinals beyond choice., Comment: 39 pages

We prove level-by-level upper and lower bounds on the strength of determinacy for finite differences of sets in the hyperarithmetical hierarchy in terms of subsystems of finite-and transfinite-order arithmetic, extending the Montalb\'an-Shore theorem to each of the levels of the Borel hierarchy beyond the one they treated. We also prove equivalences between reflection principles for higher-order arithmetic and quantified determinacy axioms, answering two questions of Pacheco and Yokoyama.

Next-generation accelerator concepts which hinge on the precise shaping of beam distributions, demand equally precise diagnostic methods capable of reconstructing beam distributions within 6-dimensional position-momentum spaces. However, the characterization of intricate features within 6-dimensional beam distributions using conventional diagnostic techniques necessitates hundreds of measurements, using many hours of valuable beam time. Novel phase space reconstruction techniques are needed to substantially reduce the number of measurements required to reconstruct detailed, high-dimensional beam features in order to resolve complex beam phenomena, and as feedback in precision beam shaping applications. In this study, we present a novel approach to reconstructing detailed 6-dimensional phase space distributions from experimental measurements using generative machine learning and differentiable beam dynamics simulations. We demonstrate that for a collection of synthetic beam distribution test cases that this approach can be used to resolve 6-dimensional phase space distributions using basic beam manipulations and as few as 20 2-dimensional measurements of the beam profile, without the need for prior data collection or model training. We also demonstrate an application of the reconstruction method in an experimental setting at the Argonne Wakefield Accelerator, where it is able to reconstruct the beam distribution and accurately predict previously unseen measurements 75x faster than previous methods.

Beams with cross-plane coupling or extreme asymmetries between the two transverse phase spaces are often encountered in particle accelerators. Flat beams with large transverse-emittance ratios are critical for future linear colliders. Similarly, magnetized beams with significant cross-plane coupling are expected to enhance the performance of electron cooling in hadron beams. Preparing these beams requires precise control and characterization of the four-dimensional transverse phase space. In this study, we employ generative phase space reconstruction (GPSR) techniques to rapidly characterize magnetized and flat-beam phase-space distributions using a conventional quadrupole-scan method. The reconstruction technique is experimentally demonstrated on an electron beam produced at the Argonne Wakefield Accelerator and successfully benchmarked against conventional diagnostics techniques. Specifically, we show that predicted beam parameters from the reconstructed phase-space distributions (e.g. as magnetization and flat beam emittances) are in excellent agreement with those measured from the conventional diagnostic methods.

For each $n\in\mathbb{N}$, let $[n]\phi$ mean "the sentence $\phi$ is true in all $\Sigma_{n+1}$-correct transitive sets." Assuming G\"odel's axiom $V = L$, we prove the following graded variant of Solovay's completeness theorem: the set of formulas valid under this interpretation is precisely the set of theorems of the linear provability logic GLP.3. We also show that this result is not provable in ZFC, so the hypothesis V = L cannot be removed. As part of the proof, we derive (in ZFC) the following purely modal-logical results which are of independent interest: the logic GLP.3 coincides with the logic of closed substitutions of GLP, and is the maximal non-degenerate, normal extension of GLP., Comment: 20 pages, 4 figures

We study the question of when a given countable ordinal $\alpha$ is $\Sigma^1_n$- or $\Pi^1_n$-reflecting in models which are neither $\mathsf{PD}$ models nor the constructible universe, focusing on generic extensions of $L$. We prove, amongst other things, that adding any number of Cohen or random reals, or forcing with Sacks forcing or any lightface Borel weakly homogeneous ccc forcing notion cannot change such reflection properties. Moreover we show that collapse forcing increases the value of the least reflecting ordinals but, curiously, to ordinals which are still smaller than the $\omega_1$ of $L$., Comment: 23 pages, submitted

We investigate a version of linear temporal logic whose propositional fragment is G\"odel-Dummett logic (which is well known both as a superintuitionistic logic and a t-norm fuzzy logic). We define the logic using two natural semantics: first a real-valued semantics, where statements have a degree of truth in the real unit interval and second a `bi-relational' semantics. We then show that these two semantics indeed define one and the same logic: the statements that are valid for the real-valued semantics are the same as those that are valid for the bi-relational semantics. This G\"odel temporal logic does not have any form of the finite model property for these two semantics: there are non-valid statements that can only be falsified on an infinite model. However, by using the technical notion of a quasimodel, we show that every falsifiable statement is falsifiable on a finite quasimodel, yielding an algorithm for deciding if a statement is valid or not. Later, we strengthen this decidability result by giving an algorithm that uses only a polynomial amount of memory, proving that G\"odel temporal logic is PSPACE-complete. We also provide a deductive calculus for G\"odel temporal logic, and show this calculus to be sound and complete for the above-mentioned semantics, so that all (and only) the valid statements can be proved with this calculus., Comment: arXiv admin note: substantial text overlap with arXiv:2205.00574, arXiv:2205.05182

Characterizing the phase space distribution of particle beams in accelerators is a central part of accelerator understanding and performance optimization. However, conventional reconstruction-based techniques either use simplifying assumptions or require specialized diagnostics to infer high-dimensional ($>$ 2D) beam properties. In this Letter, we introduce a general-purpose algorithm that combines neural networks with differentiable particle tracking to efficiently reconstruct high-dimensional phase space distributions without using specialized beam diagnostics or beam manipulations. We demonstrate that our algorithm accurately reconstructs detailed 4D phase space distributions with corresponding confidence intervals in both simulation and experiment using a single focusing quadrupole and diagnostic screen. This technique allows for the measurement of multiple correlated phase spaces simultaneously, which will enable simplified 6D phase space distribution reconstructions in the future.

We consider G\"odel temporal logic ($\sf GTL$), a variant of linear temporal logic based on G\"odel--Dummett propositional logic. In recent work, we have shown this logic to enjoy natural semantics both as a fuzzy logic and as a superintuitionistic logic. Using semantical methods, the logic was shown to be {\sc pspace}-complete. In this paper we provide a deductive calculus for $\sf GTL$, and show this calculus to be sound and complete for the above-mentioned semantics., Comment: arXiv admin note: text overlap with arXiv:2205.00574

We investigate a non-classical version of linear temporal logic whose propositional fragment is G\"odel--Dummett logic (which is well known both as a superintuitionistic logic and a t-norm fuzzy logic). We define the logic using two natural semantics, a real-valued semantics and a bi-relational semantics, and show that these indeed define one and the same logic. Although this G\"odel temporal logic does not have any form of the finite model property for these two semantics, we show that every falsifiable formula is falsifiable on a finite quasimodel, which yields decidability of the logic. We then strengthen this result by showing that this G\"odel temporal logic is PSPACE-complete.

We develop the abstract framework for a proof-theoretic analysis of theories with scope beyond ordinal numbers, resulting in an analog of Ordinal Analysis aimed at the study of theorems of complexity $\Pi^1_2$. This is done by replacing the use of ordinal numbers by particularly uniform, wellfoundedness preserving functors in the category of linear orders. Generalizing the notion of a proof-theoretic ordinal, we define the functorial $\Pi^1_2$ norm of a theory and prove its existence and uniqueness for $\Pi^1_2$-sound theories. From this, we further abstract a definition of the $\Sigma^1_2$- and $\Pi^1_2$-soundness ordinals of a theory; these quantify, respectively, the maximum strength of true $\Sigma^1_2$ theorems and minimum strength of false $\Pi^1_2$ theorems of a given theory. We study these ordinals, developing a proof-theoretic classification theory for recursively enumerable extensions of $\mathsf{ACA}_0$ Using techniques from infinitary and categorical proof theory, generalized recursion theory, constructibility, and forcing, we prove that an admissible ordinal is the $\Pi^1_2$-soundness ordinal of some recursively enumerable extension of $\mathsf{ACA}_0$ if and only if it is not parameter-free $\Sigma^1_1$-reflecting. We show that the $\Sigma^1_2$-soundness ordinal of $\mathsf{ACA}_0$ is $\omega_1^{ck}$ and characterize the $\Sigma^1_2$-soundness ordinals of recursively enumerable, $\Sigma^1_2$-sound extensions of $\Pi^1_1{-}\mathsf{CA}_0$., Comment: 26 pages, 2 figures

Particle accelerators are invaluable discovery engines in the chemical, biological and physical sciences. Characterization of the accelerated beam response to accelerator input parameters is of-ten the first step when conducting accelerator-based experiments. Currently used techniques for characterization, such as grid-like parameter sampling scans, become impractical when extended to higher dimensional input spaces, when complicated measurement constraints are present, or prior information is known about the beam response is scarce. In this work, we describe an adaptation of the popular Bayesian optimization algorithm, which enables a turn-key exploration algorithm that replaces parameter scans and minimizes prior information needed about the measurements' behavior and associated measurement constraints. We experimentally demonstrate that our algorithm autonomously conducts an adaptive, multi-parameter exploration of input parameter space,while navigating a highly constrained, single-shot beam phase-space measurement. In addition to applications in accelerator-based scientific experiments, this algorithm addresses challenges shared by many scientific disciplines and is thus applicable to autonomously conducting experiments over a broad range of research topics.

We prove a number of results on the determinacy of $\sigma$-projective sets of reals, i.e., those belonging to the smallest pointclass containing the open sets and closed under complements, countable unions, and projections. We first prove the equivalence between $\sigma$-projective determinacy and the determinacy of certain classes of games of variable length ${<}\omega^2$ (Theorem 2.4). We then give an elementary proof of the determinacy of $\sigma$-projective sets from optimal large-cardinal hypotheses (Theorem 4.4). Finally, we show how to generalize the proof to obtain proofs of the determinacy of $\sigma$-projective games of a given countable length and of games with payoff in the smallest $\sigma$-algebra containing the projective sets, from corresponding assumptions (Theorems 5.1 and 5.4).

We present variants of Goodstein's theorem that are equivalent to arithmetical comprehension and to arithmetical transfinite recursion, respectively, over a weak base theory. These variants differ from the usual Goodstein theorem in that they (necessarily) entail the existence of complex infinite objects. As part of our proof, we show that the Veblen hierarchy of normal functions on the ordinals is closely related to an extension of the Ackermann function by direct limits.

Let $M^\sharp_n(\mathbb{R})$ denote the minimal active iterable extender model which has $n$ Woodin cardinals and contains all reals, if it exists, in which case we denote by $M_n(\mathbb{R})$ the class-sized model obtained by iterating the topmost measure of $M_n(\mathbb{R})$ class-many times. We characterize the sets of reals which are $\Sigma_1$-definable from $\mathbb{R}$ over $M_n(\mathbb{R})$, under the assumption that projective games on reals are determined: (1) for even $n$, $\Sigma_1^{M_n(\mathbb{R})} = \Game^\mathbb{R}\Pi^1_{n+1}$; (2) for odd $n$, $\Sigma_1^{M_n(\mathbb{R})} = \Game^\mathbb{R}\Sigma^1_{n+1}$. This generalizes a theorem of Martin and Steel for $L(\mathbb{R})$, i.e., the case $n=0$. As consequences of the proof, we see that determinacy of all projective games with moves in $\mathbb{R}$ is equivalent to the statement that $M^\sharp_n(\mathbb{R})$ exists for all $n\in\mathbb{N}$, and that determinacy of all projective games of length $\omega^2$ with moves in $\mathbb{N}$ is equivalent to the statement that $M^\sharp_n(\mathbb{R})$ exists and satisfies $\mathsf{AD}$ for all $n\in\mathbb{N}$., Comment: 15 pages

It is shown, from hypotheses in the region of $\omega^2$ Woodin cardinals, that there is a transitive model of KP + AD$_\mathbb{R}$ containing all reals., Comment: 15 pages

We determine the consistency strength of determinacy for projective games of length $\omega^2$. Our main theorem is that $\boldsymbol\Pi^1_{n+1}$-determinacy for games of length $\omega^2$ implies the existence of a model of set theory with $\omega + n$ Woodin cardinals. In a first step, we show that this hypothesis implies that there is a countable set of reals $A$ such that $M_n(A)$, the canonical inner model for $n$ Woodin cardinals constructed over $A$, satisfies $A = \mathbb{R}$ and the Axiom of Determinacy. Then we argue how to obtain a model with $\omega + n$ Woodin cardinal from this. We also show how the proof can be adapted to investigate the consistency strength of determinacy for games of length $\omega^2$ with payoff in $\Game^\mathbb{R} \boldsymbol\Pi^1_1$ or with $\sigma$-projective payoff.

We prove a topological completeness theorem for the modal logic GLP containing operators $\langle\lambda\rangle$ for $\lambda \in$ Ord intended to capture progressively stronger notions of consistency in mathematical theories. We show that, given a scattered space $X$ of large-enough rank, any sentence $\phi$ consistent with GLP can be satisfied in a polytopological space based on the finitely many Icard topologies over $X$ that correspond to the finitely many modalities appearing in $\phi$., Comment: 32 pages

We give examples of calculi that extend Gentzen's sequent calculus LK by unsound quantifier inferences in such a way that (i) derivations lead only to true sequents, and (ii) proofs therein are non-elementarily shorter than LK-proofs., Comment: 21 pages. July 2017 preprint