We show that the set of ultimately true sentences in Hartry Field's Revenge-immune solution model to the semantic paradoxes is recursively isomorphic to the set of stably true sentences obtained in Hans Herzberger's revision sequence starting from the null hypothesis. We further remark that this shows that a substantial subsystem of second-order number theory is needed to establish the semantic values of sentences in Field's relative consistency proof of his theory over the ground model of the standard natural numbers: -CA0 (...) (second-order number theory with a -comprehension axiom scheme) is insufficient. We briefly consider his claim to have produced a solution to the semantic paradoxes by introducing this conditional. We remark that the notion of a operator can be introduced in other settings. (shrink)
We show how in the hierarchies${F_\alpha }$of Fieldian truth sets, and Herzberger’s${H_\alpha }$revision sequence starting from any hypothesis for${F_0}$ that essentially each${H_\alpha }$ carries within it a history of the whole prior revision process.As applications we provide a precise representation for, and a calculation of the length of, possiblepath independent determinateness hierarchiesof Field’s construction with a binary conditional operator. We demonstrate the existence of generalized liar sentences, that can be considered as diagonalizing past the determinateness hierarchies definable in Field’s recent (...) models. The ‘defectiveness’ of such diagonal sentences necessarily cannot be classified by any of the determinateness predicates of the model. They are ‘ineffable liars’. We may consider them a response to the claim of Field that ‘the conditional can be used to show that the theory is not subject to “revenge problems”.’. (shrink)
We represent truth sets for a variety of the well known semantic theories of truth as those sets consisting of all sentences for which a player has a winning strategy in an infinite two person game. The classifications of the games considered here are simple, those over the natural model of arithmetic being all within the arithmetical class of $\Sum_{3}^{0}$.
Global Reflection Principles.P. D. Welch - 2017 - In I. Niiniluoto, H. Leitgeb, P. Seppälä & E. Sober (eds.), Logic, Methodology and Philosophy of Science - Proceedings of the 15th International Congress, 2015. College Publications.details
Reflection Principles are commonly thought to produce only strong axioms of infinity consistent with V = L. It would be desirable to have some notion of strong reflection to remedy this, and we have proposed Global Reflection Principles based on a somewhat Cantorian view of the universe. Such principles justify the kind of cardinals needed for, inter alia , Woodin’s Ω-Logic.
• We define a notion of order of indiscernibility type of a structure by analogy with Mitchell order on measures; we use this to define a hierarchy of strong axioms of infinity defined through normal filters, the α-weakly Erdős hierarchy. The filters in this hierarchy can be seen to be generated by sets of ordinals where these indiscernibility orders on structures dominate the canonical functions.• The limit axiom of this is that of greatly Erdős and we use it to calibrate (...) some strengthenings of the Chang property, one of which, CC+, is equiconsistent with a Ramsey cardinal, and implies that where K is the core model built with non-overlapping extenders — if it is rigid, and others which are a little weaker. As one corollary we have:TheoremIf then there is an inner model with a strong cardinal. • We define an α-Jónsson hierarchy to parallel the α-Ramsey hierarchy, and show that κ being α-Jónsson implies that it is α-Ramsey in the core model. (shrink)
We consider various concepts associated with the revision theory of truth of Gupta and Belnap. We categorize the notions definable using their theory of circular definitions as those notions universally definable over the next stable set. We give a simplified account of varied revision sequences-as a generalised algorithmic theory of truth. This enables something of a unification with the Kripkean theory of truth using supervaluation schemes.
We analyse the extent of possible computations following Hogarth ([2004]) conducted in Malament–Hogarth (MH) spacetimes, and Etesi and Németi ([2002]) in the special subclass containing rotating Kerr black holes. Hogarth ([1994]) had shown that any arithmetic statement could be resolved in a suitable MH spacetime. Etesi and Németi ([2002]) had shown that some relations on natural numbers that are neither universal nor co-universal, can be decided in Kerr spacetimes, and had asked specifically as to the extent of computational limits there. (...) The purpose of this note is to address this question, and further show that MH spacetimes can compute far beyond the arithmetic: effectively Borel statements (so hyperarithmetic in second-order number theory, or the structure of analysis) can likewise be resolved: Theorem A. If H is any hyperarithmetic predicate on integers, then there is an MH spacetime in which any query ? n H ? can be computed. In one sense this is best possible, as there is an upper bound to computational ability in any spacetime, which is thus a universal constant of that spacetime. Theorem C. Assuming the (modest and standard) requirement that spacetime manifolds be paracompact and Hausdorff, for any spacetime there will be a countable ordinal upper bound, , on the complexity of questions in the Borel hierarchy computable in it. Introduction 1.1 History and preliminaries Hyperarithmetic Computations in MH Spacetimes 2.1 Generalising SADn regions 2.2 The complexity of questions decidable in Kerr spacetimes An Upper Bound on Computational Complexity for Each Spacetime CiteULike Connotea Del.icio.us What's this? (shrink)
We locate winning strategies for various ${\mathrm{\Sigma }}_{3}^{0}$ -games in the L-hierarchy in order to prove the following: Theorem 1. KP+Σ₂-Comprehension $\vdash \exists \alpha L_{\alpha}\ models"\Sigma _{2}-{\bf KP}+\Sigma _{3}^{0}-\text{Determinacy}."$ Alternatively: ${\mathrm{\Pi }}_{3}^{1}\text{\hspace{0.17em}}-{\mathrm{C}\mathrm{A}}_{0}\phantom{\rule{0ex}{0ex}}$ "there is a β-model of ${\mathrm{\Delta }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0}\text{\hspace{0.17em}}\text{\hspace{0.17em}}+\text{\hspace{0.17 em}}{\mathrm{\Sigma }}_{3}^{0}$ -Determinacy." The implication is not reversible. (The antecedent here may be replaced with ${\mathrm{\Pi }}_{3}^{1}\text{\hspace{0.17em}}\text{\hspace{0.17em}}\left({\mathrm{\Pi }}_{3}^{1}\right)-{\mathrm{C}\mathrm{A}}_{0}:\text{\hspace{0.17em}}{\mathrm{\Pi }}_{3}^{1}$ instances of Comprehension with only ${\mathrm{\Pi }}_{3}^{1}$ -lightface definable parameters—or even weaker theories.) Theorem 2. KP +Δ₂-Comprehension +Σ₂-Replacement + ${\mathrm{\Sigma }}_{3}^{0}\phantom{\rule{0ex}{0ex}}$ -Determinacy. (Here AQI (...) is the assertion that every arithmetical quasi-inductive definition converges.) Alternatively: $\Delta _{3}^{1}{\rm CA}_{0}+{\rm AQI}\nvdash \Sigma _{3}^{0}$ -Determinacy. Hence the theories: ${\mathrm{\Pi }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0},\text{\hspace{0.17em}}{\mathrm{\Delta }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0}+\text{\hspace{0.17em}}{\mathrm{\Sigma }}_{3}^{0}-\mathrm{D}\mathrm{e}\mathrm{t}\phantom{\rule{0ex}{0ex}}$ -Det, ${\mathrm{\Delta }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0}+\mathrm{A}\mathrm{Q}\mathrm{I}$ , and ${\mathrm{\Delta }}_{3}^{1}-{\mathrm{C}\mathrm{A}}_{0}\phantom{\rule{0ex}{0ex}}$ are in strictly descending order of strength. (shrink)
We look at various notions of a class of definability operations that generalise inductive operations, and are characterised as “revision operations”. More particularly we: (i) characterise the revision theoretically definable subsets of a countable acceptable structure; (ii) show that the categorical truth set of Belnap and Gupta’s theory of truth over arithmetic using \emph{fully varied revision} sequences yields a complete \Pi13 set of integers; (iii) the set of \emph{stably categorical} sentences using their revision operator ψ is similarly \Pi13 and which (...) is complete in Gödel’s universe of constructible sets L; (iv) give an alternative account of a theory of truth—realistic variance that simplifies full variance, whilst at the same time arriving at Kripkean fixed points. (shrink)
We consider notions of truth and logical validity defined in various recent constructions of Hartry Field. We try to explicate his notion of determinate truth by clarifying the path-dependent hierarchies of his determinateness operator.
We characterise explicitly the decidable predicates on integers of Infinite Time Turing machines, in terms of admissibility theory and the constructible hierarchy. We do this by pinning down ζ, the least ordinal not the length of any eventual output of an Infinite Time Turing machine (halting or otherwise); using this the Infinite Time Turing Degrees are considered, and it is shown how the jump operator coincides with the production of mastercodes for the constructible hierarchy; further that the natural ordinals associated (...) with the jump operator satisfy a Spector criterion, and correspond to the L ζ -stables. It also implies that the machines devised are "Σ 2 Complete" amongst all such other possible machines. It is shown that least upper bounds of an "eventual jump" hierarchy exist on an initial segment. (shrink)
We consider the following question of Kunen: Does Con(ZFC + ∃M a transitive inner model and a non-trivial elementary embedding j: M $\longrightarrow$ V) imply Con (ZFC + ∃ a measurable cardinal)? We use core model theory to investigate consequences of the existence of such a j: M → V. We prove, amongst other things, the existence of such an embedding implies that the core model K is a model of "there exists a proper class of almost Ramsey cardinals". Conversely, (...) if On is Ramsey, then such a j, M are definable. We construe this as a negative answer to the question above. We consider further the consequences of strengthening the closure assumption on j to having various classes of fixed points. (shrink)
The Infinite Time Turing Machine model [8] of Hamkins and Kidder is, in an essential sense, a "Σ₂-machine" in that it uses a Σ₂ Liminf Rule to determine cell values at limit stages of time. We give a generalisation of these machines with an appropriate Σ n rule. Such machines either halt or enter an infinite loop by stage ζ(n) = df μζ(n)[∃Σ(n) > ζ(n) L ζ(n) ≺ Σn L Σ(n) ], again generalising precisely the ITTM case. The collection of (...) such machines taken together computes precisely those reals of the least model of analysis. (shrink)
Let κ be a cardinal, and let H κ be the class of sets of hereditary cardinality less than κ ; let τ (κ) > κ be the height of the smallest transitive admissible set containing every element of {κ}∪H κ . We show that a ZFC-definable notion of long unfoldability, a generalisation of weak compactness, implies in the core model K, that the mouse order restricted to H κ is as long as τ. (It is known that some weak (...) large cardinal property is necessary for the latter to hold.) In other terms we delimit its strength as follows: Theorem Con(ZFC+ω2-Π 1 1-Determinacy) ⇒ ⇒Con(ZFC+V=K+∃ a long unfoldable cardinal ⇒ ⇒Con(ZFC+∀X(X # exists) + ‘‘ $\forall D \subseteq \omega_1 D$ is universally Baire ⇔ ∃r∈R(D∈L(r)))’’, and this is set-generically absolute). We isolate a notion of ω-closed cardinal which is weaker than an ω1-Erd\ os cardinal, and show that this bounds the first long unfoldable: Theorem Let κ be ω -closed. Then there is a long unfoldable ł<κ. (shrink)
A small large cardinal upper bound in V for proving when certain subsets of ω 1 (including the universally Baire subsets) are precisely those constructible from a real is given. In the core model we find an exact equivalence in terms of the length of the mouse order; we show that $\forall B \subseteq \omega_1 \lbrack B$ is universally Baire $\Leftrightarrow B \in L\lbrack r \rbrack$ for some real r] is preserved under set-sized forcing extensions if and only if there (...) are arbitrarily large "admissibly measurable" cardinals. (shrink)
The interaction between large cardinals, determinacy of two-person perfect information games, and inner model theory has been a singularly powerful driving force in modern set theory during the last three decades. For the outsider the intellectual excitement is often tempered by the somewhat daunting technicalities, and the seeming length of study needed to understand the flow of ideas. The purpose of this article is to try and give a short, albeit rather rough, guide to the broad lines of development.
We follow [8] in asking when a set of ordinals $X \subseteq \alpha$ is a countable union of sets in K, the core model. We show that, analogously to L, and X closed under the canonical Σ 1 Skolem function for K α can be so decomposed provided K is such that no ω-closed filters are put on its measure sequence, but not otherwise. This proviso holds if there is no inner model of a weak Erdős-type property.
We consider the following question of Kunen: Does Con imply Con? We use core model theory to investigate consequences of the existence of such a j : M $\rightarrow$ V. We prove, amongst other things, the existence of such an embedding implies that the core model K is a model of "there exists a proper class of almost Ramsey cardinals". Conversely, if On is Ramsey, then such a j, M are definable. We construe this as a negative answer to the (...) question above. We consider further the consequences of strengthening the closure assumption on j to having various classes of fixed points. (shrink)
We show that, like singular cardinals, and weakly compact cardinals, Jensen's core model K for measures of order zero [4] calculates correctly the successors of Jónsson cardinals, assuming $O^{Sword}$ does not exist. Namely, if $\kappa$ is a Jónsson cardinal then $\kappa^+ = \kappa^{+K}$ , provided that there is no non-trivial elementary embedding $j:K \longrightarrow K$ . There are a number of related results in ZFC concerning $\cal{P}(\kappa)$ in V and inner models, for $\kappa$ a Jónsson or singular cardinal.
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.
A small large cardinal upper bound in $V$ for proving when certain subsets of $\omega_1$ are precisely those constructible from a real is given. In the core model we find an exact equivalence in terms of the length of the mouse order; we show that $\forall B \subseteq \omega_1 \lbrack B$ is universally Baire $\Leftrightarrow B \in L\lbrack r \rbrack$ for some real $r\rbrack$ is preserved under set-sized forcing extensions if and only if there are arbitrarily large "admissibly measurable" cardinals.
We characterise explicitly the decidable predicates on integers of Infinite Time Turing machines, in terms of admissibility theory and the constructible hierarchy. We do this by pinning down $\zeta$, the least ordinal not the length of any eventual output of an Infinite Time Turing machine ; using this the Infinite Time Turing Degrees are considered, and it is shown how the jump operator coincides with the production of mastercodes for the constructible hierarchy; further that the natural ordinals associated with the (...) jump operator satisfy a Spector criterion, and correspond to the L$_\zeta$-stables. It also implies that the machines devised are "$\Sigma_2$ Complete" amongst all such other possible machines. It is shown that least upper bounds of an "eventual jump" hierarchy exist on an initial segment. (shrink)
We give limits defined in terms of abstract pointclasses of the amount of determinacy available in certain canonical inner models involving strong cardinals. We show for example: Theorem A. $\mathrm{D}\mathrm{e}\mathrm{t}\text{\hspace{0.17em}}({\mathrm{\Pi }}_{1}^{1}-\mathrm{I}\mathrm{N}\mathrm{D})$ ⇒ there exists an inner model with a strong cardinal. Theorem B. Det(AQI) ⇒ there exist type-1 mice and hence inner models with proper classes of strong cardinals. where ${\mathrm{\Pi }}_{1}^{1}-\mathrm{I}\mathrm{N}\mathrm{D}\phantom{\rule{0ex}{0ex}}$ (AQI) is the pointclass of boldface ${\mathrm{\Pi }}_{1}^{1}$ -inductive (respectively arithmetically quasi-inductive) sets of reals.
We discuss some of the relationships between the notion of "mutual stationarity" of Foreman and Magidor and measurability in inner models. The general thrust of these is that very general mutual stationarity properties on small cardinals, such as the ℵns, is a large cardinal property. A number of open problems, theorems, and conjectures are stated.