Switch to: References

Add citations

You must login to add citations.
  1. Elementary patterns of resemblance.Timothy Carlson - 2001 - Annals of Pure and Applied Logic 108 (1-3):19-77.
    We will study patterns which occur when considering how Σ1-elementary substructures arise within hierarchies of structures. The order in which such patterns evolve will be seen to be independent of the hierarchy of structures provided the hierarchy satisfies some mild conditions. These patterns form the lowest level of what we call patterns of resemblance. They were originally used by the author to verify a conjecture of W. Reinhardt concerning epistemic theories 449–460; Ann. Pure Appl. Logic, to appear), but their relationship (...)
    Download  
     
    Export citation  
     
    Bookmark   17 citations  
  • An ordinal analysis of parameter free Π12-comprehension.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (3):263-362.
    Abstract.This paper is the second in a series of three culminating in an ordinal analysis of Π12-comprehension. Its objective is to present an ordinal analysis for the subsystem of second order arithmetic with Δ12-comprehension, bar induction and Π12-comprehension for formulae without set parameters. Couched in terms of Kripke-Platek set theory, KP, the latter system corresponds to KPi augmented by the assertion that there exists a stable ordinal, where KPi is KP with an additional axiom stating that every set is contained (...)
    Download  
     
    Export citation  
     
    Bookmark   18 citations  
  • An ordinal analysis of stability.Michael Rathjen - 2005 - Archive for Mathematical Logic 44 (1):1-62.
    Abstract.This paper is the first in a series of three which culminates in an ordinal analysis of Π12-comprehension. On the set-theoretic side Π12-comprehension corresponds to Kripke-Platek set theory, KP, plus Σ1-separation. The strength of the latter theory is encapsulated in the fact that it proves the existence of ordinals π such that, for all β>π, π is β-stable, i.e. Lπ is a Σ1-elementary substructure of Lβ. The objective of this paper is to give an ordinal analysis of a scenario of (...)
    Download  
     
    Export citation  
     
    Bookmark   12 citations  
  • Does mathematics need new axioms.Solomon Feferman, Harvey M. Friedman, Penelope Maddy & John R. Steel - 1999 - Bulletin of Symbolic Logic 6 (4):401-446.
    Part of the ambiguity lies in the various points of view from which this question might be considered. The crudest di erence lies between the point of view of the working mathematician and that of the logician concerned with the foundations of mathematics. Now some of my fellow mathematical logicians might protest this distinction, since they consider themselves to be just more of those \working mathematicians". Certainly, modern logic has established itself as a very respectable branch of mathematics, and there (...)
    Download  
     
    Export citation  
     
    Bookmark   79 citations  
  • Combinatory logic with polymorphic types.William R. Stirton - 2022 - Archive for Mathematical Logic 61 (3):317-343.
    Sections 1 through 4 define, in the usual inductive style, various classes of object including one which is called the “combinatory terms of polymorphic type”. Section 5 defines a reduction relation on these terms. Section 6 shows that the weak normalizability of the combinatory terms of polymorphic type entails the weak normalizability of the lambda terms of polymorphic type. The entailment is not vacuous, because the combinatory terms of polymorphic type are indeed weakly normalizable, as is proven in Sect. 7 (...)
    Download  
     
    Export citation  
     
    Bookmark  
  • Huge reflection.Joan Bagaria & Philipp Lücke - 2023 - Annals of Pure and Applied Logic 174 (1):103171.
    Download  
     
    Export citation  
     
    Bookmark