• LOGIN
    Login with username and password
Repository logo

BORIS Portal

Bern Open Repository and Information System

  • Publications
  • Theses
  • Research Data
  • Projects
  • Organizations
  • Researchers
  • More
  • Collections
  • Statistics
  • LOGIN
    Login with username and password
Repository logo
Unibern.ch
  1. Home
  2. Publications
  3. Simplified cut elimination for Kripke-Platek set theory
 

Simplified cut elimination for Kripke-Platek set theory

Options
  • Details
  • Files
BORIS DOI
10.48350/177369
Publisher DOI
10.1007/978-3-030-77799-9_2
Description
The purpose of this article is to present a new and simplified cut elimination procedure for KP. We start off from the basic language of set theory and add constants for all elements of the constructible hierarchy up to the Bachmann-Howard ordinal ψ(εΩ+1). This enriched language is then used to set up an infinitary proof system IP whose ordinal-theoretic part is based on a specific notation system C(εΩ+1,0) due to Buchholz and his idea of operator controlled derivations. KP is embedded into IP and complete cut elimination for IP is proved.
Date of Publication
2022
Publication Type
Book Section
Subject(s)
000 Computer science, knowledge & systems
500 Science > 510 Mathematics
Language(s)
en
Contributor(s)
Jäger, Gerhard Max
Institut für Informatik (INF)
Editor(s)
Ferreira, Fernando
Kahle, Reinhard
Sommaruga, Giovanni
Additional Credits
Institut für Informatik (INF)
Publisher
Springer
ISBN
978-3-030-77798-2
Book Title
Axiomatic Thinking II
Access(Rights)
restricted
Show full item
BORIS Portal
Bern Open Repository and Information System
Build: dd892c [ 9.04. 8:30]
Explore
  • Projects
  • Funding
  • Publications
  • Research Data
  • Organizations
  • Researchers
  • Audiovisual Material
  • Software & other digital items
  • Events
More
  • About BORIS Portal
  • Send Feedback
  • Cookie settings
  • Service Policy
Follow us on
  • Mastodon
  • YouTube
  • LinkedIn
UniBe logo