Arthur W. Apter

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Joel David Hamkins

> Home > Persons > Arthur W. Apter

Publications

2012
[j71]
- view
  authority control:
- export record
  dblp key:
  - journals/aml/ApterGH12
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/aml/ApterGH12
Arthur W. Apter, Victoria Gitman, Joel David Hamkins:
Inner models with large cardinal features usually obtained by forcing. Arch. Math. Log. 51(3-4): 257-283 (2012)
2003
[j36]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/ApterH03
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/ApterH03
Arthur W. Apter, Joel David Hamkins:
Exactly controlling the non-supercompact strongly compact cardinals. J. Symb. Log. 68(2): 669-688 (2003)
2002
[j32]
- view
  authority control:
- export record
  dblp key:
  - journals/jsyml/ApterH02
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jsyml/ApterH02
Arthur W. Apter, Joel David Hamkins:
Indestructibility and The Level-By-Level Agreement Between Strong Compactness and Supercompactness. J. Symb. Log. 67(2): 820-840 (2002)
2001
[j24]
- view
  authority control:
- export record
  dblp key:
  - journals/mlq/ApterH01
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mlq/ApterH01
Arthur W. Apter, Joel David Hamkins:
Indestructible Weakly Compact Cardinals and the Necessity of Supercompactness for Certain Proof Schemata. Math. Log. Q. 47(4): 563-571 (2001)

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.