35 found
Order:
Disambiguations
Philip Welch [27]Philip D. Welch [8]
  1. Possible-Worlds Semantics for Modal Notions Conceived as Predicates.Volker Halbach, Hannes Leitgeb & Philip Welch - 2003 - 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 (7 more)  
     
    Export citation  
     
    Bookmark   25 citations  
  2.  84
    Revision Revisited.Leon Horsten, Graham E. Leigh, Hannes Leitgeb & Philip Welch - 2012 - 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.
    Direct download (9 more)  
     
    Export citation  
     
    Bookmark   8 citations  
  3.  93
    Reflecting on Absolute Infinity.Philip Welch & Leon Horsten - 2016 - Journal of Philosophy 113 (2):89-111.
    This article is concerned with reflection principles in the context of Cantor’s conception of the set-theoretic universe. We argue that within such a conception reflection principles can be formulated that confer intrinsic plausibility to strong axioms of infinity.
    Direct download (6 more)  
     
    Export citation  
     
    Bookmark   3 citations  
  4.  83
    The Undecidability of Propositional Adaptive Logic.Leon Horsten & Philip Welch - 2007 - 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 (...)
    Direct download (7 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  5.  12
    Some Observations on Truth Hierarchies: A Correction.Philip D. Welch - forthcoming - Review of Symbolic Logic:1-4.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  6. Godel's Disjunction: The Scope and Limits of Mathematical Knowledge.Leon Horsten & Philip Welch (eds.) - 2016 - Oxford University Press UK.
    To what extent can we hope to find answers to all mathematical questions? A famous theorem from Gödel entails that if our thinking capacities do not go beyond what an electronic computer is capable of, then there are indeed absolutely unsolvable mathematical problems. Thus it is of capital importance to find out whether human mathematicians can outstrip computers. Within this context, the contributions to this book critically examine positions about the scope and limits of human mathematical knowledge.
     
    Export citation  
     
    Bookmark   2 citations  
  7.  61
    On the Consistency Strength of the Inner Model Hypothesis.Sy-David Friedman, Philip Welch & W. Hugh Woodin - 2008 - Journal of Symbolic Logic 73 (2):391 - 400.
  8.  51
    Set-Theoretic Absoluteness and the Revision Theory of Truth.Benedikt Löwe & Philip D. Welch - 2001 - 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 (6 more)  
     
    Export citation  
     
    Bookmark   9 citations  
  9.  15
    Recognizable Sets and Woodin Cardinals: Computation Beyond the Constructible Universe.Merlin Carl, Philipp Schlicht & Philip Welch - 2018 - Annals of Pure and Applied Logic 169 (4):312-332.
    Direct download (3 more)  
     
    Export citation  
     
    Bookmark   1 citation  
  10.  34
    Comparing Inductive and Circular Definitions: Parameters, Complexity and Games.Kai-Uwe Küdhnberger, Benedikt Löwe, Michael Möllerfeld & Philip Welch - 2005 - 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 (7 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  11.  13
    Discrete Transfinite Computation Models.Philip D. Welch - 2011 - In S. B. Cooper & Andrea Sorbi (eds.), Computability in Context: Computation and Logic in the Real World. World Scientific. pp. 375--414.
  12.  21
    On the Possibility, or Otherwise, of Hypercomputation.Philip D. Welch - 2004 - 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 (8 more)  
     
    Export citation  
     
    Bookmark   5 citations  
  13. Field on Revenge.Agustin Rayo & Philip Welch - 2007 - In J. C. Beall (ed.), Revenge of the Liar: New Essays on the Paradox. Oxford University Press.
  14.  16
    Menachem Magidor. Representing Sets of Ordinals as Countable Unions of Sets in the Core Model. Transactions of the American Mathematical Society, Vol. 317 , Pp. 91–126. [REVIEW]Philip Welch - 1995 - Journal of Symbolic Logic 60 (2):701-704.
  15.  7
    Comparing Inductive and Circular Definitions: Parameters, Complexity and Games.Philip Welch, Kai–Uwe Kühnberger, Benedikt Löwe & Michael Möllerfeld - 2005 - 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 (2 more)  
    Translate
     
     
    Export citation  
     
    Bookmark   2 citations  
  16.  10
    Games and Ramsey-Like Cardinals.Dan Saattrup Nielsen & Philip Welch - 2019 - Journal of Symbolic Logic 84 (1):408-437.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  17.  3
    Bounded Martin's Maximum, Weak Erdӧs Cardinals, and Ψ Ac.David Asperó & Philip D. Welch - 2002 - Journal of Symbolic Logic 67 (3):1141-1152.
  18.  30
    Bounded Martin's Maximum, Weak Erdős Cardinals, and $\Psi\Sb {AC}$.David Asperó & Philip Welch - 2002 - Journal of Symbolic Logic 67 (3):1141-1152.
  19.  28
    Comparing Incomparable Kleene Degrees.Philip Welch - 1985 - Journal of Symbolic Logic 50 (1):55-58.
  20.  6
    The Ramified Analytical Hierarchy Using Extended Logics.Philip D. Welch - 2018 - Bulletin of Symbolic Logic 24 (3):306-318.
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  21.  18
    The Undecidability of Propositional Adaptive Logic.Leon Horsten & Philip Welch - 2009 - Synthese 169 (1):217-218.
    No categories
    Direct download (2 more)  
     
    Export citation  
     
    Bookmark  
  22.  12
    Local Club Condensation and L-Likeness.Peter Holy, Philip Welch & Liuzhen Wu - 2015 - Journal of Symbolic Logic 80 (4):1361-1378.
  23.  21
    Erratum: The Undecidability of Propositional Adaptive Logic.Leon Horsten & Philip Welch - 2009 - Synthese 169 (1):217 - 218.
  24.  24
    The Natural Hierarchy and Quasi-Hierarchy of Constructibility Degrees.Philip Welch - 1986 - 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 (8 more)  
     
    Export citation  
     
    Bookmark  
  25.  17
    Bounded Martin's Maximum, Weak [Image] Cardinals, and [Image].David Asperó & Philip D. Welch - 2002 - 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 (2 more)  
     
    Export citation  
     
    Bookmark  
  26.  2
    Sy D. Friedman. Strong Coding. Annals of Pure and Applied Logic, Vol. 35, Pp. 1–98. - Sy D. Friedman. A Guide to “Strong Coding.”Annals of Pure and Applied Logic, Vol. 35, Pp. 99–122. [REVIEW]Philip Welch - 1990 - Journal of Symbolic Logic 55 (3):1311-1313.
    Direct download (4 more)  
     
    Export citation  
     
    Bookmark  
  27.  10
    The Reals in Core Models.Philip Welch - 1987 - 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 (8 more)  
     
    Export citation  
     
    Bookmark  
  28.  6
    Global Square and Mutual Stationarity at the ℵn.Peter Koepke & Philip D. Welch - 2011 - Annals of Pure and Applied Logic 162 (10):787-806.
    We give the proof of a theorem of Jensen and Zeman on the existence of a global □ sequence in the Core Model below a measurable cardinal κ of Mitchell order ) equal to κ++, and use it to prove the following theorem on mutual stationarity at n.Let ω1 denote the first uncountable cardinal of V and set to be the class of ordinals of cofinality ω1.TheoremIf every sequence n m. In particular, there is such a model in which for (...)
    Direct download (5 more)  
     
    Export citation  
     
    Bookmark  
  29.  7
    Review: Sy D. Friedman, Strong Coding; Sy D. Friedman, A Guide to "Strong Coding.". [REVIEW]Philip Welch - 1990 - Journal of Symbolic Logic 55 (3):1311-1313.
  30.  6
    Minimality in the ▵13-Degrees.Philip Welch - 1987 - 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)  
     
    Export citation  
     
    Bookmark  
  31.  5
    Review: Menachem Magidor, Representing Sets of Ordinals as Countable Unions of Sets in the Core Model. [REVIEW]Philip Welch - 1995 - Journal of Symbolic Logic 60 (2):701-704.
  32.  1
    Minimality in the Δ⅓-Degrees.Philip Welch - 1987 - Journal of Symbolic Logic 52 (4):908-915.
  33.  1
    Minimality in the $Triangle^1_3$-Degrees.Philip Welch - 1987 - 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)  
     
    Export citation  
     
    Bookmark  
  34. Proving Theorems From Reflection.Philip Welch - 2019 - In Deniz Sarikaya, Deborah Kant & Stefania Centrone (eds.), Reflections on the Foundations of Mathematics. Springer Verlag.
    No categories
     
    Export citation  
     
    Bookmark  
  35. Set-Theoretic Absoluteness and the Revision Theory.Philip Welch - 2003 - Bulletin of Symbolic Logic 9 (2):235-237.