25 found
Sort by:
Disambiguations:
Philip Welch [18]Philip D. Welch [7]
  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. 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  
  3. Philip D. Welch (forthcoming). Bounded Martin's Maximum, Weak Erdos Cardinals, and AC. Journal of Symbolic Logic.
     
    My bibliography  
     
    Export citation  
  4. 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  
  5. 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  
  6. 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  
  7. 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  
  8. 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  
  9. 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  
  10. 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  
  11. 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  
  12. 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  
  13. 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  
  14. 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  
  15. 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  
  16. 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  
  17. 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  
  18. 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  
  19. 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  
  20. 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  
  21. Philip Welch (1987). Minimality in the ▵13-Degrees. Journal of Symbolic Logic 52 (4):908 - 915.
    We show in ZFC, assuming all reals have sharps, that a countable collection of ▵ 1 3 -degrees without a minimal upper bound implies the existence of inner models with measurable cardinals.
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  22. Philip Welch (1987). Minimality in the $Triangle^1_3$-Degrees. Journal of Symbolic Logic 52 (4):908-915.
    We show in ZFC, assuming all reals have sharps, that a countable collection of $\triangle^1_3$-degrees without a minimal upper bound implies the existence of inner models with measurable cardinals.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  23. Philip Welch (1987). The Reals in Core Models. Journal of Symbolic Logic 52 (1):64-67.
    We set $\mathscr{D} = \langle\mathscr{D}, \leq_L, \tt\#\rangle$ , where D is the set of degrees of nonconstructibility for countable sets of countable ordinals. We show how to define inductively over this structure the degrees of such sets of ordinals in K, the core model, and the next few core models thereafter, i.e. without reference to mice, premice or measurable cardinals.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  24. Philip Welch (1986). The Natural Hierarchy and Quasi-Hierarchy of Constructibility Degrees. Journal of Symbolic Logic 51 (1):130-134.
    We investigate the set S 2 of "quickly sharped" reals: \begin{align*}S_2 &= \{x \mid x \in M, M \text{the} <^\ast-\text{least mouse} \not\in L\lbrack x\rbrack\} \\ &= \{x \mid L\lbrack x\rbrack \models "V = K"\},\\ \end{align*} in the manner of [K] defining a natural hierarchy and quasi-hierarchy of constructibility degrees and identifying their termination points.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  25. Philip Welch (1985). Comparing Incomparable Kleene Degrees. Journal of Symbolic Logic 50 (1):55-58.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation