56 found
Sort by:
  1. Volker Halbach & Philip Welch, Necessities and Necessary Truths: A Prolegomenon to the Metaphysics of Modality.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  2. P. D. Welch, Global Reflection Principles.
    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.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  3. Sy-David Friedman, Philip Welch & W. Hugh Woodin (forthcoming). On the Consistency Strength of the Inner Model Hypothesis. Journal of Symbolic Logic.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  4. P. D. Welch (forthcoming). Some Observations on Truth Hierarchies. Review of Symbolic Logic:1-30.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  5. Philip D. Welch (forthcoming). Bounded Martin's Maximum, Weak Erdos Cardinals, and AC. Journal of Symbolic Logic.
     
    My bibliography  
     
    Export citation  
  6. Leon Horsten, Graham E. Leigh, Hannes Leitgeb & Philip Welch (2012). Revision Revisited. Review of Symbolic Logic 5 (4):642-664.
    This article explores ways in which the Revision Theory of Truth can be expressed in the object language. In particular, we investigate the extent to which semantic deficiency, stable truth, and nearly stable truth can be so expressed, and we study different axiomatic systems for the Revision Theory of Truth.
    No categories
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  7. Sy-David Friedman & P. D. Welch (2011). Hypermachines. Journal of Symbolic Logic 76 (2):620 - 636.
    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 (...)
    Translate to English
    | Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  8. Peter Koepke & Philip D. Welch (2011). Global Square and Mutual Stationarity at the ℵn. Annals of Pure and Applied Logic 162 (10):787-806.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  9. I. Sharpe & P. D. Welch (2011). Greatly Erdős Cardinals with Some Generalizations to the Chang and Ramsey Properties. Annals of Pure and Applied Logic 162 (11):863-902.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  10. P. D. Welch (2011). Determinacy in Strong Cardinal Models. Journal of Symbolic Logic 76 (2):719 - 728.
    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.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  11. P. D. Welch (2011). Truth, Logical Validity and Determinateness: A Commentary on Field's Saving Truth From Paradox. Review of Symbolic Logic 4 (3):348-359.
    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.
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  12. P. D. Welch (2011). Weak Systems of Determinacy and Arithmetical Quasi-Inductive Definitions. Journal of Symbolic Logic 76 (2):418 - 436.
    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 (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  13. Patrick Welch (2011). Ethics: Universal, but Neither Empirical Nora Priori: A Response to Lapsley and Narvaez. Journal of Moral Education 40 (4):533-533.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  14. Patrick Welch (2011). Moral Psychology and the Problem of Moral Criteria. Journal of Moral Education 40 (4):513-526.
    This article is intended as an initial investigation into the foundations of moral psychology. I primarily examine a recent work in moral education, Daniel Lapsley?s and Darcia Narvaez?s ?Character education?, whose authors seem to assume at points that criteria for discerning moral actions and moral traits can be derived apart from ethics or moral philosophy. This assumption, which appears to stem from misconceptions about both the virtues traditionally understood and the non-empirical nature of moral-philosophical theorising, is problematic: (1) it courts (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  15. Philip D. Welch (2011). Discrete Transfinite Computation Models. In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific. 375--414.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  16. V. Halbach & P. Welch (2009). Necessities and Necessary Truths: A Prolegomenon to the Use of Modal Logic in the Analysis of Intensional Notions. Mind 118 (469):71-100.
    In philosophical logic necessity is usually conceived as a sentential operator rather than as a predicate. An intensional sentential operator does not allow one to express quantified statements such as 'There are necessary a posteriori propositions' or 'All laws of physics are necessary' in first-order logic in a straightforward way, while they are readily formalized if necessity is formalized by a predicate. Replacing the operator conception of necessity by the predicate conception, however, causes various problems and forces one to reject (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  17. Leon Horsten & Philip Welch (2009). Erratum: The Undecidability of Propositional Adaptive Logic. Synthese 169 (1):217 - 218.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  18. P. D. Welch (2009). Games for Truth. Bulletin of Symbolic Logic 15 (4):410-427.
    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}$.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  19. Patrick J. Welch & Stuart D. Yoak (2009). 68 Solidarity. In Jan Peil & Irene van Staveren (eds.), Handbook of Economics and Ethics. Edward Elgar.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  20. Sy-David Friedman, Philip Welch & W. Hugh Woodin (2008). On the Consistency Strength of the Inner Model Hypothesis. Journal of Symbolic Logic 73 (2):391 - 400.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  21. P. D. Welch (2008). The Extent of Computation in Malament–Hogarth Spacetimes. British Journal for the Philosophy of Science 59 (4):659-674.
    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. (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  22. P. D. Welch (2008). Ultimate Truth Vis- à- Vis Stable Truth. Review of Symbolic Logic 1 (1):126-142.
    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 (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  23. P. D. Welch (2008). Ultimate Truth Vis-a-Vis Stable Truth. Review of Symbolic Logic 1 (1):126-142.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  24. Leon Horsten & Philip Welch (2007). The Undecidability of Propositional Adaptive Logic. Synthese 158 (1):41 - 60.
    We investigate and classify the notion of final derivability of two basic inconsistency-adaptive logics. Specifically, the maximal complexity of the set of final consequences of decidable sets of premises formulated in the language of propositional logic is described. Our results show that taking the consequences of a decidable propositional theory is a complicated operation. The set of final consequences according to either the Reliability Calculus or the Minimal Abnormality Calculus of a decidable propositional premise set is in general undecidable, and (...)
    No categories
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  25. Agustín Rayo & P. D. Welch (2007). Field on Revenge. In J. C. Beall (ed.), Revenge of the Liar: New Essays on the Paradox. Oxford University Press.
     
    My bibliography  
     
    Export citation  
  26. Kai-Uwe Küdhnberger, Benedikt Löwe, Michael Möllerfeld & Philip Welch (2005). Comparing Inductive and Circular Definitions: Parameters, Complexity and Games. Studia Logica 81 (1):79 - 98.
    Gupta-Belnap-style circular definitions use all real numbers as possible starting points of revision sequences. In that sense they are boldface definitions. We discuss lightface versions of circular definitions and boldface versions of inductive definitions.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  27. P. D. Welch (2005). Some Open Problems in Mutual Stationarity Involving Inner Model Theory: A Commentary. Notre Dame Journal of Formal Logic 46 (3):375-379.
    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.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  28. Philip Welch (2005). Kai–Uwe Kühnberger Benedikt Löwe Michael Möllerfeld. Studia Logica 81:79-98.
    No categories
    Translate to English
    | Direct download  
     
    My bibliography  
     
    Export citation  
  29. P. D. Welch (2004). On Unfoldable Cardinals, Ω-Closed Cardinals, and the Beginning of the Inner Model Hierarchy. Archive for Mathematical Logic 43 (4):443-458.
    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 (...)
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  30. Philip D. Welch (2004). On the Possibility, or Otherwise, of Hypercomputation. British Journal for the Philosophy of Science 55 (4):739-746.
    We claim that a recent article of P. Cotogno ([2003]) in this journal is based on an incorrect argument concerning the non-computability of diagonal functions. The point is that whilst diagonal functions are not computable by any function of the class over which they diagonalise, there is no ?logical incomputability? in their being computed over a wider class. Hence this ?logical incomputability? regrettably cannot be used in his argument that no hypercomputation can compute the Halting problem. This seems to lead (...)
    Direct download (10 more)  
     
    My bibliography  
     
    Export citation  
  31. Volker Halbach, Hannes Leitgeb & Philip Welch (2003). Possible-Worlds Semantics for Modal Notions Conceived as Predicates. Journal of Philosophical Logic 32 (2):179-223.
    If □ is conceived as an operator, i.e., an expression that gives applied to a formula another formula, the expressive power of the language is severely restricted when compared to a language where □ is conceived as a predicate, i.e., an expression that yields a formula if it is applied to a term. This consideration favours the predicate approach. The predicate view, however, is threatened mainly by two problems: Some obvious predicate systems are inconsistent, and possible-worlds semantics for predicates of (...)
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  32. J. D. Hamkins & P. D. Welch (2003). Pf= NPf Almost Everywhere. Mathematical Logic Quarterly 49 (5):536-540.
    No categories
     
    My bibliography  
     
    Export citation  
  33. Luc Lismont, Philippe Mongin, Strong Completeness, Volker Halbach, Hannes Leitgeb, Philip Welch, Francis Jeffry Pelletier, Alasdair Urquhart & Synonymous Logics (2003). Philip G. Calabrese/Operating on Functions with Variable Domains 1–18 Stewart Shapiro/Mechanism, Truth, and Penrose's New Argu-Ment 19–42 Steven E. Boër/Thought-Contents and the Formal Ontology Of. [REVIEW] Journal of Philosophical Logic 32:667-668.
    No categories
    Direct download  
     
    My bibliography  
     
    Export citation  
  34. B. Lowe, P. Welch & Volker Halbach (2003). REVIEWS-Two Papers of B. Lowe and P. Welch. Bulletin of Symbolic Logic 9 (2):235-236.
    No categories
     
    My bibliography  
     
    Export citation  
  35. P. D. Welch (2003). On Revision Operators. Journal of Symbolic Logic 68 (2):689-711.
    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 (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  36. Philip D. Welch & Joel David Hamkins (2003). Pf ≠ NPf for Almost All F. Mathematical Logic Quarterly 49 (5):536.
    No categories
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  37. David Asperó & Philip D. Welch (2002). Bounded Martin's Maximum, Weak [Image] Cardinals, and [Image]. Journal of Symbolic Logic 67 (3):1141 - 1152.
    We prove that a form of the $Erd\H{o}s$ property (consistent with $V = L\lbrack H_{\omega_2}\rbrack$ and strictly weaker than the Weak Chang's Conjecture at ω1), together with Bounded Martin's Maximum implies that Woodin's principle $\psi_{AC}$ holds, and therefore 2ℵ0 = ℵ2. We also prove that $\psi_{AC}$ implies that every function $f: \omega_1 \rightarrow \omega_1$ is bounded by some canonical function on a club and use this to produce a model of the Bounded Semiproper Forcing Axiom in which Bounded Martin's Maximum (...)
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  38. Benedikt Löwe & Philip D. Welch (2001). Set-Theoretic Absoluteness and the Revision Theory of Truth. Studia Logica 68 (1):21-41.
    We describe the solution of the Limit Rule Problem of Revision Theory and discuss the philosophical consequences of the fact that the truth set of Revision Theory is a complete 1/2 set.
    Direct download (9 more)  
     
    My bibliography  
     
    Export citation  
  39. J. Vickers & P. D. Welch (2001). On Elementary Embeddings From an Inner Model to the Universe. Journal of Symbolic Logic 66 (3):1090-1116.
    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, (...)
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  40. P. D. Welch (2001). On Gupta-Belnap Revision Theories of Truth, Kripkean Fixed Points, and the Next Stable Set. Bulletin of Symbolic Logic 7 (3):345-360.
    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 (in terms of definitional complexity) 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.
    Direct download (7 more)  
     
    My bibliography  
     
    Export citation  
  41. J. Vickers & P. D. Welch (2000). On Successors of Jónsson Cardinals. Archive for Mathematical Logic 39 (6):465-473.
    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.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  42. P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
    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 (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  43. P. D. Welch (1997). Review: William J. Mitchell, John R. Steel, Fine Structure and Iteration Trees. [REVIEW] Journal of Symbolic Logic 62 (4):1491-1493.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  44. P. D. Welch (1996). Countable Unions of Simple Sets in the Core Model. Journal of Symbolic Logic 61 (1):293-312.
    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.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  45. P. D. Welch (1996). Determinacy in the Difference Hierarchy of Co-Analytic Sets. Annals of Pure and Applied Logic 80 (1):69-108.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  46. Patrick J. Welch (1995). Getting and Spending: A Primer in Economic Morality. By Peter L. Danner. The Modern Schoolman 72 (4):349-352.
    No categories
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  47. Philip Welch (1995). Review: Menachem Magidor, Representing Sets of Ordinals as Countable Unions of Sets in the Core Model. [REVIEW] Journal of Symbolic Logic 60 (2):701-704.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  48. P. D. Welch (1994). Characterising Subsets of Ω1 Constructible From a Real. Journal of Symbolic Logic 59 (4):1420 - 1432.
    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 (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  49. Philip Welch (1990). Friedman Sy D.. Strong Coding. Annals of Pure and Applied Logic, Vol. 35 (1987), Pp. 1–98. Friedman Sy D.. A Guide to “Strong Coding.” Annals of Pure and Applied Logic, Vol. 35 (1987), Pp. 99–122. [REVIEW] Journal of Symbolic Logic 55 (3):1311-1313.
    Direct download  
     
    My bibliography  
     
    Export citation  
  50. Philip Welch (1990). Review: Sy D. Friedman, Strong Coding; Sy D. Friedman, A Guide to "Strong Coding.". [REVIEW] Journal of Symbolic Logic 55 (3):1311-1313.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
1 — 50 / 56